Scheduling Algorithms for Time-Varying Downlink Channels

  • Authors:

  • E. W. Jang;Younggeun Cho;Ji-Woong Choi;J. M. Cioffi

  • Affiliations:

  • Dept. of Electr. Eng., Stanford Univ., Stanford, CA;-;-;-

  • Venue:
  • IEEE Transactions on Wireless Communications
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

To maximize the spectral efficiency for a time- varying downlink channel with multiple users, the scheduling order of the users needs to be optimized. The scheduling problem naturally is a combinatorial optimization problem with high complexity, which exponentially increases with the number of users. This paper proposes several low-complexity scheduling algorithms. Computer simulation results show that the proposed algorithms approach optimal performance.