J4 ›› 2015, Vol. 42 ›› Issue (4): 63-69.doi: 10.3969/j.issn.1001-2400.2015.04.011

• Original Articles • Previous Articles     Next Articles

Short rendezvous channel-hopping algorithm for  cognitive radio networks

ZHONG Ming;ZHANG Hailin;CHENG Wenchi;GUO Chaoping   

  1. (School of Telecommunication Engineering, Xidian Univ., Xi'an  710071, China)
  • Received:2014-06-10 Online:2015-08-20 Published:2015-10-12
  • Contact: ZHONG Ming E-mail:mingzhong1981@gmail.com

Abstract:

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).

Key words: cognitive radio, cognitive networks, common control channels, rendezvous, time to rendezvous