2 research outputs found
Adaptive Quorum-based Channel-hopping Distributed Coordination Scheme for Cognitive Radio Networks
In this paper, we propose novel channel-hoppingbased distributed rendezvous
algorithm based on grid-basedquorum techniques. The proposed algorithm
increases the probability of rendezvous (RDV) within a single cycle by allowing
CR nodes to meet more often according to intersection property of quorum
systems (QSs). Our proposed algorithm is called Adaptive quorum-based
channel-hopping distributed coordination scheme for cognitive radio networks.
The main idea of our algorithm is to dynamically adjust the selected QS by CR
users according to the varying traffic loads in the CRN. The proposed algorithm
decreases the average time to rendezvous (TTR) and increase the probability of
RDV. We evaluate the performance of our algorithm through simulations. The
performance of our algorithm is compared with two different schemes. The
results show that our algorithm can reduce TTR, increase the RDV, and decrease
the energy consumption per successful RDV
Adaptive Quorum-Based Channel-Hopping Distributed Coordination Scheme for Cognitive Radio Networks
One of the most important challenges in deploying cognitive radio networks
(CRNs) is to find a common control channel (CCC) to all secondary users (SUs)
that enables efficient CR communications. This challenge is attributed to the
dynamic time-varying change of network topology, location and spectrum
availability conditions. Rendezvous, which is the process of establishing
control communications, is an essential requirement to enable efficient
communication between any two pair of CR nodes. The most popular CR rendezvous
protocols are based on quorum systems (QSs). Quorum systems are systematic
approaches, which have several attractive properties that can be utilized to
establish communication without the need of a CCC and so overcome the
rendezvous (RDV) problem.
In this thesis, we propose new channel-hopping-based distributed rendezvous
algorithm based on grid-based-quorum techniques. The proposed algorithm
increases the probability of RDV within a single cycle by allowing CR nodes to
meet more often according to intersection property of quorum systems. Our
proposed algorithm is called Adaptive_Quorum-Based Channel-Hopping Distributed
Coordination Scheme for Cognitive Radio Networks. The main idea of our
algorithm is to dynamically adjusting the selected QS by CR users according to
the varying traffic loads in the CRN. The proposed algorithm decreases the
average time to rendezvous (TTR) and increase the probability of RDV. We
evaluate the performance of our algorithm through Matlab simulations. The
performance of proposed algorithm is compared with two different design scheme.
The results show that our algorithm can reduce TTR, increase the RDV, and
decrease the energy consumption per successful RDV.Comment: 96 pages, 64 figures, Masters thesis, Yarmouk University (2016