A Fast Rendezvous-Guarantee Channel Hopping Protocol for Cognitive Radio Networks

作者：Chao Chih Min^*; Fu Hsiang Yuan; Zhang Li Ren

来源：IEEE Transactions on Vehicular Technology, 2015, 64(12): 5804-5816.

DOI：10.1109/TVT.2014.2387377

• Channel hopping
• cognitive radio networks (CRNs)
• dynamic spectrum access
• latin squares
• quorum systems
• rendezvous guarantee

In a cognitive radio network (CRN), two nodes have a rendezvous when they tune to the same channel simultaneously. Providing rendezvous guarantee between any pair of nodes is essential because a rendezvous is necessary for communication. Some existing works claim that rendezvous guarantee can be provided by using a dedicated common control channel to negotiate the channel being used. A serious problem of these mechanisms is that a globally available channel may not exist. Some channel hopping protocols try to provide a rendezvous guarantee without using a common control channel. However, these solutions may suffer from a poor number of rendezvous or uneven channel utilization. In this paper, we propose a novel distributed channel hopping protocol: Quorum and Latin square channel hopping (QLCH). The QLCH scheme efficiently provides rendezvous guarantee by utilizing the concept of quorum systems and Latin squares. The former is utilized to guarantee balanced rendezvous among nodes, whereas the latter is adopted to share the rendezvous among channels. QLCH efficiently provides fast rendezvous guarantee and can cooperate with other channel hopping protocols to enhance network throughput. Analytical and simulation results verify the improvement of QLCH. For example, when there are 30 flows using 11 channels in a CRN, the achieved time to rendezvous of QLCH is 9.84 times lower than that of the existing protocol SYNC-ETCH, whereas the achieved network throughput of QLCH is 362% higher than that of the existing protocol, i.e., Quorum-based channel hopping (L-QCH).

• 出版日期2015-12