On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance
Top Cited Papers
- 22 December 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 7 (12) , 5431-5440
- https://doi.org/10.1109/t-wc.2008.071349
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 problem is to design a sensing policy for channel selection to maximize the average reward, which can be formulated as a multi-arm restless bandit process. 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 round-robin 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 numerical results. 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 and its scaling behavior with respect to the number of channels. These results apply to cognitive radio networks, opportunistic transmission in fading environments, downlink scheduling in centralized networks, and resource-constrained jamming and anti-jamming.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian RewardsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Optimal channel probing and transmission scheduling for opportunistic spectrum accessPublished by Association for Computing Machinery (ACM) ,2007
- Information capacity and power control in single-cell multiuser communicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index HeuristicOperations Research, 2000
- The Complexity of Optimal Queuing Network ControlMathematics of Operations Research, 1999
- Error statistics in data transmission over fading channelsIEEE Transactions on Communications, 1998
- On an index policy for restless banditsJournal of Applied Probability, 1990
- Restless bandits: activity allocation in a changing worldJournal of Applied Probability, 1988
- The Optimal Control of Partially Observable Markov Processes over a Finite HorizonOperations Research, 1973
- Capacity of a Burst-Noise ChannelBell System Technical Journal, 1960