A Fast Neighbor Discovery Algorithm for Cognitive Radio Ad Hoc Networks
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.