No abstract

No abstract

Cognitive radio networks (CRNs) have emerged as a promising paradigm that can solve the shortage of spectrum resources, providing the ability to adapt and opportunistically exploit the spectrum holes. The rendezvous process allows cognitive users to find a common channel and establish a communication link. In this paper, we focus on the design of fast blind rendezvous algorithms to guarantee that every node should be able to rendezvous in all common available channels. We follow a systematic approach by first proposing a role-based algorithm that ensures maximum rendezvous diversity and then extending it to a common strategy through the use of multiples radios. Both proposals guarantee rendezvous under symmetric and asymmetric models. Simulation results show that our proposals outperform other recently developed rendezvous protocols with similar approaches in terms of expected time to rendezvous and maximum time to rendezvous.

Rendezvous is the process in which two users attempt to meet on a common channel and it is of fundamental importance in cognitive ad hoc radio networks. A cognitive radio blind rendezvous algorithm named simple role-based is proposed that exploits the common channel labelling inherent to wireless networks. The scheme guarantees the simultaneous rendezvous of multiple cognitive users. Analytical expressions are derived for the expected time to rendezvous and maximum time to rendezvous. Numerical results show that the proposed method outperforms the other well-known rendezvous algorithms.

No abstract