Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Cross-Layer Resource Allocation Model for Cellular-Relaying Network Performance Evaluation
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikationssystem, CoS.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikationssystem, CoS. KTH, Skolan för informations- och kommunikationsteknik (ICT), Centra, KTH Center för Trådlösa System, Wireless@kth.ORCID-id: 0000-0003-4986-6123
2011 (Engelska)Ingår i: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 60, nr 6, s. 2765-2776Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

The enhancement of cellular networks with relaying technologies is expected to bring significant technoeconomic benefits at the expense of more complex resource allocation. Suitable models for solving network dimensioning problems in cellular-relaying networks must handle radio resource allocation among hundreds of links and tackle interactions between networking layers. For this purpose, we propose a novel cross-layer resource allocation model based on average interference and ideal rate adaptation for the physical layer (PHY), time shares for the medium access layer, and fluid flows for the transport and network layers. We formulate a centralized social welfare maximization problem. When the routes are selected with an a priori algorithm, we show that the resource allocation problem admits an equivalent convex formulation. We show a numerical example for how to use the proposed framework for configuring the backhaul link in a practical relaying network. The overall problem of selecting routes and allocating time shares and link rates is nonconvex. We propose an iterative suboptimal algorithm to solve the problem based on a novel approximation of PHY. We state and prove several convergence properties of the algorithm and show that it typically outperforms routing based on signal-to-noise ratio only.

Ort, förlag, år, upplaga, sidor
2011. Vol. 60, nr 6, s. 2765-2776
Nyckelord [en]
Cellular-relaying networks, convex optimization, cross layer, radio resource allocation
Nationell ämneskategori
Telekommunikation
Identifikatorer
URN: urn:nbn:se:kth:diva-38929DOI: 10.1109/TVT.2011.2156438ISI: 000293684600029Scopus ID: 2-s2.0-79960355208OAI: oai:DiVA.org:kth-38929DiVA, id: diva2:438724
Tillgänglig från: 2011-09-05 Skapad: 2011-09-05 Senast uppdaterad: 2017-12-08Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Sök vidare i DiVA

Av författaren/redaktören
Timus, BogdanSoldati, PabloZander, Jens
Av organisationen
Kommunikationssystem, CoSReglerteknikKTH Center för Trådlösa System, Wireless@kth
I samma tidskrift
IEEE Transactions on Vehicular Technology
Telekommunikation

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 86 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf