Short rendezvous channel-hopping algorithm for cognitive radio networks

According to the network topology structure, cognitive networks can be divided into the network with a centralized controller and CRAHNs(CR Ad-Hoc Networks, CRAHNs). Because it is difficult to predict when primary users(PU) appear, secondary users(SU) can not use the fixed common control channel(CCC). This paper presents a short rendezvous channel-hopping algorithm for CRAHNs. By the distributed CCC scheme, secondary users rendezvous on the available channels in common and establish a link in a short time. Compared with previous guaranteed algorithms, our algorithm outperforms the state of the art in terms of TTR(Time To Rendezvous).