Scheduling over time varying channels with hidden state information

Author(s)
Johnston, Matthew; Modiano, Eytan H.
Thumbnail
DownloadISIT15_noCSI.pdf (259.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2015-06
URI
http://hdl.handle.net/1721.1/100412
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
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
ISBN
978-1-4673-7704-1
Collections