Channel-adaptive optimal OFDMA scheduling

Xin Wang, Georgios B Giannakis, Yingqun Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless transmissions. Using a time-sharing argument, a convex formulation is obtained avoiding the NP-hardness of the usual 0-1 integer program solution. It is rigourously established that the optimal allocation can be obtained almost surely through a greedy water-filling approach with linear complexity in the number of users and subcarriers. Stochastic approximation is further employed to develop on-line algorithms which are capable of dynamically learning the underlying channel distribution and asymptotically converges to the off-line optimal solution from arbitrary initial values.

Original languageEnglish (US)
Title of host publicationForty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings
Pages536-541
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event41st Annual Conference on Information Sciences and Systems, CISS 2007 - Baltimore, MD, United States
Duration: Mar 14 2007Mar 16 2007

Publication series

NameForty-first Annual Conference on Information Sciences and Systems, CISS 2007 - Proceedings

Other

Other41st Annual Conference on Information Sciences and Systems, CISS 2007
CountryUnited States
CityBaltimore, MD
Period3/14/073/16/07

Keywords

  • Convex optimization
  • OFDMA scheduling
  • Stochastic approximation

Fingerprint Dive into the research topics of 'Channel-adaptive optimal OFDMA scheduling'. Together they form a unique fingerprint.

Cite this