Rendezvous Algorithms For Cognitive Radio Based Wireless Communication Networks

Abstract

newline In recent decades, the demand for spectral resources has grown tremendously newlinewith the increased use of wireless gadgets and Internet-of-Things (IoT) devices. The newlinenext generation of wireless technology, known as cognitive radio network (CRN), has newlineemerged to address the issues of spectrum scarcity, where the unlicensed users or newlinethe secondary users (SUs) opportunistically exploit the idle licensed channels of the newlineprimary users (PUs) for data transmission. However, prior to the transmission both newlinethe transmitter and receiver SUs need to exchange control information over the common newlinecontrol channels (CCC) to establish a link on these available licensed channels, known newlineas rendezvous between the SUs. Though the use of these dedicated CCCs simplifies newlinethe rendezvous process, they suffer saturation and jamming attacks and also face low newlinescalability issues for which blind rendezvous is preferred, where each SU continuously newlinehops on their respective sensed idle licensed channels independently until both the newlineSUs hop on the same channel at the same time. While achieving blind rendezvous newlinethrough the channel hopping (CH) sequence, a properly designed periodic CH scheme newlinecan deliver maximum rendezvous diversity. To have an efficient CH sequence (CHS) for newlineeach SU, some important challenges related to the network environment and availability newlineof channel information are taken into consideration. newlineA Role-Based Channel Hopping (R-CH) is introduced to achieve guaranteed newlinerendezvous in an asynchronous environment. The R-CH scheme has been designed newlinefor specific types of CRN, where the SUs are with preassigned roles as transmitter newlineand receiver. Though the designed scheme shows better performance, it is impractical newlineto assign roles prior to to rendezvous in most of the CRN. Thus, a role-independent, newlinesymmetric CH strategy is suggested that eliminates the need for SUs to pre-assign newlinetransmitter and receiver roles prior to the rendezvous. The suggested disjoint difference newlinesets-based-CH (DDS-CH) scheme outperforms conventional CH algorithm