Approximation algorithms for restless bandit problems
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A negotiation game for multichannel access in cognitive radio networks
Proceedings of the 4th Annual International Conference on Wireless Internet
On the performance of cognitive access with periodic spectrum sensing
Proceedings of the 2009 ACM workshop on Cognitive radio networks
Optimality of myopic sensing in multichannel opportunistic access
IEEE Transactions on Information Theory
Restless watchdog: selective quickest spectrum sensing in multichannel cognitive radio systems
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
Opportunistic spectrum access in self-similar primary traffic
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
Algorithms for dynamic spectrum access with learning for cognitive radio
IEEE Transactions on Signal Processing
Betting on Gilbert-Elliot channels
IEEE Transactions on Wireless Communications
Multi-channel opportunistic access: a case of restless bandits with multiple plays
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Analysis of dynamic spectrum access with heterogeneous networks: benefits of channel packing scheme
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Myopic sensing for multiple SUs in multichannel opportunistic access
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Restless watchdog: monitoring multiple bands with blind period in cognitive radio systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Dynamic multichannel access with imperfect channel state detection
IEEE Transactions on Signal Processing
Queuing analysis in multichannel cognitive spectrum access: a large deviation approach
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay analysis for cognitive radio networks with random access: a fluid queue view
INFOCOM'10 Proceedings of the 29th conference on Information communications
Steady-state Markov chain analysis for heterogeneous cognitive radio networks
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
IEEE Transactions on Information Theory
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
Proceedings of the 24th International Teletraffic Congress
A dynamic programming approximation for downlink channel allocation in cognitive femtocell networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.13 |
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.