Opportunistic scheduling with limited channel state information: A rate distortion approach
Name
Modiano_Opportunistic scheduling.pdf
Size
276.65 KB
Format
Adobe PDF
Checksum (MD5)
ec52e4baa6f495d350d51e51f2257843
Author(s)
Johnston, Matthew Ryan
Polyanskiy, Yury
Modiano, Eytan H.
Date Issued
June 2014
Journal
Proceedings of the 2014 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Johnston, Matthew, Eytan Modiano, and Yury Polyanskiy. “Opportunistic Scheduling with Limited Channel State Information: A Rate Distortion Approach.” 2014 IEEE International Symposium on Information Theory (June 2014).
Version
Author's final manuscript
Abstract
We consider an opportunistic communication system in which a transmitter selects one of multiple channels over which to schedule a transmission, based on partial knowledge of the network state. We characterize a fundamental limit on the rate that channel state information must be conveyed to the transmitter in order to meet a constraint on expected throughput. This problem is modeled as a causal rate distortion optimization of a Markov source. We introduce a novel distortion metric capturing the impact of imperfect channel state information on throughput. We compute a closed-form expression for the causal information rate distortion function for the case of two channels, as well as an algorithmic upper bound on the causal rate distortion function. Finally, we characterize the gap between the causal information rate distortion and the causal entropic rate-distortion functions.
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
https://doi.org/10.1109/ISIT.2014.6875057
