Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cross-Layer Resource Allocation Model for Cellular-Relaying Network Performance Evaluation
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
KTH, School of Electrical Engineering (EES), Automatic Control.
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.ORCID iD: 0000-0003-4986-6123
2011 (English)In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 60, no 6, 2765-2776 p.Article in journal (Refereed) 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.

Place, publisher, year, edition, pages
2011. Vol. 60, no 6, 2765-2776 p.
Keyword [en]
Cellular-relaying networks, convex optimization, cross layer, radio resource allocation
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-38929DOI: 10.1109/TVT.2011.2156438ISI: 000293684600029Scopus ID: 2-s2.0-79960355208OAI: oai:DiVA.org:kth-38929DiVA: diva2:438724
Available from: 2011-09-05 Created: 2011-09-05 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Zander, Jens

Search in DiVA

By author/editor
Timus, BogdanSoldati, PabloZander, Jens
By organisation
Communication Systems, CoSAutomatic ControlCenter for Wireless Systems, Wireless@kth
In the same journal
IEEE Transactions on Vehicular Technology
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 68 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf