2016/06/15 by Esraa Al Jarrah, Salameh, Haythem Bany, Jarrah, Esraa +1
Computer Science · Engineering · #Cognitive Radio Networks and Spectrum Sensing #Cooperative Communication and Network Coding #Molecular Communication and Nanonetworks
paper · pdf · doi:10.48550/arxiv.1606.04997
One of the most important challenges in deploying cognitive radio networks\n(CRNs) is to find a common control channel (CCC) to all secondary users (SUs)\nthat enables efficient CR communications. This challenge is attributed to the\ndynamic time-varying change of network topology, location and spectrum\navailability conditions. Rendezvous, which is the process of establishing\ncontrol communications, is an essential requirement to enable efficient\ncommunication between any two pair of CR nodes. The most popular CR rendezvous\nprotocols are based on quorum systems (QSs). Quorum systems are systematic\napproaches, which have several attractive properties that can be utilized to\nestablish communication without the need of a CCC and so overcome the\nrendezvous (RDV) problem.\n In this thesis, we propose new channel-hopping-based distributed rendezvous\nalgorithm based on grid-based-quorum techniques. The proposed algorithm\nincreases the probability of RDV within a single cycle by allowing CR nodes to\nmeet more often according to intersection property of quorum systems. Our\nproposed algorithm is called AdaptiveQuorum-Based Channel-Hopping Distributed\nCoordination Scheme for Cognitive Radio Networks. The main idea of our\nalgorithm is to dynamically adjusting the selected QS by CR users according to\nthe varying traffic loads in the CRN. The proposed algorithm decreases the\naverage time to rendezvous (TTR) and increase the probability of RDV. We\nevaluate the performance of our algorithm through Matlab simulations. The\nperformance of proposed algorithm is compared with two different design scheme.\nThe results show that our algorithm can reduce TTR, increase the RDV, and\ndecrease the energy consumption per successful RDV.\n