Opportunistic scheduling with limited channel state information: A rate distortion approach
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 tra...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2015
|
Online Access: | http://hdl.handle.net/1721.1/96984 https://orcid.org/0000-0002-2109-0979 https://orcid.org/0000-0001-8238-8130 |
_version_ | 1811098068794212352 |
---|---|
author | Johnston, Matthew Ryan Polyanskiy, Yury Modiano, Eytan H. |
author2 | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
author_facet | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Johnston, Matthew Ryan Polyanskiy, Yury Modiano, Eytan H. |
author_sort | Johnston, Matthew Ryan |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T17:09:24Z |
format | Article |
id | mit-1721.1/96984 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T17:09:24Z |
publishDate | 2015 |
publisher | Institute of Electrical and Electronics Engineers (IEEE) |
record_format | dspace |
spelling | mit-1721.1/969842022-10-03T10:47:28Z Opportunistic scheduling with limited channel state information: A rate distortion approach Johnston, Matthew Ryan Polyanskiy, Yury Modiano, Eytan H. 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 Johnston, Matthew Ryan Modiano, Eytan H. Polyanskiy, Yury 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. National Science Foundation (U.S.) (Grant CNS-0915988) National Science Foundation (U.S.) (Grant CNS-1217048) United States. Army Research Office. Multidisciplinary University Research Initiative (Grant W911NF-08-1-0238) United States. Office of Naval Research (Grant N00014-12-1-0064) National Science Foundation (U.S.). Center for Science of Information (Grant CCF-09-39370) 2015-05-14T12:50:42Z 2015-05-14T12:50:42Z 2014-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4799-5186-4 http://hdl.handle.net/1721.1/96984 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). https://orcid.org/0000-0002-2109-0979 https://orcid.org/0000-0001-8238-8130 en_US http://dx.doi.org/10.1109/ISIT.2014.6875057 Proceedings of the 2014 IEEE International Symposium on Information Theory Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
spellingShingle | Johnston, Matthew Ryan Polyanskiy, Yury Modiano, Eytan H. Opportunistic scheduling with limited channel state information: A rate distortion approach |
title | Opportunistic scheduling with limited channel state information: A rate distortion approach |
title_full | Opportunistic scheduling with limited channel state information: A rate distortion approach |
title_fullStr | Opportunistic scheduling with limited channel state information: A rate distortion approach |
title_full_unstemmed | Opportunistic scheduling with limited channel state information: A rate distortion approach |
title_short | Opportunistic scheduling with limited channel state information: A rate distortion approach |
title_sort | opportunistic scheduling with limited channel state information a rate distortion approach |
url | http://hdl.handle.net/1721.1/96984 https://orcid.org/0000-0002-2109-0979 https://orcid.org/0000-0001-8238-8130 |
work_keys_str_mv | AT johnstonmatthewryan opportunisticschedulingwithlimitedchannelstateinformationaratedistortionapproach AT polyanskiyyury opportunisticschedulingwithlimitedchannelstateinformationaratedistortionapproach AT modianoeytanh opportunisticschedulingwithlimitedchannelstateinformationaratedistortionapproach |