Fast rendezvous for multiple clients for cognitive radios using coordinated channel hopping
Rohan Gandhi, Chih-Chun Wang, Y. Charlie Hu · 2012
A primary challenge in exploiting Cognitive Radio Networks (CRNs), known as the rendezvous problem, is for the users to find each other in the dynamic open spectrum. We study blind rendezvous, where users search for each other without any infrastructural aid. Previous work in this area have focused on efficient blind rendezvous algorithms for two users but the solution for multiple users is still far from optimal. In particular, when two users encounter, one user inherits the other's hopping sequence but the sequence is never shortened or split among the encountering users. We denote this class of algorithms as uncoordinated channel hopping algorithms. In this paper, we introduce a new class of distributed algorithms for multi-user blind rendezvous, called Coordinated Channel Hopping (CCH), where users adjust, or coordinate, the sequence of channels being hopped as they rendezvous pairwise. Compared to existing rendezvous algorithms, our algorithms achieve 80% lower Time To Rendezvous (TTR) in case of multiple users.