By Topic

Optimization of Cooperative Spectrum Sensing in Multiple-Channel 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
$33 $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

3 Author(s)
Huogen Yu ; Nat. Key Lab. of Sci. & Technol. on Commun., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Wanbin Tang ; Shaoqian Li

Cooperative spectrum sensing (CSS) is a promising technology in cognitive radio (CR) networks. Among the many existing CSS methods, the cooperation in a single channel is studied extensively. However, CR networks usually deal with multiple channels, therefore multi-channel CSS needs be studied. In this paper, we investigate the problems that how to optimally assign secondary users (SU) to cooperatively sense multiple channels and how to optimally set the sensing time and sensing thresholds. An optimization problem of multi-channel CSS is formulated to maximize the average throughput of CR networks subject to the constraints of probability of detection for each channel. An exhaustive algorithm and a greedy algorithm are proposed to obtain the optimal solutions of the optimization problem. Finally, both analytical and numerical results are presented to demonstrate the effectiveness of our proposed algorithms. It is also shown that the greedy algorithm with a low complexity achieves the same performance as the exhaustive algorithm.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011