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 study, we 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. Our 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. Rendezvous is achievable since the user with lower velocity will be eventually “caught” by the user with higher velocity. Compared with the existing solutions, our algorithms provide guaranteed rendezvous without the need of time-synchronization and are applicable to rendezvous of the multi-user and multi-hop scenario. We derive upper bounds on the time-to-rendezvous (TTR) and the expected TTR of our algorithms in both 2-user and multi-user scenarios. Extensive simulations are conducted to evaluate the performance of our algorithms.