Competitive scheduling for OFDMA systems with guaranteed transmission rate

  • Authors:
  • Wenhua Jiao;Linghe Cai;Meixia Tao

  • Affiliations:
  • Alcatel-Lucent (China), 5/F, Tower C, Wangjing Sci. & Tech Park, Beijing 100102, China;Beijing University of Posts and Telecommunications, Beijing 100876, China;Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai 200240, China

  • Venue:
  • Computer Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.24

Visualization

Abstract

Next-generation broadband wireless standards use orthogonal frequency division multiple access (OFDMA) as the preferred physical layer multiple access scheme, especially for the downlink. Due to limited resources available at the base station, multi-user resource allocation is crucial for delivering the applications with various quality-of-service (QoS) demands. We study the OFDMA resource allocation problem for the adaptive modulation and coding (AMC) mode of mobile WiMAX, in which resources in the form of allocation units (AU) are to be allocated and the channel knowledge of only some good sub-channels for the users is available to the scheduler. The objective is to maximize the sum-rate for all the users while maintaining guaranteed minimum and maximum traffic rates for certain users under a total transmission power constraint. Two novel factors, band selectivity factor (BSF) and competition factor (CF), are introduced. Based on the two factors, we propose a sub-optimal approach, rate-guaranteed competitive scheduling (RCS). It is suitable to be deployed in practical systems and exploits multi-user diversity with very low complexity. Simulation results show that RCS can achieve almost 75% of throughput of the optimal solution.