CN107623533B - A kind of cognitive radio networks fairness channel hopping method under dynamic environment - Google Patents
A kind of cognitive radio networks fairness channel hopping method under dynamic environment Download PDFInfo
- Publication number
- CN107623533B CN107623533B CN201710749767.8A CN201710749767A CN107623533B CN 107623533 B CN107623533 B CN 107623533B CN 201710749767 A CN201710749767 A CN 201710749767A CN 107623533 B CN107623533 B CN 107623533B
- Authority
- CN
- China
- Prior art keywords
- channel
- fch
- state
- exploitable
- user
- 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
Abstract
The invention belongs to cognitive radio networks technical fields, disclose a kind of cognitive radio networks fairness channel hopping method under dynamic environment, fairness channel hopping method FCH_A algorithm under the dynamic environment obtains the number for utilizing Jenkins hash function that ID Hash is not more than to n for one after the id information of user using the id information of channel intersection user；FCH_S generates the step-length of channel search using Joseph ring；The dynamic model of channel, the fairness of guarantee agreement are constructed using Markov process.The present invention has carried out analogue simulation to the fairness of FCH_S and FCH_A and intersection time, in algorithm all channels be selected as intersecting channel probability it is equal, hence it is evident that be better than existing algorithm.
Description
Technical field
The invention belongs to the cognition radios under cognitive radio networks technical field more particularly to a kind of dynamic environment
Network fairness channel hopping method.
Background technique
With popularizing for wireless device, the increasingly increase of wireless device quantity leads to unauthorized user frequency spectrum resource not
Foot, therefore a series of problems such as congestion, delay, reliability be low occur therewith.The frequency spectrum resource of authorized user is not at the same time
Some is to fully utilizing.In order to solve this problem, Federal Communications Commission proposes cognitive radio technology, uses
Dynamic spectrum access.Cognition wireless network (CRN) is made of the primary user (PU) authorized and unauthorized secondary user's (SU), core
Thought wants that primary user (PU) frequency spectrum resource that would sit idle for reasonably is distributed to secondary user's (SU), solves one in secondary network
Series of problems.In cognition wireless network (CRN), each secondary user's (SU) are equipped with one or more wireless device transmitters
Come perceived spectral cavity.When secondary user's (SU) communication, it is necessary first to which then perceived spectral positions neighbor node on frequency spectrum
Establish communication link；The process that two users meet on the same channel, which is referred to as, to be intersected.It is secondary in cognition wireless network to use
The utilizability of family channel is with time and spatial variations, and in a distributed system, user does not have other users'
Channel state information.Networks different at present provide channel Intersection Arithmetic, use the preferably at most controllable common channel of utilization
(CCC) and multichannel frequency hopping (CH).When there is fixed common channel (CCC) in network, (one always by primary user
(PU) frequency spectrum cavity-pocket of user occupancy) when, sender and recipient hold consultation on common channel (CCC), then look for one
A common channel establishes link.When the channel of selection is occupied by primary user (PU) or signal interference is excessive, sender
Common channel (CCC) can be returned with recipient to renegotiate, and re-establish link and then continue to transmit information.When existing in network
When this more satisfactory channel, the channel appointment algorithm based on common channel (CCC) is a relative efficiency and easily controllable
Method, but this method is since there is also saturation problem and congestions to attack problem for single control channel, and in cognition nothing
In gauze network, since each secondary user's of environment of dynamic spectrum perception require to be intersected on a different channel, one is obtained
A stable common channel is nearly impossible.When the common channel (CCC) in network be interfered or network in do not deposit
At common channel (CCC), multichannel frequency hopping (CH) technology can overcome the problems, such as some of common channel (CCC).CH is calculated
Method is that each secondary user's (SU) user scans for according to a special channel frequency-hopping sequences, in secondary user's (SU) can
Using multichannel frequency hopping (CH) sequence is utilized in channel, constantly frequency hopping is searched for until realizing that channel intersects.Presently, there are
A large amount of channel hopping algorithm can be approximately through following two factor classification: time synchronization and asynchronous, synchronous algorithm
Refer to that user starts simultaneously at channel search, however the user in distributed cognition wireless network (CRN) is required to start simultaneously at channel
Search is not-so-practical.Therefore it is more likely to assume that network is that asynchronous model is heterogeneous and homogeneity, it is false in homogeneous model
If the frequency spectrum perception ability of each user is the perception radius identical and having the same.Homogeneous model include again it is symmetrical and
Asymmetric Model, symmetry model refer to that the utilizable channel of all users is the same, otherwise are Asymmetric Models.However it is different
User in matter model has different sensing capability and the perception radius, therefore is more biased towards in assuming that network is heterogeneous.Recognizing
Know in wireless network (CRN), each secondary user's (SU) can monitor the current availability of the channel near itself.Due to master
User's (PU) dynamically accessing and exiting, and the exploitable channel of secondary user's (SU) has following feature (1) spatial diversity, no
SUs with geographical location may have different exploitable channels.(2) time difference, the channel of secondary user's (SU) it is available
Property may change with the variation of time.Presently, there are cognition wireless network channel intersection document in, it is assumed that user
It is fixed in the state of frequency spectrum perception stage enough exploitable channel.But in practice, authorize frequency spectrum using shape
State is the activity dynamic change with authorized user.Such as primary user primary user can optionally exchange in television channel,
Corresponding different authorization channel is withdrawn in TV channel.Since primary user (PU) user has higher priority, if primary
Family (PU) requires to utilize authorization channel, and secondary user's (SU) user needs immediately to discharge the channel, even secondary user's (SU) are used
Family is utilizing the channel communication.Therefore the exploitable channel of secondary user's (SU) user perception should be with time change.
In conclusion problem of the existing technology is: channel intersection is an important mistake in cognitive radio networks
Journey assumes that user has the exploitable channel set of oneself in current channel Intersection Arithmetic, when the utilizability of channel has
Denaturation, subscriber channel utilizability are invariably unrealistic during channel intersects and establishes link；Predict channel
Utilizability be to consider the problem to be solved that faces of channel time variation again；In addition, the prediction of channel utilizability is in frequency spectrum
Distribution, topology constructing etc. equally exist demand, and accurately channel utilizability prediction can largely improve frequency spectrum
The utilization rate of resource, conducive to more stable wireless network is constructed.
Summary of the invention
In view of the problems of the existing technology, the present invention provides the cognitive radio networks under a kind of dynamic environment are fair
Property channel hopping method.
The invention is realized in this way the cognitive radio networks fairness channel hopping method institute under a kind of dynamic environment
State the cognitive radio networks fairness channel hopping method under dynamic environment include: all users to channels all in network into
Row number, and the number of user is all consistent, and then obtains the state vector of channel；FCH_A algorithm utilizes intersection user's
Id information obtains the number i for utilizing Jenkins hash function that ID Hash is not more than to n for one after the id information of user, into one
It walks the frequency hopping in state vector and searches for the exploitable channel that first number is greater than i, stop algorithm if intersecting successfully, otherwise
It is updated using utilizability of the Markov to channel, continues frequency hopping and search for the exploitable channel that first number is greater than i, directly
To intersecting successfully；FCH_S algorithm is similar with FCH_A, the difference is that FCH_S generates the step-length of channel search using Joseph ring
r.The each frequency hopping search channel number of user is greater than first exploitable channel of jose (n, r, t), until user intersects successfully；
Markov process models the dynamic of channel, and Jenkins hash function and Joseph ring make all channels accessed
Probability it is identical, the fairness of guarantee agreement.
Further, the FCH_S algorithm includes:
Input: n, r；
(1) t=1, SUAAnd SUBUtilize SUBId information, by Jenkins hash function obtain one be greater than 1 be less than n
Integer start；
(2)
(3)SUASerial number is selected to be greater than first exploitable channel of jose (n, r, t)
SUBSame selection serial number is greater than first exploitable channel of jose (n, r, t)
(4) if a*=b*, then success is intersected；Otherwise (2) are returned to；
Output: a*。
Further, the F FCH_A algorithm includes:
Input n, r；
(1) t=1, SUAAnd SUBUtilize SUBId information, by Jenkins hash function obtain one be greater than 1 be less than n
Integer start；
(2)SUASerial number is selected to be greater than first exploitable channel of startSuch as
Fruit is not present the exploitable channel greater than start and then selects first exploitable channel since serial number 1；
(3)SUBSame selection serial number is greater than first exploitable channel of start
First exploitable channel is then selected since serial number 1 if there is no the exploitable channel greater than start；
(4) if a*=b*, then success is intersected；Otherwise (2) are returned to；
Output: a*。
Further, the FCH_A selects the id information of recipient to generate one 1 being uniformly distributed to n by Jenkins Hash
Integer start, the probability that number i is selected as start isThe availability p of all channels is phase for specific given user
Same, channel i accessed probability is
Channel i accessed probability is one can be had no relations about network size and channel using the function and channel number of probability, institute
The probability for having channel accessed is equal, and the probability that each channel is chosen to be intersection channel is equal,There is Pi=Pj；
The FCH_S produces a random number start using Jenkins Hash, generates a sequence by Joseph ring
Column, sequence guarantee that all number traversals are primary in n time, and all serial numbers select identical step-length r to generate according to Joseph process
, serial number is fair for each channel number；FCH_S algorithm selects access to be greater than the first of serial number on the basis of sequence
A exploitable channel,There is Pi=Pj。
Further, ID Hash is the number for being not more than n by the Jenkins hash function, the obtained number after Hash
It obeys and is uniformly distributed into n 1.
Further, the FCH_S generates the step-length r of channel search using Joseph ring:
Jose (n, r, t)=jose (n, r, t-1)+(r-1) % (n- (t+1)) jose (n, r, 1)=1.
Further, each channel of the dynamics of channels model all in following two state one of those: idle, shape
State 1, occupied, state 0；Converting between state follows a continuous time state space all as the markov of { 0,1 } S=
Chain；Indicate that channel m is transferred to the probability of state j from state i,Indicate the probability of channel m leave state i,WithIndicate the state-transition matrix of channel m, Pt mThe i-th row j column element beIndicate letter
Road m is transferred to the probability of state j in t moment from state i, and
Advantages of the present invention and good effect are as follows: utilize Markov process, Jenkins hash function and Joseph ring etc. are general
Thought obtains the fairness channel hopping agreement that channel status is dynamic change；Consider time synchronization and time asynchronous two kinds of networks
Model.The dynamic model that channel is constructed using Markov process, it is special due to Jenkins hash function and Joseph ring
Property, it ensure that the fairness of agreement.Assuming that user A and user B are intersected, channel availability is respectively paAnd pb, it was demonstrated that
The FCH_S and FCH_A intersection time is respectivelyShow that FCH_S and FCH_A algorithm is bright by simulation result
It is aobvious to be superior to H.Tan and HHCH for the spatial diversity problem of channel.
Detailed description of the invention
Fig. 1 is the cognitive radio networks fairness channel hopping method stream under dynamic environment provided in an embodiment of the present invention
Cheng Tu.
Fig. 2 is intersection channel statistical figure provided in an embodiment of the present invention；
In figure: (a) time asynchronous network；(b) Time Synchronization Network.
Fig. 3 is the channel intersection time provided in an embodiment of the present invention to compare figure；
In figure: (a) ETTR；(b)MTTR.
Fig. 4 is that channel can illustrate the influence for intersecting the time using probability in asynchronous network provided in an embodiment of the present invention
Figure；
In figure: (a) time synchronization；(b) time is asynchronous.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
Application principle of the invention is explained in detail with reference to the accompanying drawing.
As shown in Figure 1, the cognitive radio networks fairness channel hopping under dynamic environment provided in an embodiment of the present invention
Method the following steps are included:
S101:FCH_A algorithm obtains utilization after the id information of user using the id information of channel intersection user
The ID Hash can be the number for being not more than n by Jenkins hash function；FCH_S is searched using Joseph ring to generate channel
The step-length of rope；
S102: the dynamic model of channel, the fairness of guarantee agreement are constructed using Markov process.
Application principle of the invention is further described with reference to the accompanying drawing.
1, network model considers two user SUAAnd SUBChannel intersect problem, it is assumed that in network share n channel,
ID is successively from 1 to n.One binary vectorIndicate the availability status of all channels of t moment of SUA,
If channel i in t moment be it is available,It is on the contraryVector BtIt is SUBThe channel of corresponding t moment is available
State.Pass through frequency spectrum perception process, SUAAnd SUBKnow the status information of the exploitable channel of itself.In distributed network,
SUAAnd SUBOnly know the channel availability status information of itself, in this case it is not apparent that the channel availability status information of other side.
Network environment is dynamic environment, and the channel state information of user is the variation with the time and changes.Assume further that
SUAAnd SUBBetween at least exist a public exploitable channel, otherwise two users never realize channel intersect.When each
Between piece, it is primary that each user will attempt to access a channel.
Assuming that any time piece, channel i is for user SUAAnd SUBThe probability being available with is respectively paAnd pb.Also
It is for SUA, in the case where timeslice channel available mode information before notUseful taAnd tbTable respectively
Show SUAAnd SUBLocal zone time, indicate the time difference of two users with δ, about settled SUA and SUB starts to start when frequency hopping search
The time required for channel intersects is calculated, assumes t without loss of generalityA=tB+ δ works as SUBIt realizes and intersects in moment t, at this time channel
The time of intersection is t, is expressed as T (δ).Therefore maximum intersection time (MTTR) can indicate are as follows:
Averagely intersection time (ETTR) can indicate are as follows:
ETTR (A, B)=E [minT (δ)]；
The probability P that the fairness of channel intersection is accessed by the user with channeliTo measure i.e.There is Pi=Pj.Letter
Intersection problem in road can indicate are as follows:
2, Jenkins hash function
The id information of channel intersection user is utilized in FCH_A algorithm in the process of implementation.The id information be algorithm and at present
Asynchronous algorithm (such as the JS algorithm or ACH algorithm) cooperation of existing time is sent by being sent in the initial stage
Hello packet obtains.After the id information for obtaining user using Jenkins hash function can by the ID Hash be one not
Number greater than n.Due to the particularity of Jenkins Hash, the obtained number after Hash, which is obeyed 1 into n, to be uniformly distributed.
3, Joseph ring
Joseph is the application problem of a mathematics, in order to avoid the channel of Tan uses inequitable problem, FCH_S benefit
The step-length r of channel search is generated with Joseph ring, specific rules are as follows:
Jose (n, r, t)=jose (n, r, t-1)+(r-1) % (n- (t+1)) jose (n, r, 1)=1；
Using the specific example of reducing subspaces formation sequence, wherein n=4, r=2.It is by the sequence that this method generates
{ 1,3,2,4 }.It is primary that Joseph's cyclic process can guarantee that all numbers can traverse within n time.
4, Markov process
The channel model that the present invention uses is to simplify the dynamics of channels model proposed.Assuming that each channel is all in following two
A state one of those: idle (state 1), it is occupied (state 0).Conversion between state all follows a continuous time shape
State space is the Markov chain (CTMC) of S={ 0,1 }.Indicate that channel m is transferred to the probability of state j from state i,Table
Show the probability of channel m leave state i, that is,WithIndicate the state-transition matrix of channel m, Pt m
The i-th row j column element beIndicate that channel m is transferred to the probability of state j in t moment from state i, and
5, channel intersects agreement
The synchronizing channel Intersection Arithmetic (FCH_S) and time asynchronous channel of heterogeneous cognitive radio networks in a dynamic environment
Intersection Arithmetic (FCH_A) .FCH_S and FCH_A has been utilized respectively sequence and the Jenkins hash function of Joseph generation to guarantee
The fairness of channel is intersected,
5.1 FCH_S
Algorithm 1 assumes user SUATo SUBMessage is sent, two users utilize SUBId information pass through Jenkins hash function
It obtains being greater than the 1 integer start for being less than n.Due to the particularity of Jenkins Hash, start obedience 1 to n is uniformly distributed.Into
And Joseph formation sequence { jose (n, r, 1), jose (n, r, 2) ..., jose (n, r, t) ... } is utilized, two users are every time
Search channel serial number is greater than first number of jose (n, r, t).Such as user SUAIt is A in t moment channel state vectort=[1,
0,0,1], it is assumed that channel state vector will not change at this time, and the Joseph sequence of generation is { 1,3,2,4 }, then user exists
First timeslice search sequence number is more than or equal to 1 first exploitable channel 1, and second timeslice search sequence number is greater than
First channel equal to 3, and so on, the final search sequence of user is { Isosorbide-5-Nitrae, 4,4 }.Next the phase of analysis FCH_S
Answer performance.
Theorem one: under asynchronous cognitive radio networks environment, the average intersection time of FCH_S
It proves: when T=1, existingAndThere is Pr (T=1)=papb；
When T=2, existAndNot simultaneously be 1, have Pr (T=2)=
papb(1-papb)；
When T=3, existAndIt is not simultaneously 1,No
Simultaneously it is 1, there is Pr (T=2)=papb(1-papb)2；
…
When (j > 1) T=j, Pr (T=j)=papb(1-papb)j-1。
Expectation is asked it
It must demonstrate,prove.
5.2 FCH_A
User does not need the condition of time synchronization during search it can be seen from algorithm 2.Simultaneously the algorithm for
Be when channel availability status Information invariability in network it is not applicable, when intersection user be greater than start first exploitable channel
Intersection will not be realized when not identical.
For SUASelect channel i and if only if i >=start and channel { start, start+1 ..., i-1 } can state be
The state of 0, channel i are 1, and because the generation of start is one 0 being uniformly distributed to n, so user SUASelect channel i's
Probability is pa(1-pa)i-start|i≥start.User SUA, SUBThe probability that intersection is realized on channel i is papb(1-pa)i-start
(1-pb)i-start| i >=start, SUA, SUBRealize that the probability intersected is in moment t
Theorem 2: under asynchronous cognitive radio networks environment, the average intersection time of FCH_A
It proves: SUA, SUBThe probability of intersection is realized in moment t are as follows:
Similar to theorem one:
When T=1, have
When T=2, have
When T=3, have
…
When T=j, have
T is asked and is expected to have:
Therefore it must demonstrate,prove.
5.3 fairness analysis
For FCH_A, the id information of recipient is selected to generate the one 1 equally distributed integer start for arriving n by Jenkins Hash,
The probability that number i is selected as start isAssuming that the availability p of all channels be for specific given user it is identical, therefore
Channel i accessed probability is
Channel i accessed probability is one can be had no relations about network size and channel using the function and channel number of probability, because
The accessed probability of this all channel is equal, so the probability that each channel is chosen to be intersection channel is equal, i.e.,There is Pi=Pj。
One random number start is produced also with Jenkins Hash for FCH_S, and then is produced by Joseph ring
A raw sequence, which guarantees that all numbers can traverse once in n time, since the start of generation is random
And it is fair, all serial numbers are all that the identical step-length r of selection is generated according to Joseph process, so the serial number is for each channel
Number is fair.Selection accesses first exploitable channel for being greater than serial number to FCH_S algorithm on the basis of the sequence in turn,
The process is similar with FCH_A, it can therefore be concluded that FCH_A is equally existed:There is Pi=Pj。
Application effect of the invention is explained in detail below with reference to emulation.
FCH_S and FCH_A emulate and compare with algorithm H.Tan and algorithm HHCH using MATLAB emulation tool
Compared with.H.Tan algorithm is respectively that time synchronization and time asynchronous network provide channel hopping algorithm, and HHCH only has time synchronization
Channel Intersection Arithmetic.Assuming that user SUAAnd SUBChannel availability be it is equal, have pa=pb=p. emulation can be from following
From the aspect of three: (a) fixed channel availability (p) and channel total number (N) in network count being selected for each channel
For the number (F for intersecting channeli)；(b) fixed p, changes N；(c) fixed N, changes p. for the value (or value of N) of each p,
Simulation result is all the average value counted by 1000 independent operatings.
(a) fixed N, p, change Fi
Simulation parameter setting are as follows: p=0.75, N=50. Fig. 2 (a) and Fig. 2 (b) are respectively that the time is asynchronous and time synchronization network
Channel number 1 to 50 under network model is chosen to be the number of intersection channel, it can be seen that algorithm proposed by the present invention is obviously excellent
More in H.Tan.Whether its intersection channel only selects number small to the algorithm of H.Tan in time synchronization or time asynchronous network
The channel of (less than 5), the number that channel of the number greater than 5 is selected is 0, this does not obviously meet actual conditions.FCH_S and FCH_
Equal (the P of the probability that all channels are selected in Ai=1/n).
(b) fixed N, changes p
Simulation parameter is set as p=0.75, and N increases to 50 from 20.Fig. 3 (a) gives algorithms of different heterogeneous networks model
The comparison of time (ETTR) is averagely intersected down.It can be seen that the ETTR of all algorithms floats in a level, no matter and
In time synchronization or time asynchronous model, FCH algorithm has preferable performance.In Time Synchronization Network, FCH_S's
ETTR floats 1.2 or so, remaining algorithm floats on 1.4 and 2.4.The intersection time of FCH_S is less than H.Tan and HHCH and calculates
Method.In time asynchronous network, average intersection time of FCH_A 1.4 or so, H.Tan the average intersection time 2.0 or so
It floats and gives maximum intersection time (MTTR) of the algorithms of different under heterogeneous networks model also greater than FCH_A. Fig. 3 (b)
Compare figure, variation tendency and Fig. 3 (a) are similar.The reason is that because FCH_S and FCH_A have identical channel list and
Each timeslice can choose specific channel.
(c) fixed N, changes p
Simulation parameter setting are as follows: the value of N=50, p increase to 0.9. Fig. 4 (a) from 0.2 and Fig. 4 (b) is set forth not
The variation of time is averagely intersected with FCH_S under p and FCH_A.It can be found that channel intersection time (ETTR and MTTR) is with pa's
Increase and reduces.Theoretical value in figure is calculated by theorem one and theorem two, and true value is obtained by simulation result
It arrives.
The present invention utilizes Joseph ring under conditions of considering cognitive radio networks channel time difference and spatial diversity
The network model asynchronous to time synchronization and time devises the channel hopping association of justice a kind of respectively with Jenkins hash function
FCH_S is discussed, the average intersection time that FCH_A. passes through analytical proof FCH_S isThe average intersection time of FCH_A isAnalogue simulation, this hair finally have been carried out to the fairness of FCH_S and FCH_A and intersection time using emulation tool
In the algorithm of bright proposition all channels be selected as intersect channel probability it is equal, hence it is evident that be better than existing algorithm.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (4)
1. a kind of cognitive radio networks fairness channel hopping method under dynamic environment, which is characterized in that the dynamic ring
Cognitive radio networks fairness channel hopping method under border includes: that channel in network is numbered in user, obtains channel
State vector；FCH_A algorithm obtains the id information of user, utilizes Jenkins hash function using the id information of intersection user
It is the number i for being not more than n by ID Hash, frequency hopping searches for the exploitable channel that first number is greater than i in state vector；
FCH_S algorithm generates the step-length r of channel search using Joseph ring；The each frequency hopping search channel number of user is greater than jose
First exploitable channel of (n, r, t), until user intersects successfully；
The FCH_S algorithm includes:
Input: n, r；
(1) t=1, SUAAnd SUBUtilize SUBId information, obtaining one by Jenkins hash function, to be greater than 1 whole less than n
Number start；
(2)N indicate network can sharp channel number, r
Indicate that step-size in search, t indicate the time；
(3)SUASerial number is selected to be greater than first exploitable channel a of jose (n, r, t)*, Indicate t moment SUAAll channel sets that exploitable channel state is 1；SUBSame selection serial number is greater than jose (n, r, t)
First exploitable channel b*, Indicate t moment SUBExploitable channel shape
All channel sets that state is 1；
(4) if a*=b*, then success is intersected；Otherwise (2) are returned to；
Output: a*；
The FCH_A algorithm includes:
Input n, r；
(1) t=1, SUAAnd SUBUtilize SUBId information, obtaining one by Jenkins hash function, to be greater than 1 whole less than n
Number start；
(2)SUASerial number is selected to be greater than first exploitable channel a of start*,If
There is no the exploitable channels greater than start, and first exploitable channel is then selected since serial number 1；
(3)SUBSame selection serial number is greater than first exploitable channel b of start*,
First exploitable channel is then selected since serial number 1 if there is no the exploitable channel greater than start；
(4) if a*=b*, then success is intersected；Otherwise (2) are returned to；
Output: a*；
The FCH_S generates the step-length r of channel search using Joseph ring:
Jose (n, r, t)=jose (n, r, t-1)+(r-1) % (n- (t+1)) jose (n, r, 1)=1.
2. the cognitive radio networks fairness channel hopping method under dynamic environment as described in claim 1, which is characterized in that institute
FCH_A algorithm is stated, the id information of recipient is selected to generate the one 1 equally distributed integer start for arriving n by Jenkins Hash,
The probability that number i is selected as start isThe availability p of all channels is identical, channel i for specific given user
Accessed probability is
Channel i accessed probability is one can be had no relations about network size and channel using the function and channel number of probability, institute
The probability for having channel accessed is equal, and the probability that each channel is chosen to be intersection channel is equal,There is Pi=Pj；
The FCH_S algorithm produces a random number start using Jenkins Hash, generates a sequence by Joseph ring
Column, sequence guarantee that all number traversals are primary in n time, and all serial numbers select identical step-length r to generate according to Joseph process
, serial number is fair for each channel number；FCH_S algorithm selects access to be greater than the first of serial number on the basis of sequence
A exploitable channel,There is Pi=Pj。
3. the cognitive radio networks fairness channel hopping method under dynamic environment as described in claim 1, which is characterized in that
ID Hash is the number for being not more than n by the Jenkins hash function, and the obtained number after Hash is obeyed uniformly 1 into n
Distribution.
4. the cognitive radio networks fairness channel hopping method under dynamic environment as described in claim 1, which is characterized in that
Each channel all in following two state one of those: idle, state 1 is occupied, state 0；Conversion between state is all
Follow the Markov chain that a continuous time state space is S={ 0,1 }；Indicate that channel m is transferred to state j from state i
Probability,Indicate the probability of channel m leave state i,WithIndicate that the state of channel m shifts square
Battle array, Pt mThe i-th row j column element beIndicate that channel m is transferred to the probability of state j in t moment from state i, and
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710749767.8A CN107623533B (en) | 2017-08-28 | 2017-08-28 | A kind of cognitive radio networks fairness channel hopping method under dynamic environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710749767.8A CN107623533B (en) | 2017-08-28 | 2017-08-28 | A kind of cognitive radio networks fairness channel hopping method under dynamic environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107623533A CN107623533A (en) | 2018-01-23 |
| CN107623533B true CN107623533B (en) | 2019-10-25 |
Family
ID=61089328
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710749767.8A Active CN107623533B (en) | 2017-08-28 | 2017-08-28 | A kind of cognitive radio networks fairness channel hopping method under dynamic environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107623533B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1367901A (en) * | 1999-06-30 | 2002-09-04 | 西尔弗布鲁克研究股份有限公司 | Method and system for searching information |
| CN102256261A (en) * | 2011-07-14 | 2011-11-23 | 东北大学 | Dynamic spectrum access method with network cognition ability |
| KR20160074915A (en) * | 2014-12-19 | 2016-06-29 | 최윤석 | A sound source copyright protection system using a frequency hopping |
| CN106559860A (en) * | 2015-09-25 | 2017-04-05 | 中兴通讯股份有限公司 | A kind of method and apparatus of transmission information |
| CN106604321A (en) * | 2016-12-23 | 2017-04-26 | 西安电子科技大学 | Adjustable channel intersection method based on finite cover in cognitive wireless network |
-
2017
- 2017-08-28 CN CN201710749767.8A patent/CN107623533B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1367901A (en) * | 1999-06-30 | 2002-09-04 | 西尔弗布鲁克研究股份有限公司 | Method and system for searching information |
| CN102256261A (en) * | 2011-07-14 | 2011-11-23 | 东北大学 | Dynamic spectrum access method with network cognition ability |
| KR20160074915A (en) * | 2014-12-19 | 2016-06-29 | 최윤석 | A sound source copyright protection system using a frequency hopping |
| CN106559860A (en) * | 2015-09-25 | 2017-04-05 | 中兴通讯股份有限公司 | A kind of method and apparatus of transmission information |
| CN106604321A (en) * | 2016-12-23 | 2017-04-26 | 西安电子科技大学 | Adjustable channel intersection method based on finite cover in cognitive wireless network |
Non-Patent Citations (1)
| Title |
|---|
| "抗干扰抗截获差分跳频技术研究";屈晓旭;《华中科技大学博士学位论文》;20100601;第59-72页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107623533A (en) | 2018-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ye et al. | Dynamic radio resource slicing for a two-tier heterogeneous wireless network | |
| EP2612532B1 (en) | Resource sharing between secondary networks | |
| EP2612520B1 (en) | Method for generating a coexistence value to define fair resource share between secondary networks | |
| Sagduyu et al. | The problem of medium access control in wireless sensor networks | |
| Felegyhazi et al. | Efficient MAC in cognitive radio systems: A game-theoretic approach | |
| EP2521392A1 (en) | Method to evaluate fairness of resource allocations in shared bands | |
| Taneja et al. | Multi-channel medium access control protocols: review and comparison | |
| Gu et al. | Dynamic path to stability in LTE-unlicensed with user mobility: A matching framework | |
| Hamidouche et al. | A multi-game framework for harmonized LTE-U and WiFi coexistence over unlicensed bands | |
| Zhang et al. | Design and analysis of distributed hopping-based channel access in multi-channel cognitive radio systems with delay constraints | |
| Gardellin et al. | Self-coexistence in cellular cognitive radio networks based on the IEEE 802.22 standard | |
| Saadat et al. | License assisted access-WiFi coexistence with TXOP backoff for LTE in unlicensed band | |
| Bahrak et al. | Coexistence decision making for spectrum sharing among heterogeneous wireless systems | |
| CN102036389A (en) | Multichannel diversity-based cognitive medium access control realizing method | |
| Shah et al. | DDH-MAC: a novel dynamic de-centralized hybrid mac protocol for cognitive radio networks | |
| Li et al. | A fast blind scheme with full rendezvous diversity for heterogeneous cognitive radio networks | |
| Li et al. | A framework for distributed resource allocation and admission control in a cognitive digital home | |
| CN106788820A (en) | Cognitive radio networks multi-transceiver unauthorized user meets method | |
| Alshamrani et al. | A Cooperative MAC with Efficient Spectrum Sensing Algorithm for Distributed Opportunistic Spectrum Networks. | |
| Xin et al. | ROP: Near-optimal rendezvous for dynamic spectrum access networks | |
| Elmachkour et al. | The greening of spectrum sensing: a minority game-based mechanism design | |
| Kaur et al. | Intelligent spectrum management based on reinforcement learning schemes in cooperative cognitive radio networks | |
| Bala | Throughput enhancement of cognitive radio networks through improved frame structure | |
| CN107623533B (en) | A kind of cognitive radio networks fairness channel hopping method under dynamic environment | |
| Wang et al. | Admission control and channel allocation for supporting real-time applications in cognitive radio networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |