By Topic

Channel Exploration and Exploitation with Imperfect Spectrum Sensing in Cognitive Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhou Zhang ; Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada ; Hai Jiang ; Peng Tan ; Slevinsky, J.

In this paper, the problem of opportunistic channel sensing and access in cognitive radio networks when the sensing is imperfect and a secondary user can access up to a limited number of channels at a time is investigated. Primary users' statistical information is assumed to be unknown, and therefore, a secondary user needs to learn the information online during channel sensing and access process, which means learning loss, also referred to as regret, is inevitable. For each channel, the busy/idle state is independent from one slot to another. In this research, the case when all potential channels can be sensed simultaneously is investigated first. The channel access process is modeled as a multi-armed bandit problem with side observation. And channel access rules are derived and theoretically proved to have asymptotically finite regret. Then the case when the secondary user can sense only a limited number of channels at a time is investigated. The channel sensing and access process is modeled as a bi-level multi-armed bandit problem. It is shown that any adaptive rule has at least logarithmic regret. Then we derive channel sensing and access rules and theoretically prove that they have logarithmic regret asymptotically and with finite time. The case when the busy/idle states of a channel are correlated over slots is also investigated. And a channel sensing and access rule with logarithmic regret is derived. The effectiveness of the derived rules is validated by simulation.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:31 ,  Issue: 3 )