Abstract
In a Cognitive Radio Network (CRN), a cognitive node temporarily and opportunistically uses a channel not occupied by any licensed user. Achieving a rendezvous between any pair of nodes in CRNs is challenging. Applying channel hopping is a common mechanism to solve the rendezvous problem without using a dedicated control channel. Existing channel hopping solutions may suffer from poor rendezvous. Besides, most of the solutions do not consider providing the even rendezvous opportunity for different pairs of nodes. In this paper, we propose a novel distributed channel hopping protocol which efficiently provides rendezvous guarantee and fair rendezvous opportunity by utilizing the concepts of Hadamard matrix and hash function. Simulation results verify that the proposed protocol performs better in terms of time to rendezvous and network throughput when compared to existing representative protocols Jump-stay, ACH, and QLCH.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
