CN108649995A - A kind of blind congregation method of cognitive radio based on available channel collection - Google Patents
A kind of blind congregation method of cognitive radio based on available channel collection Download PDFInfo
- Publication number
- CN108649995A CN108649995A CN201810478953.7A CN201810478953A CN108649995A CN 108649995 A CN108649995 A CN 108649995A CN 201810478953 A CN201810478953 A CN 201810478953A CN 108649995 A CN108649995 A CN 108649995A
- Authority
- CN
- China
- Prior art keywords
- congregation
- channel
- blind
- user
- available channel
- 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.)
- Granted
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/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/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of blind congregation methods of cognitive radio based on available channel collection, including a pair of of cognitive user U to be mergediAnd Uj1 channel s is randomly choosed from respective idle channel setiAnd sj；According to siAnd sjSeed sequence D is generated with the seed generation method based on channeliAnd Dj；By DiAnd DjRespective frequency hop sequences Z is generated according to random hopping sequences generation methodiAnd Zj；Cognitive user carries out frequency hopping communications according to the frequency hop sequences and is completed until merging.The present invention only needs available channel defecate collection that can realize congregation, improves congregation efficiency, and frequency hop sequences ensure quick, steady congregation between cognitive user, more flexible.
Description
Technical field
The invention belongs to the communications fields, are related to a kind of method of the blind congregation of cognitive radio, more particularly to a kind of based on can
With the blind congregation method of the cognitive radio of channel set.
Background technology
With the fast development of wireless communication technique, outburst is being presented in the quantity and amount of communication data of wireless device in recent years
The growth of formula, this makes radio spectrum resources scarcity problem become to become increasingly conspicuous.In addition, numerous studies show traditional frequency spectrum
Resource fixed allocation technology causes a large amount of frequency spectrum resource utilization rates low.It is needed to improve the availability of frequency spectrum and alleviate frequency spectrum resource
Pressure, cognitive radio is asked to obtain extensive concern as a kind of intelligent wireless technology for realizing dynamic spectrum resource allocation.
It realizes cognitive radio technology, first has to establish the communication link between cognitive user.Since cognitive user belongs to
Unauthorized user, under conditions of no specific assigned common control channel, cognitive user will establish contact each other becomes tired
Difficulty, cognitive user need the communication target user looking for it in a manner of frequency hopping on authorization channel, and then establish logical
Believe link.Such communication link without under the conditions of special control channel establishes problem, is referred to as blind rendezvous problem (Blind
Rendezvous)。
In order to effectively solve the blind rendezvous problem of cognitive user, need to be broken through in blind congregation solution, wherein
Key be design based on available channel collection, without role playing and using the extra demands such as User ID, there is formedness
The frequency hop sequences generating algorithm that can guarantee, this exactly the present invention specifically addresses the problem of and realization target.
Invention content
To solve the above problems, the present invention provides a kind of blind congregation method of cognitive radio based on available channel collection,
Including
A pair of of cognitive user U to be mergediAnd Uj1 channel s is randomly choosed from respective idle channel setiAnd sj；
According to siAnd sjCorresponding seed sequence D is generated with the seed generation method based on channeliAnd Dj；
By DiAnd DjRespective frequency hop sequences Z is generated according to random hopping sequences generation methodiAnd Zj；
Cognitive user is according to the frequency hop sequences ZiAnd ZjIt carries out frequency hopping communications and is completed until merging.
In an embodiment of the present invention, the seed generation method includes：Determine that the optional channel of each cognitive user is total
Number M and current selection channel number siAnd the minimum binary number digit of MDefine seed component Ai、O、
I, wherein AiFor channel number siCorresponding L bits, O=<0,0 .., 0>1 × L, I=<1,1 .., 1>1×L.
According to Ai, O, I, siConstruct seed Di。
In an embodiment of the present invention, further, the seed Di=<Ai, O, I, Ai, O, I, si>1×(6L+1)。
In an embodiment of the present invention, the method that the random hopping sequences generate includes, according to the value of kind of subcomponent
Construction frequency hopping basic sequence Z successively(k), wherein k is seed component index.
In an embodiment of the present invention, the value of described kind of subcomponent is 0,1 or si。
In an embodiment of the present invention, further, when the value of described kind of subcomponent is 0, the frequency hopping basic sequence Z(k)By random sequence X0Element successively with random sequence Y0Corresponding element staggered, wherein X0、Y0For letter can be used from m
Any one arrangement of p element is randomly selected in road number, m is cognitive user number of available channels, and p is the minimum not less than m
Prime number, i.e.,：
Z(k)=<X0[1], Y1[1], X1[2], Y1[2] ... ..., X0[p], Y0[p]>1×2p
In an embodiment of the present invention, further, when the value of described kind of subcomponent is 1, the frequency hopping basic sequence Z(k)By random sequence X1Element successively with random sequence Y1Element staggered, wherein X1For from m available channel number with
Machine chooses a kind of arrangement of p element, Y1To randomly select a kind of arrangement of p+1 element, m from m available channel number
For cognitive user number of available channels, p is the least prime not less than m, i.e.,：
Z(k)=<X1[1], Y1[1], X1[2], Y1[2] ... ..., X1[p], Y1[p-1] .., X1[p], Y1[p-1] ..,
X1[p], Y1[p-2] .., X1[p], Y1[p-3] .., X1[p], Y1[p- (p-1)], X1[1], Y1[2], X1[2], Y1[3] .., X1
[p], Y1[p+1]>1×2p(p+1)。
In an embodiment of the present invention, cognitive user UiAnd UjAccording to the channel number in the corresponding sequence of current time slots into
Guild closes, if merging successfully, cognitive user stops frequency hopping and starts transmission data.
Beneficial effects of the present invention：
1. high efficiency：Cognitive user only needs, according to available channel collection information, not needing the complete of all channels in the present invention
Office's information realizes blind congregation, improves efficiency of algorithm, ensures quick, steady congregation between cognitive user.
2. flexibility：Need not about the additional information of cognitive user, if defined cognitive user is transmitter or receiver,
Or the ID of cognitive user is known in advance, to ensure that this method can be flexibly applied to various cognition wireless networks.
Description of the drawings
Fig. 1 is the complete frequency hop sequences of the user 1 presented in the form of two-dimensional table in the embodiment of the present invention 1；
Fig. 2 is the complete frequency hop sequences of the user 2 presented in the form of two-dimensional table in the embodiment of the present invention 1；
Fig. 3 is the schematic diagram that user 1 and user 2 merge in embodiment 1 in the present invention；
Fig. 4 is the simulation result diagram of the maximum Rendezvous Time of the embodiment of the present invention；
Fig. 5 is the simulation result diagram of the average Rendezvous Time of the embodiment of the present invention.
Specific implementation mode
A kind of blind congregation method of cognitive radio based on available channel collection, including a pair of of cognitive user U to be mergediWith
Uj1 channel s is randomly choosed from respective idle channel setiAnd sj；According to siAnd sjWith the seed generation side based on channel
Method generates seed sequence DiAnd Dj；By DiAnd DjRespective frequency hop sequences Z is generated according to random hopping sequences generation methodiAnd Zj；
Cognitive user UiAnd UjAccording to the frequency hop sequences ZiAnd ZjIt carries out frequency hopping communications and is completed until merging.
Specific step is：
It is known：Total number of channels M, cognitive user Ji TaiN is cognitive user sum；Idle channel Ji TaiWherein CkIndicate k-th of cognitive user UkCorresponding idle channel set.Arbitrary user UiWith user Uj(j ≠ i) is to wait for
A pair of of user of meeting hop communication.
Step 1：User UiIn Ci1 channel s of middle selectioni, user UjIn Cj1 channel s of middle selectionj。
Step 2：User UiWith user UjRespectively according to channel siAnd sj, and the seed generating algorithm based on channel, it is raw
At seed DiAnd Dj。
Step 3：User UiWith user UjRespectively according to seed DiAnd DjAnd frequency hop sequences generating algorithm generates frequency hopping sequence
Arrange ZiAnd Zj。
Step 4：User UiWith user UjZ is respectively adoptediAnd ZjFrequency hopping communications is carried out, is completed until merging.
Seed generation method：
Step A1：Initialization, for being arbitrarily designated user Ui, give user's available channel collection CiIt is compiled with selected channel
Number si, total number of channels M can indicate the minimum binary number digit of M channel
Step A2：Kind subcomponent definition, defines AiFor channel number siCorresponding L bits O=<0,0 .., 0>
1 × L, I=<1,1 .., 1>1×L.
Step A3：Seed generates, seed Di=<Ai, O, I, Ai, O, I, si>1×(6L+1)。
Frequency hopping sequence generating method：
Known conditions：Any given user UiSeed Di, initialization：K=1；
Step B1：If k≤6L, step B2 is executed, otherwise, executes step B3.
Step B2：If Di[k]=0 executes step B4；Otherwise, step B5 is executed.
Step B3：Frequency hop sequences Z(k)=<si>, terminate.
Step B4：Initialize X0=<0,0 .., 0>1 × p, Y0=<0,0 .., 0>1 × p, m=| Ci| it is user UiCan
With the number of channel, p is the least prime not less than m.
Step B41：X0[1：M]=Select (Ci, m)；
// i.e. X0Preceding m element be CiA kind of random alignment of available channel, element here and below refers to channel
Number；
Y0[1：M]=Select (Ci, m)；
// i.e. Y0Preceding m element be CiA kind of random alignment of available channel
Step B42：If p>M, X0[m+1：P]=Select (Ci, p-m)；
// i.e. X0Each element of m+1 to p-th element be all in CiA channel is randomly choosed in a available channel
Number；
Y0[m+1：P]=Select (Ci, p-m)；
// i.e. Y0Each element of m+1 to p-th element be all in CiA channel is randomly choosed in a available channel
Number；
Step B43：Frequency hop sequences Z(k)=<X0[1], Y1[1], X1[2], Y1[2] ... ..., X0[p], Y0[p]>1×
2p；
Step B44：K=k+1, return to step B1；
Step B5：Initialize X1=<0,0 .., 0>1 × p, Y0=<0,0 .., 0>1 × (p+1), m=| Ci| it is user Ui
Number of available channels, p is least prime not less than m.
Step B51：X1[1：M]=Select (Ci, m)；
// i.e. X1Preceding m element be CiThe random row of one kind of available channel；
Y1[1：M]=Select (Ci, m)；
// i.e. Y1Preceding m element be CiA kind of random alignment of available channel；
Step B52：If p>M, X1[m+1：P]=Select (Ci, p-m)；
// i.e. X1Each element of m+1 to p-th element be all in CiThe volume of a channel is randomly choosed in a channel
Number；
Y1[m+1：P+1]=Select (Ci, p+1-m)；
// i.e. Y1Each element of m+1 to+1 element of pth be all in CiOne channel of random selection in a channel
Number；
Step B53：Frequency hop sequences：
Z(k)=<X1[1], Y1[1], X1[2], Y1[2] ... ..., X1[p], Y1[p-1] .., X1[p], Y1[p-1] ..,
X1[p], Y1[p-2] .., X1[p], Y1[p-3] .., X1[p], Y1[p- (p-1)], X1[1], Y1[2], X1[2], Y1[3] .., X1
[p], Y1[p+1]>1×2p(p+1)；
Step B54：K=k+1, return to step B1.
Frequency-hopping method executes flow：
Initialization：T=1；
Step C1：If cognitive user does not merge, step C2 to C5 is executed successively；
Step C2：K=((t-1) mod (6L+1))+1；
Step C3：
Step C4：Cognitive user is attempted in channel Z(k)It merges on [n]；//Z(k)[n] indicates z(k)Nth elements；
Step C5：If merged successfully, cognitive user stops frequency hopping, starts transmission data；Otherwise, step C6 is executed；
Step C6：T=t+1, return to step C1.
Embodiment 1
Assuming that channel complete or collected works are C={ c1, c2, c3, that is, a total of M=3 channel.Consider two cognitive users, it is assumed that
The available channel collection of user 1 and user 2 are respectively C1={ c1, c2And C2={ c2, c3, channel 2 is that they uniquely jointly may be used
Use channel.Assuming that the s selected in starting stage user 11=1, the s that user 2 selects2=2.
1) M=3, s are noticed1And s2Binary representation sequence be respectively<0,1>With<1,0>.It is generated and is calculated according to seed
Method, user 1 and user 2 generate seed D respectively1And D2It is as follows：
D1=<0,1,0,0,1,1,0,1,0,0,1,1, s1>1 × 13,
D2=<1,0,0,0,1,1,1,0,0,0,1,1, s2>1×13。
2) frequency hopping basic sequence is generated
User 1：C1={ c1, c2, available channel number m=2, least prime p=2 of the selection not less than m；
Work as k=1, D1[1]=0, it is assumed that pass through the operation of step B41 and B42, generate X0=<1,2>1 × p, Y0=<2,1>
1 × p, then corresponding frequency hopping basic sequence Z(1)=<X0[1], Y1[1], X1[2], Y1[2] ... ..., X0[p], Y0[p]>1×
2p=<1, 2,2, 1>.Work as k=2, D1[2]=1, it is assumed that pass through the operation of step B41 and B42, generate X1=<2,1>1 × p,
Y1=<1,2,1>1 × (p+1), then corresponding frequency hopping basic sequence：
Z(2)=<X1[1], Y1[1], X1[2], Y1[2] ... ..., X1[p], Y1[p-1] .., X1[p], Y1[p-1] ..,
X1[p], Y1[p-2] .., X1[p], Y1[p-3] .., X1[p], Y1[p- (p-1)], X1[1], Y1[2], X1[2], Y1[3] .., X1
[p], Y1[p+1]>1×2p(p+1)
=<2, 1,1, 2,2, 1,1, 1,2, 2,1, 1>.
For the sake of simplicity, for k=3,4 ..., 12, if D1[k]=0, it assumes that the basic sequence Z of generation(k)) and Z(1)
It is identical (to notice D1[1]=0)；If D1[k]=1, it assumes that the basic sequence Z of generation(k)With Z(2)It is identical (to notice D1[2]=
1)。
As k=13, Z(13)=<s1>=<1>.
User 2：C2={ c2, c3, available channel number m=2, least prime p==2 of the selection not less than m work as k=1,
D2[1]=1, it is assumed that pass through the operation of step B41 and B42, generate X1=<2,3>1 × p, Y1=<3,2,3>1 × (p+1), then phase
The frequency hopping basic sequence answered=<2, 3,3, 2,2, 3,3, 3,2, 2,3, 3>.
Work as k=2, D2[2]=0, it is assumed that pass through the operation of step B41 and B42, generate X0=<3,2>1 × p, Y0=<2,3>
1 × p, then corresponding frequency hopping basic sequence Z(2)=<X0[1], Y1[1], X1[2], Y1[2] ... ..., X0[p], Y0[p]>1×
2p=<3, 2,2, 3>.
For the sake of simplicity, for k=3,4 ..., 12, if D2[k]=0, it assumes that the basic sequence Z of generation(k)With Z(2)Phase
It is same (to notice D2[2]=0)；If D2[k]=1, it assumes that the basic sequence Z of generation(k)) and Z(1)It is identical (to notice D2[1]=
1)。
As k=13, Z(13)=<s2>=<2>.
3) frequency hop sequences are executed to attempt to merge
User 1 and user 2 utilize respective frequency hop sequences, and executing flow according to hop algorithm continuously attempts to merge, until
Until merging successfully.The frequency hop sequences of user 1 are presented using the form of two-dimensional table, are specifically shown in Fig. 1；Similarly,
The frequency hop sequences of user 2 can be presented by Fig. 2.
User 1 and user 2 can ensure to realize congregation within the limited time, regardless of their slot offsets.For example,
Assuming that user 1 (slot offset 7) after user 2 executes 7 time slots of frequency hop sequences just starts to execute its frequency hop sequences, calculate
Law theory ensures that when by 33 time slots, user 1 and user 2 realize congregation on their publicly available channel 2, specifically such as
Shown in Fig. 3.It is noted that user 1 and user 2 may realize congregation within the shorter time, for example, in the present embodiment, by 5
A time slot, user 1 and user 2 can simultaneously access channel 2 and realize and merge, but this not instead of theory of algorithm ensures,
It is related with specific example.
As shown in figure 3, executing the frequency hop sequences of Fig. 1 and Fig. 2, user 1 and user 2 ensure to realize meeting in finite time
It closes.
The simulation experiment result
Emulation experiment is carried out in Matlab7.11, representational CSAC, MMC, EJS and SSB is selected to be compared.For side
Just for the sake of, method proposed by the present invention is named as ZOS.In emulation experiment, M=100 is set, i.e. channel complete or collected works C includes 100
Channel；Select the available channel collection that a part of channel forms each user at random from C, on average, each user have θ ×
M (0≤θ≤1) a available channel, wherein parameter θ is set as changing to 0.5 from 0.1 in emulation experiment；In addition, two users
Between the number of common available channel be set as 6.Fig. 4 and Fig. 5 give the simulation experiment result, wherein Fig. 4 provide most
It is in terms of big Rendezvous Time (Maximum TTR) as a result, and Fig. 5 is provided in terms of average Rendezvous Time (Average TTR)
As a result, each the result is that being obtained based on 5000 independent operatings statistics.As can be seen that congregation method proposed by the present invention exists
Aspect of performance has surmounted existing blind Channel congregation method.
It these are only the embodiment of the present invention, the optional total number of channels of the cognitive user in embodiment and channel number, jump
Frequency starts slot index and is only for example, and does not limit protection scope of the present invention with this；Those skilled in the art are not violating this
Any replacement and improvement, belong to protection scope of the present invention made by the basis of inventive concept.
Claims (8)
1. a kind of method of the blind congregation of cognitive radio based on available channel collection, which is characterized in that including：
A pair of of cognitive user U to be mergediAnd Uj1 channel s is randomly choosed from respective idle channel setiAnd sj；
According to the channel si、sj, the seed generation method generation seed sequence D based on channeliAnd Dj；
By DiAnd DjRespective frequency hop sequences Z is generated according to random hopping sequences generation methodiAnd Zj；
Cognitive user UiAnd UjAccording to the frequency hop sequences ZiAnd ZjIt carries out frequency hopping communications and is completed until merging.
2. the blind congregation method of the cognitive radio according to claim 1 based on available channel collection, which is characterized in that preferably
, the seed generation method includes：
Determine the potentially useful total number of channels M and current selection channel number s of each cognitive useriAnd the minimum binary system of M
Numerical digit number L, i.e.,
Define seed component Ai, O, I, wherein AiFor channel number siCorresponding L bits, O=<0,0 .., 0>1×L, I
=<1,1 .., 1>1×L；
According to Ai, O, I, siConstruct seed Di。
3. the blind congregation method of the cognitive radio according to claim 2 based on available channel collection, which is characterized in that described
Seed Di=<Ai, O, I, Ai, O, I, si>1×(6L+1)。
4. the blind congregation method of the cognitive radio according to claim 2 based on available channel collection, which is characterized in that
The method that the random hopping sequences generate includes constructing frequency hopping basic sequence Z successively according to the value of kind of subcomponent(k),
Wherein k is seed component index.
5. the blind congregation method of the cognitive radio according to claim 4 based on available channel collection, which is characterized in that described
The value of kind subcomponent is 0,1 or si。
6. the blind congregation method of the cognitive radio according to claim 5 based on available channel collection, which is characterized in that described
When the value of kind subcomponent is 0, the frequency hopping basic sequence Z(k)By random sequence X0Element successively with random sequence Y0Pair
Answer element staggered, wherein X0、Y0To randomly select any one arrangement of p element from m available channel number, m is
Cognitive user number of available channels, p are the least prime not less than m, i.e.,：
Z(k)=<X0[1], Y1[1], X1[2], Y1[2] ... ..., X0[p], Y0[p]>1×2p。
7. the blind congregation method of the cognitive radio according to claim 5 based on available channel collection, which is characterized in that described
When the value of kind subcomponent is 1, the frequency hopping basic sequence Z(k)By random sequence X1Element successively with random sequence Y1Member
Plain staggered, wherein X1To randomly select a kind of arrangement of p element, Y from m available channel number1For letter can be used from m
A kind of arrangement of p+1 element is randomly selected in road number, m is cognitive user number of available channels, and p is the minimum element not less than m
Number, i.e.,：
Z(k)=<X1[1], Y1[1], X1[2], Y1[2] ... ..., X1[p], Y1[p-1] .., X1[p], Y1[p-1] .., X1
[p], Y1[p-2] .., X1[p], Y1[p-3] .., X1[p], Y1[p- (p-1)], X1[1], Y1[2], X1[2], Y1[3] .., X1
[p], Y1[p+1]>1×2p(p+1)。
8. the blind congregation method of the cognitive radio according to claim 1 or 2 based on available channel collection, which is characterized in that
The cognitive user UiAnd UjIt merges according to the channel number in the corresponding sequence of current time slots, if merging successfully
Cognitive user stops frequency hopping and starts transmission data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810478953.7A CN108649995B (en) | 2018-05-16 | 2018-05-16 | Cognitive radio blind convergence method based on available channel set |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810478953.7A CN108649995B (en) | 2018-05-16 | 2018-05-16 | Cognitive radio blind convergence method based on available channel set |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108649995A true CN108649995A (en) | 2018-10-12 |
| CN108649995B CN108649995B (en) | 2020-03-31 |
Family
ID=63756844
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810478953.7A Active CN108649995B (en) | 2018-05-16 | 2018-05-16 | Cognitive radio blind convergence method based on available channel set |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108649995B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1614901A (en) * | 2003-08-28 | 2005-05-11 | 国际商业机器公司 | Apparatus and method employing dynamic hop sequence adjustment in fhss networks |
| US7068631B2 (en) * | 2001-08-06 | 2006-06-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Training sequence hopping in a radio communication system |
| CN102833736A (en) * | 2012-08-30 | 2012-12-19 | 重庆大学 | Communication key generation method and secure channel selection method for cognitive radio system |
| CN105284054A (en) * | 2013-04-19 | 2016-01-27 | 苹果公司 | Device and method for discovery channel hopping scheme |
| CN105722092A (en) * | 2014-11-30 | 2016-06-29 | 中国科学院沈阳自动化研究所 | Multi-antenna cognitive wireless network channel converging method based on permutation group |
| CN106332267A (en) * | 2016-08-31 | 2017-01-11 | 零度智控（北京）智能科技有限公司 | Frequency-hopping wireless communication based synchronous access method, equipment and system |
| CN106412926A (en) * | 2016-09-18 | 2017-02-15 | 重庆大学 | Control channel selection method of cognitive mobile ad hoc network |
| CN107017919A (en) * | 2016-01-27 | 2017-08-04 | 霍尼韦尔国际公司 | Many orthogonal channel sequences are produced in frequency-hopping system using skew |
-
2018
- 2018-05-16 CN CN201810478953.7A patent/CN108649995B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7068631B2 (en) * | 2001-08-06 | 2006-06-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Training sequence hopping in a radio communication system |
| CN1614901A (en) * | 2003-08-28 | 2005-05-11 | 国际商业机器公司 | Apparatus and method employing dynamic hop sequence adjustment in fhss networks |
| CN102833736A (en) * | 2012-08-30 | 2012-12-19 | 重庆大学 | Communication key generation method and secure channel selection method for cognitive radio system |
| CN105284054A (en) * | 2013-04-19 | 2016-01-27 | 苹果公司 | Device and method for discovery channel hopping scheme |
| CN105722092A (en) * | 2014-11-30 | 2016-06-29 | 中国科学院沈阳自动化研究所 | Multi-antenna cognitive wireless network channel converging method based on permutation group |
| CN107017919A (en) * | 2016-01-27 | 2017-08-04 | 霍尼韦尔国际公司 | Many orthogonal channel sequences are produced in frequency-hopping system using skew |
| CN106332267A (en) * | 2016-08-31 | 2017-01-11 | 零度智控（北京）智能科技有限公司 | Frequency-hopping wireless communication based synchronous access method, equipment and system |
| CN106412926A (en) * | 2016-09-18 | 2017-02-15 | 重庆大学 | Control channel selection method of cognitive mobile ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108649995B (en) | 2020-03-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Leshem et al. | Game theory and the frequency selective interference channel | |
| US9054788B2 (en) | Frequency hopping scheme for OFDMA system | |
| RU2528078C2 (en) | Method for secure communication in network, communication device, network and computer programme therefor | |
| Evangelista et al. | Fairness and sum-rate maximization via joint subcarrier and power allocation in uplink SCMA transmission | |
| US9252929B2 (en) | Method for achieving rendezvous for cognitive radio networks | |
| CN103916355B (en) | Distribution method for sub carriers in cognitive OFDM network | |
| CN101047402B (en) | Communication control method/system | |
| Li et al. | Channel hopping protocols for dynamic spectrum management in 5G technology | |
| Dang et al. | Lexicographic codebook design for OFDM with index modulation | |
| CN105024793B (en) | Pilot distribution method based on genetic algorithm in a kind of extensive antenna system | |
| You et al. | User clustering scheme for downlink hybrid NOMA systems based on genetic algorithm | |
| CN107682043B (en) | Method for generating frequency hopping pattern | |
| CN103619024A (en) | Method for distributing spectrum resources between cellular users and D2D users in same cell | |
| CN105873214A (en) | Resource allocation method of D2D communication system based on genetic algorithm | |
| CN106063212A (en) | Method and device for generating non-gaussian interference channel in wireless communication system | |
| CN101330487A (en) | Symbol interlacing method, apparatus and terminal equipment | |
| Sun et al. | Semi-decentralized federated edge learning with data and device heterogeneity | |
| CN102638436B (en) | Method and system for realizing high-security fast frequency-hopping transmission | |
| Chao et al. | Supporting fast rendezvous guarantee by randomized quorum and latin square for cognitive radio networks | |
| CN108649995A (en) | A kind of blind congregation method of cognitive radio based on available channel collection | |
| CN110098891A (en) | Deinterleaving method and interlaced device | |
| CN107592673B (en) | Method, device and system for processing pseudorandom sequence | |
| Chen et al. | Anti-jamming channel hopping protocol design based on channel occupancy probability for Cognitive Radio Networks | |
| CN110995399A (en) | Large-scale MIMO pilot frequency distribution method based on user grouping | |
| CN106685550B (en) | Completely distributed encountering method for unauthorized users in cognitive radio network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: No. 293, Zhongshan Avenue West, Tianhe District, Guangzhou, Guangdong 510630 Patentee after: GUANGDONG POLYTECHNIC NORMAL University Address before: 510000 No. 293 Shipai Zhongshan Avenue, Tianhe District, Guangzhou City, Guangdong Province Patentee before: GUANGDONG POLYTECHNIC NORMAL University |