Ring-Walk Based Channel-Hopping Algorithms With Guaranteed Rendezvous for Cognitive Radio Networks
Rendezvous is a fundamental and essential operation for users of Cognitive Radio Networks (CRNs) to meet and establish a link on a common channel, so that information exchange and data communication can be carried on. This paper addresses the problem of blind rendezvous, i.e., rendezvous without the help of any central controller and dedicated common control channel. The authors propose two Ring-Walk (RW) based Channel-Hopping (CH) algorithms. The basic idea is to represent each channel as a vertex in a ring. Users "Walk" on the ring by visiting vertices of channels with different velocities.