An improved margin adaptive subcarrier allocation with fairness for multiuser OFDMA system

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, according to the margin adaptive (MA) algorithm with fixed transmission rate, we propose a suboptimal MA Greedy algorithm with demand function. In this algorithm, the allocation process is divided into two separate steps, resource calculation and subcarrier allocation. With the employment of overload inhibition process, diversity scheduling method and demand function, we improve the traditional MA algorithms to reduce the computing complexity with subscribers' fairness and Quality of Service (QoS) guaranteed. Utilizing the simulation with real-time services, we have proved that compared to static allocation algorithms, our MA Greedy algorithm could enhance the system performance by 5-6dB with low computing complexity, which is very close to the optimal MA algorithm. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, T., Su, G., Zhu, G., Jiang, J., & Zhang, H. (2009). An improved margin adaptive subcarrier allocation with fairness for multiuser OFDMA system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5553 LNCS, pp. 829–838). https://doi.org/10.1007/978-3-642-01513-7_90

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free