CN106027118B - A kind of channel of cognitive radio networks crosses method and system - Google Patents
A kind of channel of cognitive radio networks crosses method and system Download PDFInfo
- Publication number
- CN106027118B CN106027118B CN201610532791.1A CN201610532791A CN106027118B CN 106027118 B CN106027118 B CN 106027118B CN 201610532791 A CN201610532791 A CN 201610532791A CN 106027118 B CN106027118 B CN 106027118B
- Authority
- CN
- China
- Prior art keywords
- channel
- crosses
- user
- users
- slotted
- 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.)
- Active
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/0006—Assessment of spectral gaps suitable for allocating digitally modulated signals, e.g. for carrier allocation in cognitive radio
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Spectroscopy & Molecular Physics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
It crosses method the invention discloses a kind of channel of cognition wireless network, including：The corresponding non-slotted channel sequence that crosses of each user in cognition wireless network is generated, and section independently starts the channel channel of user in different times using same CH algorithms；When crossing there are two subscriber channels, the corresponding new non-slotted channel sequence of two users is generated, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses using recent minimum channel access algorithm；It is crossed using the corresponding non-slotted channel sequence that crosses of each user；Crossing the time for user can be shortened, and then improve the speed that crosses of channel hopping；It crosses system the present invention also provides a kind of channel of cognition wireless network, crossing the time for user can be shortened, and then improve the speed that crosses of channel hopping.
Description
Technical field
Cross technical field the present invention relates to channel, more particularly to a kind of channel of cognition wireless network cross method and
System.
Background technology
At present, due to the exponential increase of various wireless devices and fixed frequency spectrum allocation rule, people is completely some frequency spectrums
Suffer from, and the not utilized or utilization rate of most spectrums is not high.It is utilized to alleviate the uneven of frequency spectrum resource, there has been proposed cognitions
Radiotechnics enables secondary user to effectively utilize rare and valuable frequency spectrum resource.
In cognitive radio networks (cognitive radio networks, CRNS), secondary user may in advance not
Know mutual presence, therefore, before they exchange information, they can detect mutual presence to establish communication link.Letter
It is that two or more radio of secondary user intersect and establish the basic mistake of a link in common channels that road, which crosses,
Journey, wherein, channel hopping (Channel Hopping, CH) is blind one of the most representative technology that crosses.Using CH technologies,
Each secondary user of CRN selects the frequency hop sequences in one group of channel and channel to cross with potential neighbours.
In existing channel crosses method, each user independently generates respective letter using same hop algorithm
Road frequency hop sequences, can be with direct communication, also, when two when they are being present on some time slot on identical frequency hopping channel
After user crosses, they will exchange mutual frequency hop sequences in next several time slots, then with themselves side
Formula frequency hopping.For example, as shown in Figure 1, there are three user u1, u2, u3, these three users have 6 common channels, work as u2And u3In channel
After 1 first time of 4 time slot crosses, they can continue frequency hopping (skipping 3 time slot 3 of channel and 5 time slot 4 of channel) until u1And u2In channel 4
Time slot 9 crosses, at this point, due to u1Pass through u2U can be obtained3The channel of next time slot (time slot 10), u1It can be cut in time slot 10
Change to u3Channel, therefore, the crossing the time of these three users (TTR) is 11 time slots；Thus it is apparent that such jump
Frequency extends crossing the time for all users, affects the speed that crosses of channel hopping.Therefore, how to shorten when crossing of user
Between, and then the speed that crosses of channel hopping is improved, it is those skilled in the art's technical issues that need to address.
Invention content
In view of this, it crosses method and system the present invention provides a kind of channel of cognition wireless network, is shortened with realizing
User's crosses the time, and then improves the purpose of the speed that crosses of channel hopping.
The method in order to solve the above technical problems, a kind of channel of cognition wireless network of present invention offer crosses, including：
The corresponding non-slotted channel sequence that crosses of each user in cognition wireless network is generated, and in difference using same CH algorithms
Period independently start the channel channel of user；
When crossing there are two subscriber channels, generate two users using recent minimum channel access algorithm and respectively correspond to
New non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；
It is crossed using the corresponding non-slotted channel sequence that crosses of each user.
Wherein, when crossing there are two subscriber channels, it is each that two users are generated using recent minimum channel access algorithm
Self-corresponding new non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses, including：
Determine the value of a message length；
When crossing there are two subscriber channels, generate two users using recent minimum channel access algorithm and respectively correspond to
A message length new non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses.
Wherein, the new of the recent minimum channel access algorithm generation corresponding message length of two users is utilized
Non-slotted channel sequence, including：
Compare the non-slotted channel sequence that crosses of two users to cross there are channel, determine described two users in a letter
Ceasing will be in the time slot that crosses that same channel crosses in length；
Determine in described two users have available channel more than user as target user；
The access times of each available and nonoverlapping channel of the target user are counted, and select access times minimum
Channel cross as described in the access channel of time slot.
Wherein it is determined that there is the user more than available channel as target user in described two users, including：
The quantity of the available channel of described two users is counted respectively；
The big user of the quantity is chosen as target user；
If the quantity of the available channel of described two users is consistent, a user is randomly selected as target user.
Wherein, the channel for selecting access times minimum crosses the access channel of time slot as described in, including：
The channel for selecting access times minimum crosses the access channel of time slot as described in；
If the access times there are multiple channels are minimum, one is randomly selected in multiple channels minimum from access times
Channel crosses the access channel of time slot as described in.
It crosses system the present invention also provides a kind of channel of cognition wireless network, including：
CH algoritic modules are believed for generating the corresponding time slot that crosses of each user in cognition wireless network using same CH algorithms
Road sequence, and section independently starts the channel channel of user in different times；
Recent minimum channel access algorithm module, for when crossing there are two subscriber channels, utilizing minimum letter in the recent period
The road access algorithm generation corresponding new non-slotted channel sequence of two users, and using new non-slotted channel sequence as crossing
Non-slotted channel sequence；
Cross module, for being crossed using the corresponding non-slotted channel sequence that crosses of each user.
Wherein, the recent minimum channel access algorithm module, including：
Message length determination unit, for determining the value of a message length；
Recent minimum channel access algorithm unit, for when crossing there are two subscriber channels, utilizing minimum letter in the recent period
The new non-slotted channel sequence of the road access algorithm generation corresponding message length of two users, and new time slot is believed
Road sequence is as the non-slotted channel sequence that crosses.
Wherein, the recent minimum channel access algorithm unit, including：
Cross time slot subelement, for comparing the non-slotted channel sequence that crosses of two users to cross there are channel, determines
Described two users will be in the time slot that crosses that same channel crosses in a message length；
Target user's subelement, for determine in described two users have available channel more than user as target use
Family；
Channel variation subelement, for counting the access time of each available and nonoverlapping channel of the target user
Number, and the channel for selecting access times minimum crosses the access channel of time slot as described in.
Wherein, target user's subelement is specifically used for counting the quantity of the available channel of described two users respectively；
The big user of the quantity is chosen as target user；It is random to select if the quantity of the available channel of described two users is consistent
Take subelement of the user as target user.
Wherein, the channel that the channel variation subelement is specifically used for selecting access times minimum crosses time slot as described in
Access channel；If the access times there are multiple channels are minimum, randomly selected in multiple channels minimum from access times
One channel crosses the access channel of time slot as described in.
A kind of above channel of cognition wireless network provided by the invention crosses method, including：It is given birth to using same CH algorithms
The corresponding non-slotted channel sequence that crosses of each user into cognition wireless network, and section independently starts user in different times
Channel channel；When crossing there are two subscriber channels, two users are generated respectively using recent minimum channel access algorithm
Corresponding new non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；Utilize each user couple
The non-slotted channel sequence that crosses answered crosses；
As it can be seen that the non-slotted channel that crosses of user that this method had been crossed using the change of recent minimum channel access algorithm
Sequence prevents them from crossing again, to improve the speed that they and other channels cross, and then can shorten the friendship of user
It converges the time, so as to improve the speed that crosses of channel hopping；It crosses the present invention also provides a kind of channel of cognition wireless network and is
System has above-mentioned advantageous effect, and details are not described herein.
Description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of invention, for those of ordinary skill in the art, without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is that the channel that provides of the prior art crosses the schematic diagram of process；
Fig. 2 is that the channel of cognition wireless network provided in an embodiment of the present invention crosses the flow chart of method；
Fig. 3 is that channel crosses the schematic diagram of process after improvement provided in an embodiment of the present invention；
Fig. 4 is that channel crosses the lab diagram of process after L=20 is improved under symmetric case provided in an embodiment of the present invention；
Fig. 5 is that channel crosses the lab diagram of process after N=10 is improved under symmetric case provided in an embodiment of the present invention；
Fig. 6 is that channel crosses the lab diagram of process after L=20 is improved under asymmetric case provided in an embodiment of the present invention；
Fig. 7 is that channel crosses the lab diagram of process after N=10 is improved under asymmetric case provided in an embodiment of the present invention；
Fig. 8 is that the channel of cognition wireless network provided in an embodiment of the present invention crosses the structure diagram schematic diagram of system.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without making creative work
Embodiment shall fall within the protection scope of the present invention.
The core of the present invention is to provide a kind of channel of cognition wireless network and crosses method and system, shortens user to realize
Cross the time, and then improve channel hopping the speed that crosses purpose.
In order to which those skilled in the art is made to more fully understand the present invention program, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.
One CRN of setting is made of N (N >=2) a secondary user, they can use set N={ u1..., uNRepresent.It is false
It is to have time slot and all time slots all to have identical and fixed length to determine system.Licensed spectrum is divided into M
(M >=1) non-overlapping channel is by M={ c1..., cMRepresent.Assuming that all secondary user's in network know all these letters
Road, and each user is equipped with a single cognitive radio.In view of the heterogeneity of frequency spectrum, settingIt represents
Group uIAvailable channel.
If user i and user j jump onto the same channel of same time slot, then they just cross.Accelerating algorithm is collection
The user to cross, entirety of each user as a radio are closed.Therefore, they can attempt to cross with other users
Into one group.Its operation principle is as shown in Figure 2：With reference to figure 2, Fig. 2 shows cognition wireless networks provided in an embodiment of the present invention
Channel crosses the flow chart of method, and this method specifically may include steps of：
S100, the corresponding non-slotted channel sequence that crosses of each user in cognition wireless network is generated using same CH algorithms, and
Section independently starts the channel channel of user in different times；
Wherein, the purpose of the step is that all users generate their the non-slotted channel sequence that crosses using identical CH algorithms
Row, such as the user u shown in Fig. 11, u2, u3Each corresponding channel of time slot in 16 each time slots, form one when crossing
Gap channel sequence；Each user is from different period independent startup channels.Such as the user u shown in Fig. 11, u2, u3Three
A different period independently starts the channel channel of user.
S110, when crossing there are two subscriber channels, using recent minimum channel access algorithm generate two users it is each
Self-corresponding new non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；
Wherein, each user is communicated using the non-slotted channel sequence that crosses that CH algorithms generate, if there are two users
Under same time slot in same channel, then the two users cross.It can be in next time slot after being crossed due to them
In share mutual frequency-hopping sequences information, i.e. the two users subsequently no longer cross；Therefore, in order to shorten cognition nothing
Each user crosses the time in gauze network, i.e., to prevent the user to have crossed from crossing again；Therefore this method uses
The recent minimum channel access algorithm generation corresponding new non-slotted channel sequence of two users, and by new non-slotted channel sequence
Row are as the non-slotted channel sequence that crosses.Channel each in this way is not all of all being generated with by CH algorithms when being crossed
Frequency hop sequences are given tacit consent to attempt to cross.
Step S110 detailed processes can be：
Determine the value of a message length；
When crossing there are two subscriber channels, generate two users using recent minimum channel access algorithm and respectively correspond to
A message length new non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses.
Wherein, it is not necessary to accordingly be changed the corresponding channel of follow-up whole time slot for the user that crossed, it is only necessary to
It modifies in one message length；Here the value of a message length can be set as used in whole users are crossed
Length.
I.e. when any two users cross, they will share mutual hopping sequence information from next time slot.It is fixed
One message length of justice is L, and then they generate the next new non-slotted channel sequences of L using recent minimum channel access algorithm
Row, and be the variation of non-slotted channel sequence of crossing in this time slot notification contact method.
Wherein, the new of the recent minimum channel access algorithm generation corresponding message length of two users is utilized
Non-slotted channel sequence, including：
Compare the non-slotted channel sequence that crosses of two users to cross there are channel, determine described two users in a letter
Ceasing will be in the time slot that crosses that same channel crosses in length；
Determine in described two users have available channel more than user as target user；
The access times of each available and nonoverlapping channel of the target user are counted, and select access times minimum
Channel cross as described in the access channel of time slot.
Wherein, it if the quantity of the available channel of described two users is consistent, randomly selects a user and is used as target
Family；If the access times there are multiple channels are minimum, a channel is randomly selected in multiple channels minimum from access times
Access channel as the time slot that crosses.
I.e. when crossing in some time slot in any two user, they will share frequency hop sequences in next time slot
Information.Using recent minimum channel access algorithm, accelerate to cross with other users to reduce to repeat to cross.In this algorithm
In, only change the channels of these time slots that user will cross again.Basic demand is that they will not in these time slots
In frequency hopping to same channel.Its operation principle can be as follows：
Compare two non-slotted channel sequences that cross, finding out two users will be in the time slot that same channel crosses；
Possessing the user of more available channels can be chosen to change its sequence, this will make sequence more flexible.If it
Have identical quantity available channel can be selected at random.
Access channel is readjusted in these selected time slots.Specific practice be pair with a certain time slot to be adjusted, calculate
Before the time slot in L time slot, then each available and non-overlapping channel access times of the user select access times minimum
Access channel of the channel as the time slot.If there are multiple channel access numbers are all minimum, one of those is randomly choosed
Channel.
S120, it is crossed using the corresponding non-slotted channel sequence that crosses of each user.
Wherein, when new sequence is completed, each user uses to be attempted by corresponding acquiescence frequency hop sequences
It crosses.
The process for please referring to Fig.1 and illustrating the principle of algorithm and acceleration crosses with a simply example below Fig. 3：
As shown in Figure 1, there are three user u1, u2, u3, these three users have 6 common channels, work as u2And u3In channel 4
After 1 first time of gap crosses, they can continue frequency hopping (skipping 3 time slot 3 of channel and 5 time slot 4 of channel) until u1And u2In channel 4
Gap 9 crosses, at this point, due to u1Pass through u2U can be obtained3The channel of next time slot (time slot 10), u1It can switch in time slot 10
To u3Channel, therefore, the crossing the time of these three users (TTR) is 11 time slots；
In the method for using the present embodiment i.e. in acceleration, once u2And u3After 1 first time of 4 time slot of channel crosses,
They will change its frequency hop sequences, to ensure that they will not be in office when in a period of time frequency hopping to same channel of gap.For example,
u2The channel sequence of time slot 3, time slot 4 and time slot 5 is changed, then, works as u1And u2It meets at 2 time slot 4 of channel to cross, due to u1
Pass through u2U can be obtained3The channel of next time slot (time slot 5), u1U can be switched in time slot 53Channel all of which
Time that crosses is reduced to 6 from 11.
The performance of the above method can be assessed using the simulator that C++ writes, selection is symmetrical in the simulator
With it is asymmetrical in the case of all effective random algorithm as Sequence Generation Algorithm.Experimental result is please referred to Fig.4 to Fig. 7；
Wherein, Fig. 4 is under symmetric case, the quantity (L=20) of total time and user that is, in a symmetrical case, cross
Time increases with the increase of the user of L=20, and all users have 6 common available channels.But in the recent period
Minimum channel access algorithm greatly reduces the time for the needs that cross.Fig. 5 is time ratio and the Chief Information Officer that crosses under symmetric case
It spends (N=10), i.e., in the symmetric case, the time ratio to cross between random algorithm and recent minimum channel access algorithm is low
's.And when L very littles, ratio reduces with the increase of L, and when L reaches a definite value, ratio can also obtain one and move
State stationary value.
Fig. 6 is under asymmetric case, and the quantity (L=20) of total time and number of users that is, under asymmetric case, crosses
Time increases with the increase of the user of L=20, and all users have at least three available channel jointly.But
Recent minimum channel access algorithm greatly reduces the time for the needs that cross.Fig. 7 is under asymmetric case, and time ratio is with crossing
Message length (N=10), i.e., in the case that asymmetrical, cross between random algorithm and recent minimum channel access algorithm when
Between than being low.And when L very littles, ratio reduces with the increase of L, and when L reaches a definite value, ratio can also obtain
Obtain a dynamic stability value.
Based on above-mentioned technical proposal, the channel of the cognition wireless network that the embodiment of the present invention carries crosses method, using recent
The non-slotted channel sequence that crosses of user that the change of minimum channel access algorithm had crossed, prevents them from crossing again, to carry
The high speed that they cross with other channels, and then crossing the time for user can be shortened, so as to improve channel hopping
Cross speed；
It is crossed method based on the channel of cognition wireless network that the embodiments of the present invention provide, the embodiment of the present invention also carries
A kind of channel of cognition wireless network has been supplied to cross system, can have been corresponded with reference to reference to figure 8, which can include as follows
Content：
CH algoritic modules 100, for using same CH algorithms generate cognition wireless network in each user is corresponding cross when
Gap channel sequence, and section independently starts the channel channel of user in different times；
Recent minimum channel access algorithm module 200, for when crossing theres are two subscriber channels, using in the recent period at least
Channel access algorithm generates the corresponding new non-slotted channel sequence of two users, and using new non-slotted channel sequence as friendship
Remittance non-slotted channel sequence；
The module that crosses 300, for being crossed using the corresponding non-slotted channel sequence that crosses of each user.
Optionally, the recent minimum channel access algorithm module 200, including：
Message length determination unit, for determining the value of a message length；
Recent minimum channel access algorithm unit, for when crossing there are two subscriber channels, utilizing minimum letter in the recent period
The new non-slotted channel sequence of the road access algorithm generation corresponding message length of two users, and new time slot is believed
Road sequence is as the non-slotted channel sequence that crosses.
Optionally, the recent minimum channel access algorithm unit, including：
Cross time slot subelement, for comparing the non-slotted channel sequence that crosses of two users to cross there are channel, determines
Described two users will be in the time slot that crosses that same channel crosses in a message length；
Target user's subelement, for determine in described two users have available channel more than user as target use
Family；
Channel variation subelement, for counting the access time of each available and nonoverlapping channel of the target user
Number, and the channel for selecting access times minimum crosses the access channel of time slot as described in.
Optionally, target user's subelement is specifically used for counting the number of the available channel of described two users respectively
Amount；The big user of the quantity is chosen as target user；If the quantity of the available channel of described two users is consistent, at random
Choose subelement of the user as target user.
Optionally, when the channel that the channel variation subelement is specifically used for selecting access times minimum crosses as described in
The access channel of gap；If the access times there are multiple channels are minimum, selected at random in multiple channels minimum from access times
A channel is taken to cross as described in the access channel of time slot.
It should be noted that each embodiment in this specification is described by the way of progressive, each embodiment weight
Point explanation is all difference with other embodiments, and just to refer each other for identical similar part between each embodiment.
For system class embodiment, since it is basicly similar to embodiment of the method, so describing fairly simple, related part is joined
See the part explanation of embodiment of the method.
The method and system that cross above to the channel of cognition wireless network provided by the present invention are described in detail.This
Specific case is applied in text to be expounded the principle of the present invention and embodiment, the explanation of above example is only intended to
It facilitates the understanding of the method and its core concept of the invention.It should be pointed out that for those skilled in the art,
Without departing from the principles of the invention, can also to the present invention some improvement and modification can also be carried out, these improvement and modification are also fallen
Enter in the protection domain of the claims in the present invention.
Claims (8)
- A kind of method 1. channel of cognition wireless network crosses, which is characterized in that including：The corresponding non-slotted channel sequence that crosses of each user in cognition wireless network is generated, and when different using same CH algorithms Between section independently start the channel channel of user；Determine the value of a message length；When crossing there are two subscriber channels, two users corresponding one are generated using recent minimum channel access algorithm The new non-slotted channel sequence of a message length, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；It is crossed using the corresponding non-slotted channel sequence that crosses of each user.
- The method 2. channel of cognition wireless network according to claim 1 crosses, which is characterized in that utilize minimum letter in the recent period The new non-slotted channel sequence of the road access algorithm generation corresponding message length of two users, including：Compare the non-slotted channel sequence that crosses of two users to cross there are channel, determine described two users in a Chief Information Officer It will be in the time slot that crosses that same channel crosses in degree；Determine in described two users have available channel more than user as target user；Count the access times of each available and nonoverlapping channel of the target user, and the letter for selecting access times minimum Road crosses the access channel of time slot as described in.
- The method 3. channel of cognition wireless network according to claim 2 crosses, which is characterized in that determine described two use There is the user more than available channel as target user in family, including：The quantity of the available channel of described two users is counted respectively；The big user of the quantity is chosen as target user；If the quantity of the available channel of described two users is consistent, a user is randomly selected as target user.
- The method 4. channel of cognition wireless network according to claim 2 crosses, which is characterized in that selection access times are most Few channel crosses the access channel of time slot as described in, including：The channel for selecting access times minimum crosses the access channel of time slot as described in；If the access times there are multiple channels are minimum, a channel is randomly selected in multiple channels minimum from access times Access channel as the time slot that crosses.
- The system 5. a kind of channel of cognition wireless network crosses, which is characterized in that including：CH algoritic modules, for generating the corresponding non-slotted channel sequence that crosses of each user in cognition wireless network using same CH algorithms Row, and section independently starts the channel channel of user in different times；Recent minimum channel access algorithm module, for when crossing there are two subscriber channels, being visited using recent minimum channel Ask that algorithm generates the corresponding new non-slotted channel sequence of two users, and using new non-slotted channel sequence as the time slot that crosses Channel sequence；Wherein, the recent minimum channel access algorithm module, including：Message length determination unit, for determining the value of a message length；Recent minimum channel access algorithm unit, for when crossing there are two subscriber channels, being visited using recent minimum channel Ask the new non-slotted channel sequence of the algorithm generation corresponding message length of two users, and by new non-slotted channel sequence Row are as the non-slotted channel sequence that crosses；Cross module, for being crossed using the corresponding non-slotted channel sequence that crosses of each user.
- The system 6. channel of cognition wireless network according to claim 5 crosses, which is characterized in that the letter minimum in the recent period Road access algorithm unit, including：Cross time slot subelement, for comparing the non-slotted channel sequence that crosses of two users to cross there are channel, determines described Two users will be in the time slot that crosses that same channel crosses in a message length；Target user's subelement, for determine in described two users have available channel more than user as target user；Channel variation subelement, for counting the access times of each available and nonoverlapping channel of the target user, and The channel for selecting access times minimum crosses the access channel of time slot as described in.
- The system 7. channel of cognition wireless network according to claim 6 crosses, which is characterized in that target user's Unit is specifically used for counting the quantity of the available channel of described two users respectively；The big user of the quantity is chosen as target User；If the quantity of the available channel of described two users is consistent, the son for randomly selecting a user as target user is single Member.
- The system 8. channel of cognition wireless network according to claim 6 crosses, which is characterized in that channel variation The channel that unit is specifically used for selecting access times minimum crosses the access channel of time slot as described in；If there are multiple channels Access times are minimum, then a channel is randomly selected from the minimum multiple channels of access times and is crossed as described in the visit of time slot Ask channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610532791.1A CN106027118B (en) | 2016-07-07 | 2016-07-07 | A kind of channel of cognitive radio networks crosses method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610532791.1A CN106027118B (en) | 2016-07-07 | 2016-07-07 | A kind of channel of cognitive radio networks crosses method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106027118A CN106027118A (en) | 2016-10-12 |
| CN106027118B true CN106027118B (en) | 2018-06-29 |
Family
ID=57108507
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610532791.1A Active CN106027118B (en) | 2016-07-07 | 2016-07-07 | A kind of channel of cognitive radio networks crosses method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106027118B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106604321B (en) * | 2016-12-23 | 2020-12-04 | 西安电子科技大学 | Adjustable channel rendezvous method based on limited coverage in cognitive radio network |
| CN106788820B (en) | 2017-01-04 | 2020-06-05 | 河海大学常州校区 | Unauthorized user meeting method for cognitive radio network transceiver |
| CN107708121A (en) * | 2017-08-31 | 2018-02-16 | 南京理工大学 | A kind of optimal cognitive radio networks channel crosses the building method of sequence |
| CN108040340B (en) * | 2017-12-21 | 2021-03-26 | 苏州大学 | Wireless self-organizing network convergence method, device, system and storage medium |
| CN109302707B (en) * | 2018-12-05 | 2022-11-22 | 南京理工大学 | Optimal stability cognitive radio intersection sequence construction method |
| CN113572519B (en) * | 2021-08-12 | 2022-09-30 | 天津(滨海)人工智能军民融合创新中心 | Unmanned aerial vehicle swarm cognitive networking channel intersection method based on hierarchical network architecture |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223191B (en) * | 2011-06-02 | 2014-11-05 | 电信科学技术研究院 | Method and equipment for acquiring idle spectrum |
| US9252929B2 (en) * | 2013-09-25 | 2016-02-02 | Hong Kong Baptist University | Method for achieving rendezvous for cognitive radio networks |
| CN104202813B (en) * | 2014-09-12 | 2017-12-05 | 中国人民解放军国防科学技术大学 | Cognitive radio networks clock synchronizing method based on double-deck control channel mechanism |
-
2016
- 2016-07-07 CN CN201610532791.1A patent/CN106027118B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106027118A (en) | 2016-10-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106027118B (en) | A kind of channel of cognitive radio networks crosses method and system | |
| JP4793569B2 (en) | Bandwidth allocation method and radio communication system | |
| Chang et al. | Novel channel-hopping schemes for cognitive radio networks | |
| JP5107691B2 (en) | Frame dynamic scheduling procedure with subchannel identifier permutation | |
| CN106332094A (en) | Q algorithm-based dynamic duty ratio coexistence method for LTE-U and Wi-Fi systems in unauthorized frequency band | |
| KR20080000659A (en) | Frequency hopping design for ifdma, lfdma and ofdma systems | |
| CN109714140A (en) | The method and apparatus for determining control channel search space | |
| CN109905217B (en) | Reference signal transmission method and device | |
| Romaszko | A rendezvous protocol with the heterogeneous spectrum availability analysis for cognitive radio ad hoc networks | |
| KR101942900B1 (en) | Rendezvous Method of Unauthorized Users with Multiple Transceivers in a Cognitive Wireless Network | |
| JP2023099053A (en) | mobile station | |
| Jiao et al. | Optimizing channel selection for cognitive radio networks using a distributed Bayesian learning automata-based approach | |
| CN106559181B (en) | Method for configurating channel state information reference signals | |
| JP6185652B2 (en) | Device and method for discovery channel hopping | |
| CN106685550B (en) | Completely distributed encountering method for unauthorized users in cognitive radio network | |
| KR101147611B1 (en) | Distributed Dynamic Spectrum Access Method for Avoidance of Co-Channel Interference in Mobile Cellular Networks And Frequency Allocation System in Mobile Cellular Networks Using the Same | |
| Chao et al. | A fast and fair rendezvous guarantee channel hopping protocol for cognitive radio networks | |
| Romaszko et al. | Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks | |
| Cheon et al. | Rendezvous for self-organizing MANET with multiple radio | |
| Montejo-Sánchez et al. | Novel channel hopping sequence approaches to rendezvous for VANETs | |
| Xue et al. | K-Group Random Channel Hopping (K-RCH) Rendezvous for Cognitive Radio Networks | |
| KR20150115215A (en) | Dynamic slot rendezvous method for ad-hoc network using multi-channel | |
| Wu et al. | Channel-Grouping based rendezvous algorithm for cognitive radio adhoc networks | |
| Kim et al. | A repeated group sequence rendezvous scheme for cognitive radio networks | |
| CN103945551B (en) | Signal channel distribution method and system for wireless mesh network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |