Optimality of Myopic Sensing in Multi-Channel Opportunistic Access
Authors:
- Sahand H. A. AhmadSASahand H. A. Ahmad
- Mingyan LiuMLMingyan Liu
- Tara JavidiTJTara Javidi
- Qing ZhaoQZQing Zhao
- Bhaskar KrishnamachariBhaskar Krishnamachari
Preprint
Abstract
We consider opportunistic communications over multiple channels where the state ("good" or "bad") of each channel evolves as independent and identically distributed Markov processes. A user, with limited sensing and access capability, chooses one channel to sense and subsequently access (based on the sensed channel state) in each time slot. A reward is obtained when the user senses and accesses a "good" channel. The objective is to design the optimal channel selection policy that maximizes the expected reward accrued over time. This problem can be generally cast as a Partially Observable Markov Decision Process (POMDP) or a restless multi-armed bandit process, to which optimal solutions are often intractable. We show in this paper that the myopic policy, with a simple and robust structure, achieves optimality under certain conditions. This result finds applications in opportunistic communications in fading environment, cognitive radio networks for spectrum overlay, and resource-constrained jamming and anti-jamming.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Server allocation with delayed state observation: Sufficient conditions for the optimality of an index policyIEEE Transactions on Wireless Communications, 2009
- On myopic sensing for multi-channel opportunistic access: structure, optimality, and performanceIEEE Transactions on Wireless Communications, 2008
- A Survey of Dynamic Spectrum AccessIEEE Signal Processing Magazine, 2007
- Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP frameworkIEEE Journal on Selected Areas in Communications, 2007
- Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent ConnectivityIEEE Transactions on Information Theory, 2007
- The complexity of optimal queueing network control2002
- ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSESProbability in the Engineering and Informational Sciences, 2000
- On the average cost optimality equation and the structure of optimal policies for partially observable Markov decision processesAnnals of Operations Research, 1991
- Multi-Armed Bandits and the Gittins IndexJournal of the Royal Statistical Society Series B: Statistical Methodology, 1980
- Bandit Processes and Dynamic Allocation IndicesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1979