Abstract
In this paper, a family of synchronous-asymmetric channel-hopping (CH) sequences for cognitive radio (CR) networks is constructed and their maximum-time-to-rendezvous (MTTR) lower bound is derived. The new sequences achieve full degree-of-rendezvous and optimal MTTR. They also have the unique property of enlarging cardinality without scarifying the MTTR. Their rendezvous-success (RS) rate and MTTR are compared with prior works. This family provides a flexible choice of CH sequences that have adjustable cardinality and RS rate for the CR networks with variable QoS.
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.
