Asynchronous-Symmetric Channel-Hopping Sequences Over Prime Field for Cognitive Radio Networks

In this letter, two families of asynchronous-symmetric channel-hopping (CH) sequences over prime field are constructed. With straightforward construction algorithms, they provide a flexible balance between adjustable cardinality, full degree-of-rendezvous, and short maximum-time-to-rendezvous (MTTR) for practical cognitive radio networks. These CH sequences have smaller rendezvous-success-rate variance than their counterparts, thus supporting a more stable and uniform rendezvous process. As secondary users cannot transmit in channels occupied by primary (licensed) users, the average MTTR of these CH sequences is analyzed under a random channel-replacement method.