Adaptive subcarrier and bit allocation in OFDMA systems supporting heterogeneous services

Authors:
Guanding Yu;Zhaoyang Zhang;Peiliang Qiu
Affiliations:
Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, P. R. China 310027;Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, P. R. China 310027;Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, P. R. China 310027
Venue:
Wireless Personal Communications: An International Journal
Year:
2007

Citing 0
Cited 4

Dynamic subchannel and slot allocation for OFDMA networks supporting mixed traffic: upper bound and a heuristic algorithm

IEEE Communications Letters
A load adaptive subcarrier and bit allocation algorithm for non-real time services in an OFDMA system

ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Adaptive Subcarrier and Power Allocation with Fairness for Multi-user Space-Time Block-Coded OFDM System

Wireless Personal Communications: An International Journal
Adaptive Power and Subchannel Allocation for Dual-Class OFDMA Packet Data Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Orthogonal Frequency Division Multiple Access (OFDMA) is an efficient multiple access method for the future wireless systems. This paper studies the adaptive subcarrier and bit allocation problem in OFDMA systems to support heterogeneous services. The goal of the considered resource optimization technique is to maximize the total system throughput under the overall transmit power constraint while guaranteeing the QoS requirement of realtime users and supporting proportional fairness among non-realtime users. First, we introduce a Rate Adaptive (RA) resource allocation algorithm for non-realtime users and a Margin Adaptive (MA) algorithm for realtime users. Then, based on the previous algorithms, a novel algorithm is proposed to allocate the resource to both classes of users, which makes an efficient tradeoff between the resource usage of realtime users and non-realtime users. The algorithm is locally optimal solution provided that the MA and RA algorithms are utilized. Also, to reduce the computational complexity, a suboptimal method based on the balancing of the average power per subcarrier is also introduced. Monte Carlo simulation results show that all the proposed algorithms outperform the existing counterparts. The results also show that the suboptimal method for heterogeneous services can efficiently reduce the computational complexity at the cost of very little performance degradation.