An Improved Margin Adaptive Subcarrier Allocation with Fairness for Multiuser OFDMA System

Authors:
Tan Li;Gang Su;Guangxi Zhu;Jun Jiang;Hui Zhang
Affiliations:
Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan, China 430074 and State Key Laboratory of ISN, Xidian University, Xi'an, China 710071;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan, China 430074;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan, China 430074;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan, China 430074;State Key Laboratory of ISN, Xidian University, Xi'an, China 710071
Venue:
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Year:
2009

Citing 5
Cited 0

Computationally efficient bandwidth allocation and power control for OFDMA

IEEE Transactions on Wireless Communications
Multiuser adaptive subcarrier-and-bit allocation with adaptive cell selection for OFDM systems

IEEE Transactions on Wireless Communications
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design

IEEE Transactions on Wireless Communications
Multiuser OFDM with adaptive subcarrier, bit, and power allocation

IEEE Journal on Selected Areas in Communications
Transmit power adaptation for multiuser OFDM systems

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.