CN106027118A - Channel intersection method and system for cognitive radio network - Google Patents
Channel intersection method and system for cognitive radio network Download PDFInfo
- Publication number
- CN106027118A CN106027118A CN201610532791.1A CN201610532791A CN106027118A CN 106027118 A CN106027118 A CN 106027118A CN 201610532791 A CN201610532791 A CN 201610532791A CN 106027118 A CN106027118 A CN 106027118A
- Authority
- CN
- China
- Prior art keywords
- channel
- crosses
- user
- time slot
- sequence
- 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
-
- 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
The invention discloses a channel intersection method for a cognitive radio network. The method comprises the following steps: generating intersection time slot channel sequences corresponding to various users in the cognitive radio network through the same channel hopping (CH) algorithm, and respectively and independently enabling channel passages of the users in different periods; when channels of two of the users intersect, generating new time slot channel sequences respectively corresponding to the two users through the least recently accessed channel algorithm, and using the new time slot channel sequences as the intersection time slot channel sequences; and carrying out intersection through the intersection time slot channel sequences corresponding to the users. The method provided by the invention has the advantages that the intersection time of the users can be shortened, so that CH intersection speed is accelerated. The invention further provides a channel intersection system for the cognitive radio network, through which the intersection time of the users can be shortened, so that the CH intersection speed is further accelerated.
Description
Technical field
The present invention relates to channel cross technical field, particularly relate to a kind of cognition wireless network
Channel crosses method and system.
Background technology
At present, due to exponential increase and the fixed frequency spectrum allocation rule of various wireless devices, some
Frequency spectrum is the most overstaffed, and most spectrum is not utilized or utilization rate is the highest.In order to alleviate frequency
The uneven utilization of spectrum resource, there has been proposed cognitive radio technology, enables secondary user
Effectively utilize rare and valuable frequency spectrum resource.
In cognitive radio networks (cognitive radio networks, CRNS), two grades
User may not know existence each other in advance, therefore, before their exchange information, they
Existence each other can be detected to set up communication link.It is two of secondary user or more that channel crosses
Many radio intersect and set up the basic process of a link in common channels, wherein,
Channel hopping (Channel Hopping, CH) is blind one of the most representational technology that crosses.
Utilizing CH technology, each secondary user of CRN selects the frequency hopping sequence in one group of channel and channel
Row cross with potential neighbours.
Crossing in method at existing channel, each user uses same hop algorithm independently
Generate respective Channel Hopping Sequence, when they are present in identical frequency hopping on certain time slot
Can directly communicate time on channel, and, after two users cross, they will be under connecing
Frequency hop sequences each other is exchanged, then by themselves mode frequency hopping in the several time slots come.
Such as, as it is shown in figure 1, there are three user u1, u2, u3, these three user has 6 to commonly use
Channel, works as u2And u3After channel 4 time slot 1 crosses for the first time, they can continue frequency hopping and (jump
Cross channel 3 time slot 3 and channel 5 time slot 4) until u1And u2Cross at channel 4 time slot 9,
Now, due to u1Pass through u2U can be obtained3The channel of next time slot (time slot 10), u1Can
To be switched to u at time slot 103Channel, therefore, cross the time (TTR) of these three user
It is 11 time slots；Thus it is apparent that such frequency hopping extends when crossing of all users
Between, have impact on the speed that crosses of channel hopping.Therefore, how to shorten crossing the time of user,
And then the speed that crosses of raising channel hopping, it is that those skilled in the art need the technology solved to ask
Topic.
Summary of the invention
In view of this, the invention provides the channel of a kind of cognition wireless network to cross method and be
System, to realize shortening crossing the time of user, and then improves the mesh of the speed that crosses of channel hopping
's.
For solving above-mentioned technical problem, the present invention provides the channel of a kind of cognition wireless network to cross
Method, including:
Same CH algorithm is utilized to generate the time slot letter that crosses that each user in cognition wireless network is corresponding
Road sequence, and the channel passage of user is independently started in the different time periods；
When there are two subscriber channels and crossing, recent minimum channel access algorithm is utilized to generate two
The each self-corresponding new non-slotted channel sequence of individual user, and using new non-slotted channel sequence as friendship
Remittance non-slotted channel sequence；
The non-slotted channel sequence that crosses utilizing each user corresponding crosses.
Wherein, when there are two subscriber channels and crossing, recent minimum channel access algorithm is utilized
Generate two each self-corresponding new non-slotted channel sequences of user, and by new non-slotted channel sequence
As the non-slotted channel sequence that crosses, including:
Determine the value of a message length；
When there are two subscriber channels and crossing, recent minimum channel access algorithm is utilized to generate two
The new non-slotted channel sequence of each self-corresponding message length of individual user, and by new time slot
Channel sequence is as the non-slotted channel sequence that crosses.
Wherein, recent minimum channel access algorithm is utilized to generate each self-corresponding one of two users
The new non-slotted channel sequence of message length, including:
Relatively there is the non-slotted channel sequence that crosses of two users that channel crosses, determine described two
The time slot that crosses that individual user will cross at same channel in a message length；
Determine said two user has the many users of available channel as targeted customer；
Add up the access times of each available and nonoverlapping channel of described targeted customer, and select
Select the access times minimum channel access channel as the described time slot that crosses.
Use wherein it is determined that said two user has the many users of available channel as target
Family, including:
The quantity of the available channel of statistics said two user respectively；
Choose the big user of described quantity as targeted customer；
If the quantity of the available channel of said two user is consistent, then randomly selects a user and make
For targeted customer.
Wherein, select the minimum channel of access times as the access channel of the described time slot that crosses,
Including:
Select the minimum channel of access times as the access channel of the described time slot that crosses；
If the access times that there is multiple channel are minimum, then from multiple channels that access times are minimum
In randomly select the channel access channel as the described time slot that crosses.
The present invention also provides for the channel of a kind of cognition wireless network and crosses system, including:
CH algoritic module, is used for utilizing same CH algorithm to generate each user in cognition wireless network
The corresponding non-slotted channel sequence that crosses, and the letter of user is independently started in the different time periods
Road passage；
Minimum channel access algorithm module in the recent period, is used for when there are two subscriber channels and crossing,
Recent minimum channel access algorithm is utilized to generate two each self-corresponding new non-slotted channel sequences of user
Row, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；
Cross module, crosses for the non-slotted channel sequence that crosses utilizing each user corresponding.
Wherein, described recent minimum channel access algorithm module, including:
Message length determines unit, for determining the value of a message length；
Minimum channel access algorithm unit in the recent period, is used for when there are two subscriber channels and crossing,
Recent minimum channel access algorithm is utilized to generate two each self-corresponding message lengths of user
New non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses.
Wherein, described recent minimum channel access algorithm unit, including:
Cross time slot subelement, for comparing the time slot that crosses that there are two users that channel crosses
Channel sequence, determines that said two user will cross at same channel in a message length
The time slot that crosses；
Targeted customer's subelement, for determining have the use that available channel is many in said two user
Family is as targeted customer；
Channel variation subelement, for adding up each available and nonoverlapping of described targeted customer
The access times of channel, and select the minimum channel of access times as the visit of the described time slot that crosses
Ask channel.
Wherein, described targeted customer's subelement can specifically for add up said two user respectively
By the quantity of channel；Choose the big user of described quantity as targeted customer；If said two is used
The quantity of the available channel at family is consistent, then randomly select a user single as the son of targeted customer
Unit.
Wherein, described channel variation subelement is made specifically for the channel selecting access times minimum
Access channel for the described time slot that crosses；If the access times that there is multiple channel are minimum, then from
Multiple channels that access times are minimum randomly select the visit as the described time slot that crosses of the channel
Ask channel.
The channel of a kind of cognition wireless network that the above present invention provides crosses method, including: profit
The non-slotted channel sequence that crosses that in cognition wireless network, each user is corresponding is generated with same CH algorithm
Row, and the channel passage of user is independently started in the different time periods；When there are two use
When family channel crosses, recent minimum channel access algorithm is utilized to generate two users each self-corresponding
New non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；
The non-slotted channel sequence that crosses utilizing each user corresponding crosses；
Visible, the method utilizes recent minimum channel access algorithm to change the user crossed
The non-slotted channel sequence that crosses, prevent them from again crossing, enter with other channel improving them
The speed that row crosses, and then crossing the time of user can be shortened, thus improve channel hopping
Cross speed；Present invention also offers the channel of a kind of cognition wireless network to cross system, have
Above-mentioned beneficial effect, does not repeats them here.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below
The accompanying drawing used required in embodiment or description of the prior art will be briefly described, aobvious and
Easily insight, the accompanying drawing in describing below is only embodiments of the invention, common for this area
From the point of view of technical staff, on the premise of not paying creative work, it is also possible to attached according to provide
Figure obtains other accompanying drawing.
Fig. 1 crosses for the channel that prior art provides the schematic diagram of process；
The channel of the cognition wireless network that Fig. 2 provides for the embodiment of the present invention crosses the flow process of method
Figure；
After the improvement that Fig. 3 provides for the embodiment of the present invention, channel crosses the schematic diagram of process；
After under the symmetric case that Fig. 4 provides for the embodiment of the present invention, L=20 improves, channel crossed
The lab diagram of journey；
After under the symmetric case that Fig. 5 provides for the embodiment of the present invention, N=10 improves, channel crossed
The lab diagram of journey；
After under the asymmetric case that Fig. 6 provides for the embodiment of the present invention, L=20 improves, channel crosses
The lab diagram of process；
After under the asymmetric case that Fig. 7 provides for the embodiment of the present invention, N=10 improves, channel crosses
The lab diagram of process；
The channel of the cognition wireless network that Fig. 8 provides for the embodiment of the present invention crosses the structure of system
Block diagram representation.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, to the technical side in the embodiment of the present invention
Case is clearly and completely described, it is clear that described embodiment is only the present invention one
Divide embodiment rather than whole embodiments.Based on the embodiment in the present invention, this area is general
The every other embodiment that logical technical staff is obtained under not making creative work premise,
Broadly fall into the scope of protection of the invention.
The core of the present invention is to provide the channel of a kind of cognition wireless network and crosses method and system,
To realize shortening crossing the time of user, and then improve the purpose of the speed that crosses of channel hopping.
In order to make those skilled in the art be more fully understood that the present invention program, below in conjunction with the accompanying drawings
The present invention is described in further detail with detailed description of the invention.
Setting a CRN to be made up of N (N >=2) individual secondary user, they can be with set
N={u1..., uNRepresent.Assuming that system is to have time slot and all of time slot all to have
Identical and fixing length.Licensed spectrum is divided into the letter that M (M >=1) is non-overlapped
Road is by M={c1..., cMRepresent.Assume all secondary user's in network know all this
Channels, and each user a bit are equipped with a single cognitive radio.In view of frequency spectrum
Heterogeneity, setsExpression group uIAvailable channel.
If user i and user j jumps onto the same channel of same time slot, then they just cross
?.Accelerating algorithm is to have gathered the user crossed, and each user is wireless whole as one
Body.Therefore, they can attempt crossing into one group with other users.Its operation principle such as Fig. 2
Shown in: the letter of cognition wireless network that the embodiment of the present invention provides is shown with reference to Fig. 2, Fig. 2
Road crosses the flow chart of method, and the method specifically may include steps of:
S100, same CH algorithm is utilized to generate corresponding the crossing of each user in cognition wireless network
Non-slotted channel sequence, and the channel passage of user is independently started in the different time periods；
Wherein, the purpose of this step is that all users use identical CH algorithm to generate them
The non-slotted channel sequence that crosses, the such as user u shown in Fig. 11, u2, u3Each 16
The channel that in time slot, each time slot is corresponding, forms the non-slotted channel sequence that crosses；Each user
From different time period independent startup passages.The such as user u shown in Fig. 11, u2, u3?
Three different time periods independently start the channel passage of user.
S110, when exist two subscriber channels cross time, utilize recent minimum channel access algorithm
Generate two each self-corresponding new non-slotted channel sequences of user, and by new non-slotted channel sequence
As the non-slotted channel sequence that crosses；
Wherein, the non-slotted channel sequence that crosses that each user utilizes CH algorithm to generate communicates,
If there are two users under same time slot when same channel, then the two user crosses.
Can share frequency-hopping sequences information each other due to them after crossing in ensuing time slot, i.e. this
Two follow-up being no longer necessary to of user cross；Therefore, each in order to shorten in cognition wireless network
User crosses the time, i.e. to prevent the user crossed from again crossing；Therefore should
Method uses recent minimum channel access algorithm to generate two each self-corresponding new time slot letters of user
Road sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses.So each letter
Road is when crossing, and being not all of is all the acquiescence frequency hop sequences with being generated by CH algorithm
Trial crosses.
Step S110 detailed process may is that
Determine the value of a message length；
When there are two subscriber channels and crossing, recent minimum channel access algorithm is utilized to generate two
The new non-slotted channel sequence of each self-corresponding message length of individual user, and by new time slot
Channel sequence is as the non-slotted channel sequence that crosses.
Wherein, it is not necessary to channel corresponding for follow-up whole time slots of the user that crosses is carried out accordingly
Amendment, it is only necessary to modify in a message length；Here message length
Value can be set as whole user and carries out the length used that crosses.
I.e. when any two users cross, they will share jumping each other from ensuing time slot
Frequency sequence information.Defining a message length is L, and then they use recent minimum channel to visit
Ask that algorithm generates the ensuing new non-slotted channel sequence of L, and in this time slot notification contact side
Method i.e. crosses the change of non-slotted channel sequence.
Wherein, recent minimum channel access algorithm is utilized to generate each self-corresponding one of two users
The new non-slotted channel sequence of message length, including:
Relatively there is the non-slotted channel sequence that crosses of two users that channel crosses, determine described two
The time slot that crosses that individual user will cross at same channel in a message length；
Determine said two user has the many users of available channel as targeted customer；
Add up the access times of each available and nonoverlapping channel of described targeted customer, and select
Select the access times minimum channel access channel as the described time slot that crosses.
Wherein, if the quantity of the available channel of said two user is consistent, then one is randomly selected
User is as targeted customer；If the access times that there is multiple channel are minimum, then from access times
Minimum multiple channels randomly select the channel access channel as the described time slot that crosses.
I.e. when crossing in certain time slot in any two user, they will be at next time slot
In share hopping sequence information.Use recent minimum channel access algorithm, repeat to cross to reduce
Accelerate and the crossing of other users.In this algorithm, only changing user will be again
The channel of these time slots crossed.Basic demand be in these time slots they will not frequency hopping to
On one channel.Its operation principle can be such that
Relatively two non-slotted channel sequences that cross, finding out two users will cross at same channel
Time slot；
The user having more available channel can be chosen to change its sequence, and this will make sequence more
Add flexibly.Just can be selected at random if they have the available channel of equal number.
Access channel is readjusted in the time slot that these are selected.Specific practice is to treat with a certain
Adjusting time slot, calculate before this time slot in L time slot, each of this user can use and the most overlapping letter
The access times in road, the channel that then selection access times are minimum is as the access channel of this time slot.
If it is minimum to there is multiple channel access number of times, then randomly choose one of them channel.
S120, the non-slotted channel sequence that crosses utilizing each user corresponding cross.
Wherein, when new sequence is done, each user uses by each self-corresponding acquiescence
Frequency hop sequences is attempted crossing.
Refer to by a simply example, the principle of algorithm be described below Fig. 1 and Fig. 3 and add
The process that speed crosses:
As it is shown in figure 1, there are three user u1, u2, u3, these three user has 6 conventional letters
Road, works as u2And u3After channel 4 time slot 1 crosses for the first time, they can continue frequency hopping and (skip
Channel 3 time slot 3 and channel 5 time slot 4) until u1And u2Cross at channel 4 time slot 9, this
Time, due to u1Pass through u2U can be obtained3The channel of next time slot (time slot 10), u1Permissible
It is switched to u at time slot 103Channel, therefore, cross the time (TTR) of these three user is
11 time slots；
Use the present embodiment method i.e. accelerate in the case of, once u2And u3When channel 4
After gap 1 crosses for the first time, they will change its frequency hop sequences, to ensure that they will not be any
A period of time frequency hopping of time slot is on same channel.Such as, u2Change time slot 3, time slot 4
With the channel sequence of time slot 5, then, work as u1And u2Meet at channel 2 time slot 4 to cross, by
In u1Pass through u2U can be obtained3The channel of next time slot (time slot 5), u1Can be at time slot
5 are switched to u3Time that crosses of channel all of which be reduced to 6 from 11.
Can utilize the simulator that C++ writes to assess the performance of said method, in described simulation
Device selects symmetrical and asymmetrical in the case of all effective random algorithm generate as sequence and to calculate
Method.Experimental result refer to Fig. 4 to Fig. 7；
Wherein, Fig. 4 is under symmetric case, total time and the quantity (L=20) of user, i.e. exists
Under symmetric case, the time crossed increases along with the increase of the user of L=20, and owns
User has 6 channels the most available.But, recent minimum channel access algorithm is significantly
Reduce the time needed that crosses.Fig. 5 is under symmetric case, time ratio and the Chief Information Officer that crosses
Degree (N=10), the most in the symmetric case, random algorithm and recent minimum channel access algorithm
Between time of crossing lower than being.And when L is the least when, ratio along with L increase and
Reducing, when L arrives a definite value, ratio also can obtain a dynamic stability value.
Fig. 6 is under asymmetric case, and total time and the quantity (L=20) of number of users, i.e. non-
Under symmetric case, the time crossed increases along with the increase of the user of L=20, and owns
User has at least 3 channels the most available.But, recent minimum channel access algorithm
Greatly reduce the time needed that crosses.Fig. 7 is under asymmetric case, time ratio with cross
Message length (N=10), i.e. in the case of asymmetrical, random algorithm and recent minimum channel
The time crossed between access algorithm is lower than being.And when L is the least when, ratio is along with L
Increase and reduce, when L arrive a definite value time, ratio also can obtain a dynamic stability value.
Based on technique scheme, the channel of the cognition wireless network that the embodiment of the present invention carries crosses
Method, utilizes recent minimum channel access algorithm to change the time slot that crosses of the user crossed
Channel sequence, prevents them from again crossing, to improve the speed that they and other channel carry out crossing
Degree, and then crossing the time of user can be shortened, thus improve the speed that crosses of channel hopping；
The channel of cognition wireless network provided based on the invention described above embodiment crosses method, this
Inventive embodiments additionally provides the channel of a kind of cognition wireless network and crosses system, can be the most right
Should refer to reference to Fig. 8, this system can include following content:
CH algoritic module 100, is used for utilizing same CH algorithm to generate in cognition wireless network each
Non-slotted channel sequence that what user was corresponding cross, and independently start user in the different time periods
Channel passage；
Minimum channel access algorithm module 200 in the recent period, for crossing when two subscriber channels of existence
Time, utilize recent minimum channel access algorithm to generate two each self-corresponding new time slot letters of user
Road sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；
Cross module 300, hands over for the non-slotted channel sequence that crosses utilizing each user corresponding
Converge.
Optionally, described recent minimum channel access algorithm module 200, including:
Message length determines unit, for determining the value of a message length；
Minimum channel access algorithm unit in the recent period, is used for when there are two subscriber channels and crossing,
Recent minimum channel access algorithm is utilized to generate two each self-corresponding message lengths of user
New non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses.
Optionally, described recent minimum channel access algorithm unit, including:
Cross time slot subelement, for comparing the time slot that crosses that there are two users that channel crosses
Channel sequence, determines that said two user will cross at same channel in a message length
The time slot that crosses；
Targeted customer's subelement, for determining have the use that available channel is many in said two user
Family is as targeted customer；
Channel variation subelement, for adding up each available and nonoverlapping of described targeted customer
The access times of channel, and select the minimum channel of access times as the visit of the described time slot that crosses
Ask channel.
Optionally, described targeted customer's subelement is specifically for adding up said two user's respectively
The quantity of available channel；Choose the big user of described quantity as targeted customer；If said two
The quantity of the available channel of user is consistent, then randomly select the user son as targeted customer
Unit.
Optionally, described channel variation subelement is specifically for selecting the minimum channel of access times
Access channel as the described time slot that crosses；If the access times that there is multiple channel are minimum, then
A channel is randomly selected as the described time slot that crosses from multiple channels that access times are minimum
Access channel.
It should be noted that each embodiment in this specification all uses the mode gone forward one by one to retouch
Stating, what each embodiment stressed is the difference with other embodiments, and each is implemented
Between example, identical similar part sees mutually.For system class embodiment, due to
It is with embodiment of the method basic simlarity, so describing fairly simple, relevant part sees method
The part of embodiment illustrates.
Channel to the cognition wireless network provided by the present invention method and system that cross are entered above
Go and be discussed in detail.Principle and the embodiment of the present invention are entered by specific case used herein
Having gone elaboration, the explanation of above example is only intended to help to understand method and the core thereof of the present invention
Thought is thought.It should be pointed out that, for those skilled in the art, without departing from
On the premise of the principle of the invention, it is also possible to the present invention is carried out some improvement and modification, these change
Enter and modify in the protection domain also falling into the claims in the present invention.
Claims (10)
1. the channel of a cognition wireless network crosses method, it is characterised in that including:
Same CH algorithm is utilized to generate the time slot letter that crosses that each user in cognition wireless network is corresponding
Road sequence, and the channel passage of user is independently started in the different time periods；
When there are two subscriber channels and crossing, recent minimum channel access algorithm is utilized to generate two
The each self-corresponding new non-slotted channel sequence of individual user, and using new non-slotted channel sequence as friendship
Remittance non-slotted channel sequence；
The non-slotted channel sequence that crosses utilizing each user corresponding crosses.
The channel of cognition wireless network the most according to claim 1 crosses method, and it is special
Levy and be, when there are two subscriber channels and crossing, utilize recent minimum channel access algorithm raw
Become two each self-corresponding new non-slotted channel sequences of user, and new non-slotted channel sequence is made
For the non-slotted channel sequence that crosses, including:
Determine the value of a message length；
When there are two subscriber channels and crossing, recent minimum channel access algorithm is utilized to generate two
The new non-slotted channel sequence of each self-corresponding message length of individual user, and by new time slot
Channel sequence is as the non-slotted channel sequence that crosses.
The channel of cognition wireless network the most according to claim 2 crosses method, and it is special
Levy and be, utilize recent minimum channel access algorithm to generate two each self-corresponding letters of user
The new non-slotted channel sequence of breath length, including:
Relatively there is the non-slotted channel sequence that crosses of two users that channel crosses, determine described two
The time slot that crosses that individual user will cross at same channel in a message length；
Determine said two user has the many users of available channel as targeted customer；
Add up the access times of each available and nonoverlapping channel of described targeted customer, and select
Select the access times minimum channel access channel as the described time slot that crosses.
The channel of cognition wireless network the most according to claim 3 crosses method, and it is special
Levy and be, determine said two user has the many users of available channel as targeted customer,
Including:
The quantity of the available channel of statistics said two user respectively；
Choose the big user of described quantity as targeted customer；
If the quantity of the available channel of said two user is consistent, then randomly selects a user and make
For targeted customer.
The channel of cognition wireless network the most according to claim 3 crosses method, and it is special
Levy and be, select the minimum channel of access times as the access channel of the described time slot that crosses, bag
Include:
Select the minimum channel of access times as the access channel of the described time slot that crosses；
If the access times that there is multiple channel are minimum, then from multiple channels that access times are minimum
In randomly select the channel access channel as the described time slot that crosses.
6. the channel of a cognition wireless network crosses system, it is characterised in that including:
CH algoritic module, is used for utilizing same CH algorithm to generate each user in cognition wireless network
The corresponding non-slotted channel sequence that crosses, and the letter of user is independently started in the different time periods
Road passage；
Minimum channel access algorithm module in the recent period, is used for when there are two subscriber channels and crossing,
Recent minimum channel access algorithm is utilized to generate two each self-corresponding new non-slotted channel sequences of user
Row, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses；
Cross module, crosses for the non-slotted channel sequence that crosses utilizing each user corresponding.
The channel of cognition wireless network the most according to claim 6 crosses system, and it is special
Levy and be, described recent minimum channel access algorithm module, including:
Message length determines unit, for determining the value of a message length；
Minimum channel access algorithm unit in the recent period, is used for when there are two subscriber channels and crossing,
Recent minimum channel access algorithm is utilized to generate two each self-corresponding message lengths of user
New non-slotted channel sequence, and using new non-slotted channel sequence as the non-slotted channel sequence that crosses.
The channel of cognition wireless network the most according to claim 7 crosses system, and it is special
Levy and be, described recent minimum channel access algorithm unit, including:
Cross time slot subelement, for comparing the time slot that crosses that there are two users that channel crosses
Channel sequence, determines that said two user will cross at same channel in a message length
The time slot that crosses；
Targeted customer's subelement, for determining have the use that available channel is many in said two user
Family is as targeted customer；
Channel variation subelement, for adding up each available and nonoverlapping of described targeted customer
The access times of channel, and select the minimum channel of access times as the visit of the described time slot that crosses
Ask channel.
The channel of cognition wireless network the most according to claim 8 crosses system, and it is special
Levying and be, described targeted customer's subelement is specifically for adding up the available of said two user respectively
The quantity of channel；Choose the big user of described quantity as targeted customer；If said two user
The quantity of available channel consistent, then randomly select the user subelement as targeted customer.
The channel of cognition wireless network the most according to claim 8 crosses method, and it is special
Levying and be, described channel variation subelement is specifically for selecting the minimum channel conduct of access times
The access channel of the described time slot that crosses；If the access times that there is multiple channel are minimum, then from visit
Ask and multiple channels of least number of times randomly select the access as the described time slot that crosses of the channel
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 true CN106027118A (en) | 2016-10-12 |
| CN106027118B 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) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106604321A (en) * | 2016-12-23 | 2017-04-26 | 西安电子科技大学 | Adjustable channel intersection method based on finite cover in cognitive wireless network |
| CN107708121A (en) * | 2017-08-31 | 2018-02-16 | 南京理工大学 | A kind of optimal cognitive radio networks channel crosses the building method of sequence |
| CN108040340A (en) * | 2017-12-21 | 2018-05-15 | 苏州大学 | Wireless self-organization network assemblage method, device, system and storage medium |
| WO2018126349A1 (en) * | 2017-01-04 | 2018-07-12 | 河海大学常州校区 | Multi-transceiver unauthorized user encountering method in cognitive radio network |
| CN109302707A (en) * | 2018-12-05 | 2019-02-01 | 南京理工大学 | A kind of cognitive radio of optimum stabilization crosses sequence constructing method |
| CN113572519A (en) * | 2021-08-12 | 2021-10-29 | 天津(滨海)人工智能军民融合创新中心 | Unmanned aerial vehicle swarm cognitive networking channel intersection method based on hierarchical network architecture |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223191A (en) * | 2011-06-02 | 2011-10-19 | 电信科学技术研究院 | Method and equipment for acquiring idle spectrum |
| CN104202813A (en) * | 2014-09-12 | 2014-12-10 | 中国人民解放军国防科学技术大学 | Cognitive radio network clock synchronization method based on double control channel mechanism |
| US9252929B2 (en) * | 2013-09-25 | 2016-02-02 | Hong Kong Baptist University | Method for achieving rendezvous for cognitive radio networks |
-
2016
- 2016-07-07 CN CN201610532791.1A patent/CN106027118B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223191A (en) * | 2011-06-02 | 2011-10-19 | 电信科学技术研究院 | 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 |
| CN104202813A (en) * | 2014-09-12 | 2014-12-10 | 中国人民解放军国防科学技术大学 | Cognitive radio network clock synchronization method based on double control channel mechanism |
Non-Patent Citations (2)
| Title |
|---|
| 孔得凯: "认知无线电网络控制信道交会算法研究", 《中国优秀硕士学位论文全文数据库 》 * |
| 孔得凯等: "认知无线电网络中基于信道跳频序列的异步交汇算法研究", 《计算机工程与科学》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106604321A (en) * | 2016-12-23 | 2017-04-26 | 西安电子科技大学 | Adjustable channel intersection method based on finite cover in cognitive wireless network |
| CN106604321B (en) * | 2016-12-23 | 2020-12-04 | 西安电子科技大学 | Adjustable channel rendezvous method based on limited coverage in cognitive radio network |
| WO2018126349A1 (en) * | 2017-01-04 | 2018-07-12 | 河海大学常州校区 | Multi-transceiver unauthorized user encountering method in cognitive radio network |
| JP2019511140A (en) * | 2017-01-04 | 2019-04-18 | 河海大学常州校区Ｈｏｈａｉ Ｕｎｉｖｅｒｓｉｔｙ， Ｃｈａｎｇｚｈｏｕ ｃａｍｐｕｓ | Rendezvous method of multi-transceiver unlicensed user of cognitive radio network |
| US10461803B1 (en) | 2017-01-04 | 2019-10-29 | Hohai University, Changzhou Campus | Method for rendezvous of unlicensed users having multiple transceivers in cognitive radio networks |
| CN107708121A (en) * | 2017-08-31 | 2018-02-16 | 南京理工大学 | A kind of optimal cognitive radio networks channel crosses the building method of sequence |
| CN108040340A (en) * | 2017-12-21 | 2018-05-15 | 苏州大学 | Wireless self-organization network assemblage method, device, system and storage medium |
| CN108040340B (en) * | 2017-12-21 | 2021-03-26 | 苏州大学 | Wireless self-organizing network convergence method, device, system and storage medium |
| CN109302707A (en) * | 2018-12-05 | 2019-02-01 | 南京理工大学 | A kind of cognitive radio of optimum stabilization crosses sequence constructing method |
| CN109302707B (en) * | 2018-12-05 | 2022-11-22 | 南京理工大学 | Optimal stability cognitive radio intersection sequence construction method |
| CN113572519A (en) * | 2021-08-12 | 2021-10-29 | 天津(滨海)人工智能军民融合创新中心 | Unmanned aerial vehicle swarm cognitive networking channel intersection method based on hierarchical network architecture |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106027118B (en) | 2018-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106027118A (en) | Channel intersection method and system for cognitive radio network | |
| US11246135B2 (en) | Resource selection method and apparatus under multiple carriers, computer device, and storage medium | |
| CN103929492B (en) | Business chain load-balancing method and its device, system | |
| CN102083138B (en) | A kind of D2D user to can the multiple phone user's resources of concurrent multiplexing method | |
| WO2002021773A3 (en) | Guaranteed bandwidth sharing in a traffic shaping system | |
| CN102546435B (en) | A kind of frequency spectrum resource allocation method and device | |
| CN107734665A (en) | Resource instruction, determine method and device, network side equipment and mobile communication terminal | |
| ATE428159T1 (en) | METHOD FOR EQUALIZING TRAFFIC FLOWS AS WELL AS AVOIDING AND DISSOLVING CONGESTIONS | |
| KR101942900B1 (en) | Rendezvous Method of Unauthorized Users with Multiple Transceivers in a Cognitive Wireless Network | |
| TW201720212A (en) | Method and transmitter of implementing multiple-carrier listen-before-talk | |
| CN108551585A (en) | A kind of barrage method of calibration, device, server and medium | |
| CN103634846B (en) | By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network | |
| CN108123973A (en) | A kind of jamming control method, central site network, terminal and system | |
| CN105357599B (en) | A kind of method and device of resource allocation | |
| Ghosh et al. | Quality sensitive price competition in spectrum oligopoly | |
| CN105898871B (en) | A kind of resource allocation methods of multi-hop multifrequency point Wireless Mesh network | |
| CN103596181A (en) | Frequency spectrum resource distribution method based on topology control in cognitive radio network | |
| CN107690127A (en) | A kind of determination method and device of the communication resource | |
| CN107306203A (en) | A kind of method and device of the scheduling of resource based on virtual network | |
| CN106685550B (en) | Completely distributed encountering method for unauthorized users in cognitive radio network | |
| Ezell et al. | I/O router placement and fine-grained routing on Titan to support Spider II | |
| CN109803411A (en) | Method for mapping resource determines method, network side equipment and user terminal | |
| CN111770473B (en) | Unlicensed spectrum access and carrier aggregation method and device for cellular internet of vehicles | |
| CN104333875B (en) | A kind of frequency method of adjustment and device | |
| CN109803380A (en) | Resource allocation methods and communication base station |
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 |