Channel probing in communication systems: Myopic policies are not always optimal
Author(s)
Keslassy, Isaac; Johnston, Matthew Ryan; Modiano, Eytan H
DownloadJohnstonISIT2013 copy.pdf (224.4Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We consider a multi-channel communication system in which a transmitter has access to a large number of channels, but does not know the state of these channels. We model channel state using an ON/OFF Markovian model, and allow the transmitter to probe one of the channels at predetermined probing intervals to decide over which channel to transmit. For models in which the transmitter must send over the probed channel, it has been shown that a myopic policy that probes the channel most likely to be ON is optimal. In this work, we allow the transmitter to select a channel over which to transmit that is not necessarily the one it probed. We show that the myopic policy is not optimal, and propose a simple alternative probing policy, which achieves a higher per-slot expected throughput. Finally, we consider the case where there is a fixed cost associated with probing and derive optimal probing intervals.
Date issued
2013-10Department
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 SystemsJournal
2013 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Johnston, Matthew, Eytan Modiano, and Isaac Keslassy. “Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal.” 2013 IEEE International Symposium on Information Theory (July 2013), Istanbul, Turkey,Institute of Electrical and Electronics Engineers (IEEE), 2013.
Version: Author's final manuscript
ISBN
978-1-4799-0446-4
ISSN
2157-8117
2157-8095