CN109412646A - A kind of low generation method for intercepting and capturing asynchronous frequency hop sequences - Google Patents
A kind of low generation method for intercepting and capturing asynchronous frequency hop sequences Download PDFInfo
- Publication number
- CN109412646A CN109412646A CN201811540696.1A CN201811540696A CN109412646A CN 109412646 A CN109412646 A CN 109412646A CN 201811540696 A CN201811540696 A CN 201811540696A CN 109412646 A CN109412646 A CN 109412646A
- Authority
- CN
- China
- Prior art keywords
- hop sequences
- frequency hop
- network node
- superframe
- frequency
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/715—Interference-related aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/7143—Arrangements for generation of hop patterns
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/715—Interference-related aspects
- H04B2001/7152—Interference-related aspects with means for suppressing interference
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to communication technique fields, are related to a kind of low generation method for intercepting and capturing asynchronous frequency hop sequences.It is an object of the invention to design a kind of blind convergence frequency hopping sequence generating method for having anti-intercepting and capturing analysis ability for the possible asynchronous wireless network node of clock.Under restrictive condition that may be different with different network node frequency hopping initial time in the wireless environment of malicious interference, it both can ensure that adjacent network node can realize blind convergence and interactive control information in limited time interval based on this method any frequency hop sequences generated, a possibility that disturber accurately analyzes and intercept and capture each network node frequency hop sequences can be reduced as far as possible again, achieve the purpose that low intercepting and capturing and analysis resistant.The final purpose of this design is to provide optimization compromise, the wireless network control information exchange that realization is converged based on Frequency-Hopping Blind while ensuring that disturber accurately can not analyze and intercept and capture each node frequency hop sequences for performance parameters such as DoR, MTTR, ATTR, MCTTR and Hit Ratio of blind convergence frequency hop sequences.
Description
Technical field
The invention belongs to communication technique fields, are related to a kind of low generation method for intercepting and capturing asynchronous frequency hop sequences.
Background technique
In the wireless communications environment there are malicious interference, wireless network needs the efficient, peace between adjacent network node
All types of control information, such as frequency spectrum perception result, network topology, clock information and communication handshake association are interacted entirely and reliably
Quotient etc. is communicated to be flexibly utilized by its not disturbed frequency range (or channel) that can access in frequency spectrum.For this purpose, adjacent networks
Node can be by being constantly changing communication channel locating for its antenna, when synchronization jumps on same not disturbed channel
Realize convergence and control information exchange.In this course, if each network node has independently produced all in accordance with same rule
Its frequency hop sequences, then any two adjacent network node can be before not needing that the specific frequency hop sequences of other side are known in advance
It puts and realizes blind convergence, added communications expense needed for frequency hopping convergence is effectively reduced.And different transmitting-receiving nodes are to can also be same
Frequency-Hopping Blind convergence is realized in one time slot on different channels, to effectively avoid believing based on single fixed control channel interactive controlling
Control channel flow saturation problem caused by breath.
However, in complicated malicious interference attack, disturber can by continuously monitor each network node its can
The frequency hopping situation on channel is accessed, analyzes each network node effectively to realize the blind selected frequency hop sequences of convergence.Therefore,
In order to safely and efficiently realize control information exchange in the wireless network that there is complicated malicious interference attack, towards blind convergence
Frequency hop sequences need to have certain anti-intercepting and capturing analysis ability, are ensuring adjacent network node one in the time interval of finite length
Surely realize reduces disturber as far as possible under the precondition of blind convergence accurately analyzes and intercepts and captures each network node frequency hop sequences
A possibility that.In addition, the wireless network for distributed AC servo system realizes the synchronous difficulty of all nodal clocks of the whole network, have anti-cut
The blind convergence frequency hop sequences for obtaining analysis ability need support the difference that adjacent network node is likely to occur on frequency hopping initial time,
To realize the asynchronous Frequency-Hopping Blind convergence of so-called clock.
In general, the parameter for measuring a blind convergence frequency hopping sequence generating method performance superiority and inferiority includes:
Convergence degree (Degree of Rendezvous, abbreviation DoR) is based on this method any two frequency hopping generated
The channel total number of convergence may be implemented in sequence.When DoR value is bigger, then the control information exchange based on Frequency-Hopping Blind convergence can benefit
With more communication channels, to have the ability of stronger communication reliability and anti-malicious interference.
Average convergence interval (Average time-to-rendezvous, abbreviation ATTR), i.e., converge channel when all
When not disturbed, realized and converged on not disturbed channel twice in succession based on this method any two frequency hop sequences generated
Poly- average time interval.When ATTR value is smaller, then the control information exchange based on Frequency-Hopping Blind convergence has under noiseless environment
Standby shorter average interaction time delay and more preferably long-term interactive performance.
Maximum binding time interval (Maximum time-to-rendezvous, abbreviation MTTR), i.e., converge when all
When channel is not disturbed, the maximum time converged twice in succession is realized based on this method any two frequency hop sequences generated
Interval.When MTTR value is smaller, then the control information exchange based on Frequency-Hopping Blind convergence has shorter maximum under noiseless environment
Interaction time delay and more preferably short-term interactive performance.
Maximal condition binding time interval (Maximum conditional time-to-rendezvous, referred to as
MCTTR), i.e., this method any two generated are based in the case where only only one can converge channel and not be disturbed
Frequency hop sequences realize the maximum time interval of convergence on not disturbed channel twice in succession.When MCTTR value is smaller, then based on jump
Frequently the control information exchange of blind convergence has shorter maximum interaction time delay and more preferably short-term interaction under malicious interference environment
Performance.
On the other hand, in the environment of there are malicious interference, a blind convergence frequency hopping sequence generating method anti-intercepting and capturing is measured
The parameter for analyzing performance superiority and inferiority is mainly hit probability (Hit Ratio), i.e., disturber is in the time interval that length is MCTTR
When can account for this section to the average number of timeslots accurately interfered based on this method each frequency hop sequences institute hop channel generated
Between be spaced the ratio of total timeslot number.It represents blind convergence frequency hop sequences energy under worst malicious interference attack condition
The probability that disturbed side successfully interferes.It is obvious that the value range of hit probability is [0,1].
Summary of the invention
It is an object of the invention to design one kind for the possible asynchronous wireless network node of clock to have anti-intercepting and capturing analysis energy
The blind convergence frequency hopping sequence generating method of power.In the wireless environment of malicious interference and different network node frequency hopping initial time can
Under restrictive condition that can be different, it both can ensure that adjacent network node can have based on this method any frequency hop sequences generated
Blind convergence and interactive control information are realized in the time interval of limit, and can be reduced disturber as far as possible and accurately be analyzed and intercept and capture each net
A possibility that network node frequency hop sequences, achievees the purpose that low intercepting and capturing and analysis resistant.The final purpose of this design is for blind remittance
The performance parameters such as DoR, MTTR, ATTR, MCTTR and Hit Ratio of poly- frequency hop sequences provide optimization compromise, are ensuring to interfere
The wireless network control letter converged based on Frequency-Hopping Blind is realized while Fang Wufa accurately analyzes and intercept and capture each node frequency hop sequences
Breath interaction.
For convenience of technical solution of the present invention is understood, the technology of the present invention principle is introduced first:
For convenience of description, Z is enablednRepresent the set being made of all nonnegative integer mould n, i.e., { 0,1 ..., n-1 }, and will
Multi-channel wireless network it is N number of converge channel number be 0,1 ..., N-1.
If defining 1. set ZnA k subset of elements A={ a0,a1,…,ak-1Meet following condition, i.e., for every
A nonzero integer d ∈ ZnThere is at least one element to (ai,aj) meet ai∈ A, aj∈ A and d=ai-ajMod n, then
Set A is thus referred to as (n, k)-difference set (difference set) or (n, k)-DS.
For any n >=2, what (n, k)-DS was constantly present.Two inferences as follows can be obtained according to defining 1:
Inference 1. is to (n, k)-difference setExecute the rotation that distance is r ∈ [0, n-1]
Turn k element set generatedIt is also
One (n, k)-difference set.
Inference 2. always has (n, k)-difference set AAt
It is vertical.
For example, due to 1 ≡ 1-0mod, 6,2 ≡ 3-1mod, 6,3 ≡ 3-0mod, 6,4 ≡ of ≡ 1-3mod 6 and 5 0-1mod
6, therefore gatherIt is (6,3)-DS.And 5 non-zero distances of the set rotate set, i.e. ROT
(A, 1)={ 1,2,4 }, (A, 2)={ 2,3,5 } ROT, (A, 3)={ 3,4,0 } ROT, (A, 4)={ 4,5,1 } ROT and ROT (A,
5)={ 5,0,2 } are also all (6,3)-DS.In addition, for any ri∈ [0,5] and rjFor ∈ [0,5], ROT (A, ri) and
ROT(A,rj) intersection be all non-empty.
The parameter n of the parameter k given for one, all (n, k)-DS need to meet n≤k2-k+1.Based on the fact that and
K >=2 are it is found that all (n, k)-DS are all needed to meetParticularly, when parameter k is approached as much as possibleWhen, one (n,
K)-DS is just further referred as (n, k)-minimum difference set (minimal DS) or (n, k)-MDS.For example,Just
Constitute (6,3)-MDS.
It can be carried out extended below for above-mentioned difference set concept:
If defining 3. 1 Nk element sets, wherein Nk≤n, can be divided into N number of mutually disjoint k member sub-prime
Collection, and each subset constitutes (n, k)-DS, then this set is thus referred to as a N-dimensional (n, k)-difference set combination
(union of DSs) or (N, n, k)-UDS.Particularly, as N number of (n, k)-marked off from (N, n, k)-UDS
When DS is minimum difference set, it can be further known as one (N, n, k)-minimum difference set combination (union of MDSs) or
(N,n,k)-UMDS.It is more particularly, when N approaches its upper limit value as much as possibleWhen, (N, n, k)-UMDS can quilt
A referred to as maximum (N, n, k)-minimum difference set combination (maximal UMDS) or (N, n, k)-MUMDS.
For example, due to set2 disjoint 3 element sets can be divided into WithAnd the two subclass are (6,3)-MDS, thus set U be both one (2,6,
3)-UMDS is also (2,6,3)-MUMDS.
If 3. 1 Nk element sets of inferenceIt is (N, n, k)-UDS or (N, n, k)-UMDS, then should
Any rotation set of set, i.e.,It also is (N, n, k)-UDS or (N, n, k)-respectively
UMDS。
Based on the mathematical concept that relaxed cyclic difference set and difference set combine, the present invention devises low section of following a kind of DoR=N
Obtain the generating algorithm of blind convergence frequency hop sequences.
Step 1: N number of (n, k)-minimum difference set of mutually disjointing, i.e. U can be divided by generating one0,U1,…,UN-1,
(N, n, k)-minimum difference set combines U, i.e. U=U0∪U∪…∪UN-1With
Step 2: each network node frequency hop sequences generated can be divided into multiple time spans in the time domain and fix
Superframe, each superframe can be the frame of n time slot comprising 2 length, and it be 0 that n time slot of every frame can be numbered respectively,
1,…,n-1.Meanwhile N number of channel that converges of wireless network is numbered, number is denoted as: 0,1 ..., i ..., N-1.
Step 3: before each superframe starts, each network node needs to randomly choose a rotary distance for the superframe
r∈[0,n-1]。
Step 4: for any time slot t ∈ [0, n-1] of each superframe first frame, if t ∈ ROT (Ui, r),
Middle i ∈ [0, N-1], then network node needs start for its transceiver to be switched on channel i in time slot t in step 3；It is no
Then, ifThe transceiver of network node needs to start to jump to one at random in time slot t so in step 3
The channel of selectionOn.
Step 5: in each the second frame of superframe, the transceiver of network node needs to repeat it in first frame in step 3
Interior frequency hop sequences.
The beneficial effects of the present invention are:
By step 4 of the present invention and 5 it is found that arbitrary network node is performed both by together in the first and second frames of each superframe
One is based on ROT (U, r) n time slot hopping sequence generated.It means that from any time slot t of each superframe first frame
In the continuous n time slot that ∈ [0, n-1] starts, i.e. the time slot t, t+1 ..., n-1 of first frame and the time slot 0,1 ... of the second frame,
T-1, the node can be executed based on ROT (U, r-t modulo n) n time slot hopping sequence generated.It is poor to benefit from relaxation cycles
The rotating closed characteristic (i.e. inference 1, inference 2 and inference 3) of collection and minimum difference set combination, when a network node jump generated
Frequency sequence e frequency hop sequences f generated prior to another network node be when just d time slot starts frequency hopping, wherein d be it is any just
Real number, if (d modulo 2n) ∈ [0, n-1], then the two frequency hop sequences centainly can be from frequency hop sequences eThe time slot of a superframe first frameIt in number is 0,1 in n time slot of beginning ..., N-1's is all N number of
Blind convergence is realized on channel, and blind convergence number on each channel is at least 1；Otherwise, if (d modulo 2n) ∈
[n, 2n-1], then they centainly can be in frequency hop sequences eAt the time slot 0 of a superframe first frame start n
In number it is 0,1 in gap ..., realizes blind convergence on all N number of channels of N-1, and blind convergence number on each channel
At least 1.Therefore, the two frequency hop sequences have DoR=N.
Since frequency hop sequences e and f are bound in each superframe of frequency hop sequences e realize convergence on all N number of channels,
Therefore they realize that the average time interval of frequency hopping convergence twice in succession should be not more than 2n/N.Therefore, the two frequency hop sequences
Has ATTR≤2n/N.
If frequency hop sequences e and f in frequency hop sequences eThe convergence that n times are no less than in a superframe is to occur
The time slot 0,1 of second frame of superframe ..., N-1 and they the of frequency hop sequences eN times are no less than in a superframe
Convergence is occurred in the time slot n-N, n-N+1 ..., n-1 of the superframe first frame, then occurring theA superframe
Time slot N-1 andIt is that the maximum of 2n-2N+1 converges that convergence, which will generate value, twice in succession in the time slot n-N of a superframe
Poly- time interval.Therefore, the two frequency hop sequences have MTTR≤2n-2N+1.
In addition, frequency hop sequences e and f can also at least jumped when only having 1 not to be disturbed in all N number of convergence channels
Frequency sequence eThe time slot 0 of a the second frame of superframe andIn the time slot n-1 of a superframe first frame this only
Time slot converges on one channel, therefore the MCTTR upper limit value of the two frequency hop sequences should be 2n-1, i.e. MCTTR≤2n-1.
Further, since any two frequency hop sequences e and f are provided with MTTR≤2n-2N+1, so if being respectively adopted
Sending and receiving after node realizes frequency hopping convergence for the first time in each 2n time slot superframe for the two frequency hop sequences just immediately jumps to
Converge channel 0,1 ..., carry out data transmission on a certain data channel except N-1, then disturber can not by while listening for
At most complete frequency hop sequences of the sending node in each superframe are accurately intercepted and captured and analyzed to N-2 convergence channel.
Finally, just having in all n 2n time slot hopping sequences that each network node can be generated based on the present invention
Convergence is realized in k meeting on the same channel in the same time slot of the 2n time slot superframe, and all n frequency hop sequences can be same
In time slotConvergence is realized on a different channel.Therefore, no matter disturber is using any in following three kinds of modes
One kind being discharged a certain network node and interfered:
Fixed interference, i.e., disturber randomly chooses β ∈ [1, N-1] a channel from all N number of convergence channels, and one
It is fixed within the section time on these convergence channels and discharges interference.
Random disturbances, i.e. disturber can randomly choose β ∈ [1, N- in each time slot from all N number of convergence channels
1] a channel is interfered, and the disturbed convergence channel set in different time-gap may be different.
Adaptive disturbance, i.e. disturber can be according to its monitorings in previous superframe to some network node channel hopping
As a result adaptively select β ∈ [1, N-1] a channel to apply from all N number of convergence channels in each time slot of next superframe
It is allowed to dry and disturbs.
The hit probability (hit ratio) that disturber obtains is not more than β/N.
Detailed description of the invention
Fig. 1 is in the case where wireless network convergence channel number is N=3, and each network node is based on the present invention and gives birth to
At all 15 kinds of possible frequency hop sequences in each 30 time slot superframe.
Fig. 2 is when the frequency hopping initial time of frequency hop sequences 3 and 7 shown in FIG. 1 is identical, they are in a superframe in channel
Convergence situation on 0,1 and 2.
Fig. 3 be when frequency hop sequences 3 shown in FIG. 1 prior to frequency hop sequences 7 just 5 time slots start frequency hopping when, they are one
Convergence situation in a superframe on channel 0,1 and 2.
Fig. 4 is under conditions of same convergence number of channel N=6, when disturber interferes J ∈ with random or fixed form
When [1,5] a convergence channel, the interference hit probability of the present invention and existing the generated frequency hop sequences of Sec-CH and Tri-CH algorithm
(hit ratio) comparison.
Fig. 5 is under conditions of same convergence number of channel N=6, when disturber interferes J ∈ with random or fixed form
When [1,5] a convergence channel, the average binding time of the present invention and existing the generated frequency hop sequences of Sec-CH and Tri-CH algorithm
Interval correlation.
Fig. 6 is under conditions of same convergence number of channel N=6, when disturber interferes J ∈ with random or fixed form
When [1,5] a convergence channel, the maximum binding time of the present invention and existing the generated frequency hop sequences of Sec-CH and Tri-CH algorithm
Interval correlation；
Specific embodiment
Below in conjunction with drawings and examples, technical solution of the present invention is further described.
Embodiment
This example is the blind convergence frequency hop sequences of low intercepting and capturing for generating a DoR=2 as follows:
Step 1: 3 (15,5)-minimum difference sets of mutually disjointing can be divided by generating one,
I.e. With(3,
15,5)-minimum difference set combination.
Step 2: each network node frequency hop sequences generated can be divided into multiple time spans in the time domain and fix
For the superframe of 30 time slots, each superframe can be the frame of 15 time slots comprising 2 length, and 15 time slots of every frame can be divided
It Bian Hao not be 0,1 ..., 14.Meanwhile channel can be converged to 3 of wireless network and be numbered, number is denoted as 0,1,2.
Step 3: before each superframe starts, each network node needs to randomly choose a rotary distance for the superframe
r∈[0,14]。
Step 4: for the time slot t=r of each superframe first frame, (r+1modulo 15), (r+2modulo 15), (r+
6modulo15), for (r+9modulo 15), due to t ∈ ROT (U0, r), therefore network node is needed in time slot t in step 3
Start its transceiver is switched on channel 0；For the time slot t=(r+3modulo 15) of each superframe first frame, (r+
4modulo 15), (r+5modulo 15), (r+8modulo 15), for (r+11modulo 15), due to t ∈ ROT (U1,
R), therefore in step 3 network node needs start for its transceiver to be switched on channel 1 in time slot t；For each superframe
The time slot t=(r+7modulo 15) of first frame, (r+10modulo 15), (r+12modulo 15), (r+13modulo
15), for (r+14modulo 15), due to t ∈ ROT (U2, r), therefore network node needs the beginning in time slot t in step 3
Its transceiver is switched on channel 2.
Step 5: in each the second frame of superframe, the transceiver of network node needs to repeat it in first frame in step 3
Interior frequency hop sequences.
Fig. 1 depicts each network node and is based on above-mentioned steps 15 kinds of possible jumps all in each superframe generated
Frequency sequence, number are respectively 0,1 ..., and 14, they are to select rotary distance r=0 in step 3 respectively, and 1 ..., 14 are generated
's.Due to the rotary distance r of step 3 be before each superframe starts it is randomly selected, consolidated network node is in difference
Frequency hop sequences generated are possible different in superframe.
Fig. 2 is then depicted, and when the frequency hopping initial time of frequency hop sequences 3 and 7 shown in FIG. 1 is identical, they are in a superframe
It is interior to be converged respectively twice on channel 0,1 and 2.At this point, the convergence degree of the two frequency hop sequences is DoR=3, it is average to converge
Time interval is ATTR=30/6=5 time slot, is divided into MTTR=7 time slot between maximum binding time, and their maximum item
It is divided between part binding time, when channel 0 and 1 is by malicious interference, the convergence on channel 2 twice in succession of the two frequency hop sequences
Time interval is MCTTR=15 time slot.On the other hand, if disturber it is fixed in MCTTR time interval, it is random or from
Adaptively any 1 in interference channel 0~2, i.e. β=1, then it can successfully interfere any one frequency hop sequences institute hop channel
Timeslot number be 5, i.e. Hit Ratio be 5/15=1/3.
Fig. 3 is then depicted, when frequency hop sequences 3 shown in FIG. 1 prior to frequency hop sequences 7 just 5 time slots start frequency hopping when, this
Two frequency hop sequences can converge 3,2 and 2 times respectively in a superframe on channel 0,1 and 2.At this point, the two frequency hop sequences
Convergence degree be DoR=3, be divided into ATTR=30/7 time slot between average binding time, be divided into MTTR=6 between maximum binding time
A time slot, and be divided between their maximal condition binding time, when channel 0 and 2 is by malicious interference, the two frequency hop sequences connect
MCTTR=15 time slot is divided between continuous binding time twice on channel 1.On the other hand, if disturber is in the MCTTR time
Fixed in interval, random or adaptively any 2 in interference channel 0~2, i.e. β=2, appoint then it can smoothly be interfered
The timeslot number of what frequency hop sequences institute hop channel is 10, i.e. Hit Ratio is 10/15=2/3.
It is obvious that above-mentioned performance parameter is no more than their theoretically dividing values in N=3, n=15 and k=5, i.e. DoR
=N=3, MTTR≤2n-2N+1=25, ATTR≤2n/N=10, MCTTR≤2n-1=29 and Hit ratio≤β/N=1/3
(i.e. the example of Fig. 2) or 2/3 (i.e. the example of Fig. 3).
Fig. 4 is under conditions of same convergence number of channel N=6, when disturber interferes J ∈ with random or fixed form
When [0,5] a convergence channel, the present invention and existing Sec-CH " J.-F.Huang, G.-Y.Chang, and J.-X.Huang,
“Anti-Jamming Rendezvous Scheme for Cognitive Radio Networks,”IEEE
Trans.Mobile Comp., vol.16, no.3, pp.648-661,2017 " and Tri-CH " G.-Y.Chang, S.-Y.Wang,
and Y.-X.Li,“A Jamming-Resistant Channel Hopping Scheme for Cognitive Radio
Networks, " IEEE Trans.Wireless Comm., vol.16, no.10, pp.6712-6725,2017 " algorithm generated
The interference hit probability (hit ratio) of frequency hop sequences compares.Thus scheme the interference hit probability it is found that frequency hop sequences of the present invention
Interference hit probability slightly below based on Sec-CH and Tri-CH algorithm frequency hop sequences generated.
Fig. 5 is under conditions of same convergence number of channel N=6, when disturber interferes J ∈ with random or fixed form
When [0,5] a convergence channel, the average binding time of the present invention and existing the generated frequency hop sequences of Sec-CH and Tri-CH algorithm
Interval correlation.Particularly, as J=0, maximum binding time interval shown in fig. 6 is ATTR parameter.Thus figure is it is found that originally
The average binding time interval of invention frequency hop sequences is slightly below based on Sec-CH and Tri-CH algorithm frequency hopping sequence generated
The average binding time interval of column.That is, frequency hop sequences of the present invention are able to achieve shorter be averaged under the conditions of same disturbance
Binding time interval and more preferably frequency hopping converge performance.
Fig. 6 is under conditions of same convergence number of channel N=6, when disturber interferes J ∈ with random or fixed form
When [0,5] a convergence channel, the maximum binding time of the present invention and existing the generated frequency hop sequences of Sec-CH and Tri-CH algorithm
Interval correlation.Particularly, as J=0 and 5, maximum binding time interval shown in fig. 6 is respectively MTTR and MCTTR parameter.
Thus figure is it is found that the maximum binding time interval of frequency hop sequences of the present invention is significantly lower than and is based on Sec-CH and Tri-CH algorithm
The maximum binding time interval of frequency hop sequences generated.That is, under the conditions of same disturbance, frequency hop sequences energy of the present invention
Realize shorter maximum binding time interval and more preferably frequency hopping convergence performance.
Claims (1)
1. a kind of low generation method for intercepting and capturing asynchronous frequency hop sequences, sets convergence degree DoR=N, which is characterized in that the frequency hopping sequence
The generation methods of column the following steps are included:
Step 1: N number of (n, k)-minimum difference set of mutually disjointing, i.e. U can be divided by generating one0,U1,…,UN-1, (N, n,
K)-minimum difference set combines U, i.e. U=U0∪U∪…∪UN-1With
Step 2: each network node frequency hop sequences generated are divided into the fixed superframe of multiple time spans in the time domain,
Each superframe can be the frame of n time slot comprising 2 length, and it is 0,1 that n time slot of every frame is numbered respectively ..., n-1；Together
When, N number of channel that converges of wireless network is numbered, number is denoted as: 0,1 ..., i ..., N-1；
Step 3: before each superframe starts, each network node is that the superframe randomly chooses a rotary distance r ∈ [0, n-
1]；
Step 4: for any time slot t ∈ [0, n-1] of each superframe first frame, if t ∈ ROT (Ui, r), wherein i ∈ [0, N-
1], then network node needs start for its transceiver to be switched on channel i in time slot t；Otherwise, ifSo the transceiver of network node needs to start to jump to a randomly selected channel in time slot tOn；
Step 5: in each the second frame of superframe, the transceiver of network node repeats its frequency hop sequences in first frame.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811540696.1A CN109412646A (en) | 2018-12-17 | 2018-12-17 | A kind of low generation method for intercepting and capturing asynchronous frequency hop sequences |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811540696.1A CN109412646A (en) | 2018-12-17 | 2018-12-17 | A kind of low generation method for intercepting and capturing asynchronous frequency hop sequences |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109412646A true CN109412646A (en) | 2019-03-01 |
Family
ID=65460264
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811540696.1A Pending CN109412646A (en) | 2018-12-17 | 2018-12-17 | A kind of low generation method for intercepting and capturing asynchronous frequency hop sequences |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109412646A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110474659A (en) * | 2019-09-25 | 2019-11-19 | 电子科技大学 | A kind of asynchronous FH Sequence Design method of antenna isomery cognition wireless network |
| CN110932754A (en) * | 2019-11-20 | 2020-03-27 | 电子科技大学 | Frequency hopping sequence generation method suitable for clock asynchronous multi-antenna cognitive wireless network |
| CN116015351A (en) * | 2022-11-08 | 2023-04-25 | 西安电子科技大学 | Anti-interference multiple access method in self-organizing network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130329821A1 (en) * | 2012-06-08 | 2013-12-12 | Apple Inc. | Methods and apparatus for mitigating interference in aggressive form factor designs |
| CN105451352A (en) * | 2015-11-30 | 2016-03-30 | 电子科技大学 | Cognitive radio network frequency hopping communication method supporting node priorities |
| CN105763224A (en) * | 2016-04-14 | 2016-07-13 | 电子科技大学 | Distributed asynchronous frequency hopping system frequency hopping sequence generation method |
| CN107395251A (en) * | 2017-07-17 | 2017-11-24 | 电子科技大学 | Suitable for the frequency hopping sequence generating method of more transceiver cognition wireless networks |
-
2018
- 2018-12-17 CN CN201811540696.1A patent/CN109412646A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130329821A1 (en) * | 2012-06-08 | 2013-12-12 | Apple Inc. | Methods and apparatus for mitigating interference in aggressive form factor designs |
| CN105451352A (en) * | 2015-11-30 | 2016-03-30 | 电子科技大学 | Cognitive radio network frequency hopping communication method supporting node priorities |
| CN105763224A (en) * | 2016-04-14 | 2016-07-13 | 电子科技大学 | Distributed asynchronous frequency hopping system frequency hopping sequence generation method |
| CN107395251A (en) * | 2017-07-17 | 2017-11-24 | 电子科技大学 | Suitable for the frequency hopping sequence generating method of more transceiver cognition wireless networks |
Non-Patent Citations (1)
| Title |
|---|
| 陈杰: ""基于循环差集的认知无线网络控制信息交互机制设计"", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110474659A (en) * | 2019-09-25 | 2019-11-19 | 电子科技大学 | A kind of asynchronous FH Sequence Design method of antenna isomery cognition wireless network |
| CN110474659B (en) * | 2019-09-25 | 2020-12-29 | 电子科技大学 | Asynchronous frequency hopping sequence design method of antenna heterogeneous cognitive wireless network |
| CN110932754A (en) * | 2019-11-20 | 2020-03-27 | 电子科技大学 | Frequency hopping sequence generation method suitable for clock asynchronous multi-antenna cognitive wireless network |
| CN116015351A (en) * | 2022-11-08 | 2023-04-25 | 西安电子科技大学 | Anti-interference multiple access method in self-organizing network |
| CN116015351B (en) * | 2022-11-08 | 2024-04-02 | 西安电子科技大学 | Anti-interference multiple access method in self-organizing network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chowdhury et al. | OFDM-based common control channel design for cognitive radio ad hoc networks | |
| CN109412646A (en) | A kind of low generation method for intercepting and capturing asynchronous frequency hop sequences | |
| CN102017432B (en) | Communication system, transmitter, receiver, and communication method | |
| CN107395251B (en) | Frequency hopping sequence generating method suitable for more transceiver cognition wireless networks | |
| CN109906582A (en) | Promote uplink communication waveform selection | |
| Moscibroda et al. | How optimal are wireless scheduling protocols? | |
| CN101917768B (en) | User fairness resource allocation method for orthogonal frequency division multiple access relay system | |
| Gu et al. | On heterogeneous sensing capability for distributed rendezvous in cognitive radio networks | |
| CN109923917A (en) | The method and apparatus for being used to indicate digital basic configuration | |
| Gaspar et al. | GFDM-A Framework for Virtual PHY Services in 5G Networks | |
| Zhang et al. | Cooperative anti-jamming for infrastructure-less wireless networks with stochastic relaying | |
| Ren et al. | Opportunistic spectrum access: from stochastic channels to non-stochastic channels | |
| Christopher Clement et al. | Improving sensing and throughput of the cognitive radio network | |
| Steendam | Analysis of the redundant energy in UW-OFDM | |
| Zhang et al. | Optimal non-identical sensing setting for multi-channel cooperative sensing | |
| Solomentsev et al. | Research of energy characteristics of QAM modulation techniques for modern broadband radio systems | |
| Li et al. | A new communication framework for wide-band cognitive radio networks | |
| Zeng et al. | Performance of a novel MFSK/FHMA system employing no-hit zone sequence set over Rayleigh fading channel | |
| Sezer et al. | Average capacity maximization via channel switching in the presence of additive white Gaussian noise channels and switching delays | |
| Al-Dweik et al. | Multirate NOMA for improving connectivity in 6G communications networks | |
| Ali et al. | A novel spectrum monitoring algorithm for OFDM-based cognitive radio networks | |
| Baldo et al. | An evaluation of cognitive channel allocation strategies for coalition deployments | |
| Tan et al. | A novel asynchronous channel hopping scheme for blind rendezvous in cognitive radio networks | |
| Sun et al. | Multi-user cognitive OFDM with adaptive sub-carrier and power allocation | |
| Maisuria et al. | Bayesian-based Spectrum sensing and Optimal Channel estimation for MAC layer protocol in cognitive radio sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190301 |