Location of Repository

A Low-Complexity QoS-Aware Proportional Fair Multicarrier Scheduling Algorithm for OFDM Systems

By Zhen Kong, Yu-Kwong Kwok and Jiangzhou Wang

Abstract

Orthogonal frequency-division multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judiciousl packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM systems, the applicability and performance of traditional wireless packet-scheduling algorithms, which are usually designed for single-carrier systems, are largely unknown. In this paper, we propose a new quality-of-service (QoS)-aware proportional fairness (QPF) packet-scheduling policy with low complexity for the downlink of multiuser OFDM systems to allocate radio resources among users. Our proposed algorithm is based on a cross-layer design in that the scheduler is aware of both the channel (i.e. physical layer)and the queue state (i.e. data link layer) information to achieve proportional fairness while maximising each user's packet-level QoS performance. The simulation results show that the proposed QPF algorithm is efficient in terms of average system throughput, packet-dropping probability, and packet delay, while maintaining adequate fairness among users with relatively low scheduling overhead

Topics: TK5103.4
Year: 2009
OAI identifier: oai:kar.kent.ac.uk:23414
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1109/TVT.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.