Sender-jump receiver-wait: A blind rendezvous algorithm for distributed cognitive radio networks

Abstract

The blind rendezvous, which requires neither Common Control Channel (CCC) nor the information of the target user's available channels, has recently attracted a lot of research interests. As a contribution to this research area, in this paper we propose a Sender-Jump Receiver-Wait blind rendezvous algorithm, which has fully satisfied the following requirements: 1) guaranteeing rendezvous; 2) realizing full rendezvous diversity, i.e., any pair of users can rendezvous on all commonly available channels; 3) requiring no time-synchronization; 4) supporting both symmetric and asymmetric models; 5) supporting multi-user/multi-hop scenarios and 6) consuming short Time-to-Rendezvous (TTR). Theoretical analysis and computer simulations have validated our algorithm.