Fast Rendezvous for Multiple Clients for Cognitive Radios Using Coordinated Channel Hopping

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. The authors 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. They denote this class of algorithms as uncoordinated channel hopping algorithms.

Provided by: Purdue University Topic: Mobility Date Added: Jul 2012 Format: PDF

Find By Topic