Scheduling over time varying channels with hidden state information
Name
ISIT15_noCSI.pdf
Size
259.31 KB
Format
Adobe PDF
Checksum (MD5)
8a54c89cd0026445e15a9ff752cb50ae
Author(s)
Johnston, Matthew
Modiano, Eytan H.
Date Issued
June 2015
Journal
Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Johnston, Matthew, and Eytan Modiano. “Scheduling over Time Varying Channels with Hidden State Information.” 2015 IEEE International Symposium on Information Theory (ISIT) (June 2015).
Version
Author's final manuscript
Abstract
We consider the problem of scheduling transmissions over a wireless downlink when channel state information (CSI) is not available to the transmitter. We assume channel states are time varying and evolve according to a Markov Chain. We show that using current QLI does not stabilize the system due to correlations between backlog and channel state. We show that the throughput optimal scheduling policy in this context must use delayed queue length information (QLI). We characterize the extent to which QLI must be delayed as a function of the channel state statistics.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/ISIT.2015.7282686
