MTTR Lower Bound and Construction of Synchronous-Asymmetric Channel-Hopping Sequences for Cognitive Radio Networks

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.