Abstract
In this paper, we propose a novel channel-hopping-based distributed rendezvous algorithm based on grid-based-quorum 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 increases 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
