Method for generating frequency hopping sequences for multi-transceiver cognitive radio networks
View Patent ↗This invention relates to the field of communication technology, and particularly to a communication exchange mechanism design based on frequency hopping, which is applicable to cognitive radio networks. A method for generating hopping frequency sequences for multi-transceiver cognitive radio networks is provided, so as to realize the optimization and tradeoff of the five performance parameters, i.e. DoR, MTTR, ATTR, CL, and NSS. That, is, for a given DoR, the frequency-hopping system should minimize the NSS of the clock synchronous and asynchronous frequency-hopping systems under the condition of MTTR=ATTR=1 and CL<1. The frequency-hopping system of the present invention can use a minimal number of transceivers at each cognitive node to ensure that any two cognitive nodes always achieve frequency hopping rendezvous in each timeslot under the limiting conditions of a certain anti-jamming ability against the primary users and a certain degree of the most serious collisions of control information exchange.
1. A method for generating hopping frequency sequences for multi-transceiver cognitive radio networks, comprising the following steps:
S 1 , setting parameters of a frequency-hopping system; wherein the frequency-hopping system includes n frequency hopping sequence sets; each frequency hopping sequence sets include k frequency hopping sequences; a length of a period of each frequency hopping sequence is M timeslots;
S 2 , labeling the n frequency hopping sequence sets in the frequency-hopping system as 0, 1, 2, 3, . . . , s, . . . , n−1;
labeling k clock synchronous frequency hopping sequences in each frequency hopping sequence set as 0, 1, 2, 3, . . . , r, . . . , k−1;
labeling M timeslots in each period of each frequency hopping sequence as 0, 1, 2, 3, . . . , t, . . . , M−1;
labeling M rendezvous channels in the frequency-hopping system as 0, 1, 2, 3, . . . , M−1;
wherein 0≤s≤n−1, 0≤r≤k−1, 0≤t≤M−1, and s,r,t are all integers;
S 3 , generating a minimum difference set (n,k)-MDS A={a 0 , a 1 , . . . , a k-1 }⊆Z n ;
wherein, (n,k)-MDS=(n,k)-DS when k approaches √{square root over (n)};
where, (n,k)-DS is a k-element subset A={a 0 ,a 1 , . . . , a k-1 } of ¢ n ={0, 1, . . . , n−1} such that, for every non-zero integer d⊆¢ n , there is at least one ordered pair (a i ,a j ) satisfying a i ∈A, a j ∈A, and d=a i −a j modulo n;
wherein, (n,k)-DS satisfies a constraint n≤k 2 −k+1 or an equivalent condition of the constraint k>√{square root over (n)};
S 4 , in a t th timeslot of each M-timeslot period, an r th frequency hopping sequence of an s th frequency hopping sequence set hops to a channel labeled as (b s,r +p(t) modulo M), wherein b s,r =a r +s modulo n, and p is a one-to-one mapping defined over Z n ={0, 1, . . . , n−1}, a r is one element of the (n,k)-MDS generated by S 3 , and 0≤r≤k−1.
2. The method for generating frequency hopping sequences for multi-transceiver cognitive radio networks of claim 1 , wherein the minimum deference set generated in the S 3 specifically is
for a synchronous frequency-hopping system
S 31 , providing k≤2, defining an integer set Φ k , such that there is at least one (φ, k)-MDS for each φ∈Φ k ; and providing c k =k/φ k,max , wherein φ k,max is the maximum value in the set Φ k ;
S 32 , providing c 1 =1; when an upper bound of a channel loading required by the synchronous frequency-hopping system is preset as l max ∈[0,1], if there is an integer k≥2 such that l max ∈[c k , c k-1 ), then the number of frequency hopping sequences in each frequency hopping sequence set of the synchronous frequency-hopping system will be set as NSS=k; providing n=φ k,max as the maximum value in the set Φ k ; and generating a minimum difference set (n, k)-MDS A={a 0 , a 1 , . . . , a k-1 }⊆Z n ;
for an asynchronous frequency-hopping system
given that the number of rendezvous channels required by the asynchronous frequency-hopping system is preset as DoR=n, calculating the least number of elements k forming the minimum difference set (n,k)-MDS A={a 0 , a 1 , . . . , a k-1 }⊆Z n ; and providing NSS=k as the number of frequency hopping sequences in each frequency hopping sequence set of the asynchronous frequency-hopping system.