Taming Wheel of Fortune in the Air: An Algorithmic Framework for Channel Selection Strategy in Cognitive Radio Networks
- 20 August 2012
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 62 (2) , 783-796
Abstract
Cognitive radio (CR) has been proposed to improve spectrum efficiency by taking advantage of the vacancies in primary channels. Since the frequency range of operation is very wide in a CR network (CRN) and, usually, CRs cannot scan all the channels simultaneously, one of the fundamental tasks for a CR is the channel selection strategy, which directly impacts its performance. In this paper, we present a distributed polynomial time algorithmic framework for computing channel strategies in a CRN with no assumption on the distribution followed by the primary users' channel occupancy. For a secondary user (SU), the upper bound on the gap between the expected profit obtained at each time slot by using the global optimal strategy and the expected profit by using our algorithm is guaranteed to be arbitrarily small when the time horizon is sufficiently large. We also prove an upper bound on the gap between the expected profit by using any strategy sequence and the expected profit by using our strategy sequence.Keywords
This publication has 25 references indexed in Scilit:
- On the feasibility of effective opportunistic spectrum access2010
- Opportunistic medium access in multi-channel wireless systems: A learning approach2010
- Distributed Learning in Multi-Armed Bandit With Multiple PlayersIEEE Transactions on Signal Processing, 2010
- Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation2010
- Cognitive Medium Access: Exploration, Exploitation, and CompetitionIEEE Transactions on Mobile Computing, 2010
- Distributed Algorithms for Approximating Wireless Network Capacity2010
- Optimal selection of channel sensing order in cognitive radioIEEE Transactions on Wireless Communications, 2009
- A Negotiation Game for Multichannel Access in Cognitive Radio Networks2008
- Dependent rounding and its applications to approximation algorithmsJournal of the ACM, 2006
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985