一类基于相对差集的异步跳频序列系统

在认知无线电网络中,次级用户要实现相互通信,首先要在共有的一个信道上完成异步的无线电盲交汇.该问题可以通过完备的非同步跳频序列系统,设计相应的算法或者协议来解决.利用设计理论中经典的相对差集,对于任意素数幂q,构造出了一类新的完备的非同步跳频序列系统.该系统使用q-1个信道,含有约?(q+1)/2?+2条周期为2(q2-1)的序列.该系统的序列周期长度已经非常接近最优的非同步跳频序列系统,而同时它又含有更多的序列,因此,对设计新的交汇协议来讲更为实用.

A New Family of Asynchronous Channel Hopping Systems Based on Relative Difference Sets

In cognitive radio networks,to communicate with each other,two secondary users have to first establish links through a common channel,which is called a rendezvous.One solution to this challenging problem is to use a rendezvous protocol or algorithm based on a complete asynchronous channel hopping system,which plays a very important role in their design.In this paper,using relative difference sets from the combinatorial design theory,we propose a new CACH system for any prime power q,in which there are totally q-1channels and?(q+1)/2?+2sequences of a common period 2(q2-1).Compared with the optimal CACH system,the sequence period of our new system is already very close to the optimal case,and it has more sequences.Hence,our new CACH system is more practical for designing new rendezvous protocols.