Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks

Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics