By Topic

Dynamic Channel Selection in Cognitive Radio Network with Channel Heterogeneity

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

2 Author(s)
Fen Hou ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China ; Jianwei Huang

We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS) problem as a binary integer nonlinear optimization problem, with an objective of maximizing the total channel utilization for all secondary nodes. We first prove that MCS problem is NP-complete. Then we design a centralized greedy channel selection (GCS) algorithm. The GCS algorithm is polynomial in computational complexity, and achieves a close-to-optimal (higher than 95%) numerical performance. We further propose a distributed priority order channel selection algorithm, which has significantly less signaling overhead compared with the GCS algorithm. We study the performance of the distributed algorithm both theoretically and numerically.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010