Asynchronous Channel Hopping Algorithm for Cognitive Radio Networks
Xiaolong Zhang · Xi'an Jiaotong Daxue xuebao · 2012
An asynchronous channel hopping algorithm(ACHA) based on the cyclic quorum is proposed to realize rendezvous in cognitive radio networks(CRNs).Rendezvous means that secondary users(SUs) access the same channel at the same time.SU uses the structure of the cyclic quorum and generates the channel hopping sequences from its available idle channels.Then SUs tune themselves to their available channels following the channel hopping sequences.The ACHA makes use of the rotation closure property of the cyclic quorum system,and ensures the rendezvous between any two SUs to be realized within a basic channel hopping sequence period.Simulation results and comparisons with the generated orthogonal sequence-based algorithm and the triangular numbers-based algorithm show that the proposed algorithm can reduce the average time of rendezvous by 20% and 40%,respectively.