Change search
ReferencesLink to record
Permanent link

Direct link
Performance Prediction for OFDMA Systems with Dynamic Power and Subcarrier Allocation
UMIC Research Centre, RWTH Aachen University, Germany.ORCID iD: 0000-0001-6682-6559
Institute for Theoretical Information Technology, RWTH Aachen University, Germany.
2011 (English)In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 34, no 8, 973-984 p.Article in journal (Refereed) Published
Abstract [en]

It is well known that channel-dependent OFDMA resource assignment algorithms provide a significant performance improvement compared to static (i.e., channel-unaware) approaches. Such dynamic algorithms constantly adapt resource assignments to current channel states according to some objective function. Due to these dynamics, it is difficult to predict the resulting performance for such schemes given a certain scenario (characterized by the number of terminals in the cell and their average channel gains). In this paper we provide a novel, analytical framework for performance prediction, which takes dynamic power and subcarrier allocation into account. The analysis is based on fundamental transformations of the channel gains caused by the dynamic subcarrier allocations. This insight allows for deriving probability functions of the achieved rate per subcarrier which ultimately yields expressions for the expected minimal rates as well as outage probabilities for certain rate demands. Hence, the methods presented in this paper for performance prediction can be employed for admission control in systems with dynamic resource allocation. We illustrate the applicability of our derivations with respect to the capacity of 802.16e systems for Voice-over-IP and video streams. The results demonstrate a significant improvement compared to state-of-the art approaches but also reveal room for improvement of this approach compared to the optimal system performance.

Place, publisher, year, edition, pages
Elsevier, 2011. Vol. 34, no 8, 973-984 p.
National Category
URN: urn:nbn:se:kth:diva-134785DOI: 10.1016/j.comcom.2010.06.020ISI: 000291119200006ScopusID: 2-s2.0-79953851770OAI: diva2:668052

QC 20131128

Available from: 2013-11-28 Created: 2013-11-28 Last updated: 2014-01-20Bibliographically approved

Open Access in DiVA

fulltext(795 kB)42 downloads
File information
File name FULLTEXT01.pdfFile size 795 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Gross, James
In the same journal
Computer Communications

Search outside of DiVA

GoogleGoogle Scholar
Total: 42 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 68 hits
ReferencesLink to record
Permanent link

Direct link