On Myopic Sensing for Multi-Channel Opportunistic Access
Preprint
Abstract
We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elliot channel model). A user chooses one channel to sense and access in each slot and collects a reward determined by the state of the chosen channel. The objective is to design a sensing policy for channel selection to maximize the average reward. In this paper, we study the structure, optimality, and performance of the myopic sensing policy. We show that the myopic sensing policy has a simple robust structure that reduces channel selection to a counting procedure and obviates the need for knowing the channel transition probabilities. The optimality of this simple policy is established for the two-channel case and conjectured for the general case based on extensive simulations. The performance of the myopic sensing policy is analyzed, which, based on the optimality of myopic sensing, characterizes the maximum throughput of a multi-channel opportunistic communication system in terms of the number of channels. These results apply to cognitive radio networks for spectrum overlay, opportunistic transmission in fading environments, and resource-constrained jamming and anti-jamming.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Optimality of Myopic Sensing in Multichannel Opportunistic AccessIEEE Transactions on Information Theory, 2009
- Opportunistic Spectral Usage: Bounds and a Multi-Band CSMA/CA ProtocolIEEE/ACM Transactions on Networking, 2007
- A Survey of Dynamic Spectrum AccessIEEE Signal Processing Magazine, 2007
- Opportunistic file transfer over a fading channel: A POMDP search theory formulation with optimal threshold policiesIEEE Transactions on Wireless Communications, 2006
- The complexity of optimal queueing network control2002
- Error statistics in data transmission over fading channelsIEEE Transactions on Communications, 1998
- Bandit Processes and Dynamic Allocation IndicesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1979
- The Optimal Control of Partially Observable Markov Processes over a Finite HorizonOperations Research, 1973