LAUSR

AbstractEstablishing communications in a cognitive radio networks (CRNs) requires communicating nodes to “rendezvous” before transmitting their data packets. Channel hopping (CH) rendezvous algorithms can provide guaranteed rendezvous for CRNs without common control channels. A new rendezvous algorithm named adjusted disjoint finite cover rendezvous (ADFC-CH) is proposed, which can be used in more general cognitive radio networks such as synchronous clock, heterogeneous model, symmetric role, and anonymous information. The relationship between the concept in mathematics called disjoint finite cover (DFC) and rendezvous process is built in ADFC-CH. The ADFC-CH produces a channel sequence by constructing the DFC which is a function of network scale called LOCK. So the algorithm can be fit for the diversity of the network requirement by adjusting the value LOCK. Simulation results show that ADFC-CH can achieve better performance over the exiting channel hopping protocols such as SSB, L-DDP and DSCR.