Proportional fairness with minimum rate guarantee scheduling in a multiuser OFDMA wireless network

  • Authors:

  • Nararat Ruangchaijatupon;Yusheng Ji

  • Affiliations:

  • National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Tokyo, Japan;National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Tokyo, Japan

  • Venue:
  • Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a novel downlink scheduling scheme for a multiuser OFDMA/TDD network. Resources in one OFDMA frame are defined as a number of chunks that are composed of frequency and time. Time multiplexing is allowed by using time slots. With multichannel multiuser diversity, our scheme aims to satisfy the required minimum bit rate, maximize system utilization, and provide throughput fairly among users. We formulate the optimization problem based upon a multichannel proportional fairness with minimum bit rate guarantee. The solution is considered by using the Lagrange multipliers with relaxed constraints. Then, our fast cross-layer approach integrates the requirement to the solution and schedules packets with finitely backlogged queue consideration. Simulation with user mobility concern is conducted and results show that the proposed scheme can satisfy minimum bit rate requirement, as well as can provide high throughput fairness.