Abstract
The rendezvous process allows cognitive users to find an available channel and establish a communication link. The implementation of rendezvous strategies to minimize the time to rendezvous (TTR) is a major challenge in this context. In this paper we present a comprehensive analysis of the benefits of periodic channel hopping sequences in the rendezvous process. We also introduce a novel short-sequence-based (SSB) rendezvous algorithm which works under symmetric and asymmetric channel models. Theoretical analysis and simulations show that the proposed SSB outperforms other recently developed rendezvous protocols in terms of expected TTR and maximum TTR.
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.
