• DocumentCode
    751366
  • Title

    Scheduling Algorithms for Time-Varying Downlink Channels

  • Author

    Jang, Edward W. ; Cho, Younggeun ; Choi, Ji-Woong ; Cioffi, John M.

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., Stanford, CA
  • Volume
    7
  • Issue
    6
  • fYear
    2008
  • fDate
    6/1/2008 12:00:00 AM
  • Firstpage
    2063
  • Lastpage
    2068
  • 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.
  • Keywords
    combinatorial mathematics; optimisation; time-varying channels; combinatorial optimization problem; scheduling algorithms; time-varying downlink channels; Algorithm design and analysis; Base stations; Channel state information; Computer simulation; Downlink; Frequency division multiplexing; OFDM; Processor scheduling; Scheduling algorithm; Wireless communication;
  • fLanguage
    English
  • Journal_Title
    Wireless Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1536-1276
  • Type

    jour

  • DOI
    10.1109/TWC.2008.070245
  • Filename
    4543058
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=751366