• DocumentCode
    2822872
  • Title

    Energy-optimal scheduling with dynamic channel acquisition in wireless downlinks

  • Author

    Li, Chih-ping ; Neely, Michael J.

  • Author_Institution
    Univ. of Southern California, Los Angeles
  • fYear
    2007
  • fDate
    12-14 Dec. 2007
  • Firstpage
    1140
  • Lastpage
    1147
  • Abstract
    We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state information (CSI) can stabilize the system and achieve the full capacity region. However, opportunistic scheduling algorithms with full CSI may not be energy efficient when the cost of channel acquisition is high and traffic rates are low. In particular, under the low traffic rate regime, it may be sufficient and more energy-efficient to transmit data with no CSI, i.e., to transmit data blindly, since no power for channel acquisition is consumed. In general, we show that purely channel-aware or purely channel-blind strategies are not necessarily optimal, and we must consider mixed strategies. We derive a unified scheduling algorithm that dynamically chooses to transmit data with full or no CSI based on queue backlog and channel statistics. Through Lyapunov analysis, we show that the unified algorithm can stabilize the downlink with optimal power consumption.
  • Keywords
    queueing theory; scheduling; wireless channels; Lyapunov analysis; channel state information; channel statistics; dynamic channel acquisition; energy-optimal scheduling; opportunistic scheduling algorithms; queue backlog; time-varying channels; wireless base station; wireless downlinks; Base stations; Channel state information; Costs; Downlink; Dynamic scheduling; Energy efficiency; Scheduling algorithm; Statistics; Time-varying channels; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2007 46th IEEE Conference on
  • Conference_Location
    New Orleans, LA
  • ISSN
    0191-2216
  • Print_ISBN
    978-1-4244-1497-0
  • Electronic_ISBN
    0191-2216
  • Type

    conf

  • DOI
    10.1109/CDC.2007.4434517
  • Filename
    4434517