Rendezvous is a cornerstone process in constructing Cognitive Radio Networks (CRNs), though which two unlicensed Secondary Users (SUs) find a common available channel for communication. Channel Hopping (CH) is a representative technique for solving the rendezvous problem. Recently, multiple radios are used when designing CH algorithm, by which the rendezvous performance can be significantly improved. However, most of the existing CH algorithms based on the multiple radios cannot be applied for the heterogeneous CRNs, while different radios of one SU may access the same channel at the same time. We have proposed a new CH algorithm, named Hybrid Radios Rendezvous (HRR) algorithm, for solving the disadvantages of the existing CH algorithms above. In this report, we emphatically analyze the structure of the CH sequences generated by the HRR algorithm, and the principle of guaranteeing rendezvous. Besides, we also analyze the principle of the proposed Available Channel Distribution (ACD) algorithm, by which different radios of one SU can be guaranteed to access different channels at the same time. Moreover, extensive simulation results show the superiority of the HRR algorithm compared with the state-of-the-art CH algorithms with multiple radios in terms of Maximum Time-To-Rendezvous (MTTR) and Expected Time-To-Rendezvous (ETTR).
展开▼
