By Topic

A fast neighbor discovery algorithm for cognitive radio ad hoc 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

3 Author(s)
Zhang Jian-zhao ; Inst. of Commun. Eng., PLA Univ. of Sci. & Technol., Nanjing, China ; Zhao Hang-sheng ; Yao Fu-qiang

Cognitive radio (CR) is a revolution in wireless communication and CR ad hoc network(CRAHN) is under extensive research recently. In CRAHN, no control network infrastructure can be utilized and CR users have to attain the first hand information for networking. Neighbor discovery is a fundamental work for cooperation among CR users. This paper addresses the distributed neighbor discovery in CRAHNs. A fast neighbor discovery algorithm based on the available channel comparability among neighboring nodes is proposed. The algorithm makes use of data transceiver to accelerate the discovery process without increasing hardware requirement for CR users. The correctness and efficiency of the algorithm is proved through analysis as well as simulation.

Published in:

Communication Technology (ICCT), 2010 12th IEEE International Conference on

Date of Conference:

11-14 Nov. 2010