An Asymptotically Optimal Channel Hopping Sequence with Maximum Rendezvous Diversity

08/01/2019
by   Cheng-Shang Chang, et al.
0

In the literature, there are several well-known periodic channel hopping (CH) sequences that can achieve maximum rendezvous diversity in a cognitive radio network (CRN). For a CRN with N channels, it is known that the period of such a CH sequence is at least N^2. The asymptotic approximation ratio, defined as the ratio of the period of a CH sequence to the lower bound N^2 when N →∞, is still 2.5 for the best known CH in the literature. An open question in the multichannel rendezvous problem is whether it is possible to construct a periodic CH sequence that has the asymptotic approximation ratio 1. In this letter, we solve such a question by proposing CH sequences that have the asymptotic approximation ratio 1.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro