Symmetric Channel Hopping algorithm for a Cognitive Radio Network in Asynchronous environment

Rendezvous is a critical step in Cognitive Radio Network (CRN) prior to transmission for establishing communication links between secondary users (SUs). Due to the long-term blocking, channel saturation, and scalability issues encountered by dedicated common control channels (CCC) in a distributed CRN, rendezvous is preferable on the available idle channels of the primary users (PUs). In fact, each SU is unaware of the other SUs’ available channel sets, and the blind rendezvous is performed through the channel hopping (CH) process. As a result, ensuring a rendezvous between two SUs in a finite period in an asynchronous environment remains a challenging problem. In this work, a disjoint difference set based CH (DDSCH) method is developed that ensures the highest degree of rendezvous in comparatively less time.