PROJECT TITLE :

Sender-Jump Receiver-Wait: A Simple Blind Rendezvous Algorithm for Distributed Cognitive Radio Networks - 2018

ABSTRACT:

Cognitive radio (CR) has emerged as a sophisticated and promising technology to exploit the wireless spectrum opportunistically. In cognitive radio networks (CRNs), any pairwise communicating nodes are needed to rendezvous on a commonly out there channel prior to exchange data. In the sooner analysis, the most popular methodology is selecting a common Management Channel (CCC) in CRNs to determine the rendezvous. However, using a CCC has several issues like the control channel saturation, vulnerability to jamming attacks, and inapplicability to dynamic network scenarios. Thus, the blind rendezvous, which requires neither CCC nor the data of the target user's out there channels, has recently attracted a lot of analysis interests. As a contribution to this research space, during this Project we have a tendency to propose a Sender-Jump Receiver-Wait (SJ-RW) blind rendezvous algorithm, that has absolutely glad the subsequent necessities: 1) guaranteeing rendezvous; two) realizing full rendezvous diversity, i.e., any combine of users will rendezvous on all commonly on the market channels; three) requiring no time-synchronization; 4) supporting each symmetric and uneven models; 5) supporting multi-user/multi-hop scenarios and 6) consuming short Time-to-Rendezvous (TTR). Theoretical analysis, computer simulations and experiment with testbed have validated the proposed SJ-RW algorithm.