Ring-Walk Rendezvous Algorithms for Cognitive Radio Networks
Rendezvous in cognitive radio networks is the process that cognitive users meet and establish a communication link on a commonly available channel, so that consequent information exchange and data communications can be accomplished on the channel. In this paper, the authors propose two Ring-Walk (RW) rendezvous algorithms to solve the problem of blind rendezvous, i.e., rendezvous without the help of any central controller and dedicated common control channel. Their basic idea is to represent each channel as a vertex in a ring. Cognitive users "Walk" on the ring by visiting vertices of channels with different velocities.