CN105357649B - Broadcasting method based on the movable cognitive radio networks of PU - Google Patents
Broadcasting method based on the movable cognitive radio networks of PU Download PDFInfo
- Publication number
- CN105357649B CN105357649B CN201510754984.7A CN201510754984A CN105357649B CN 105357649 B CN105357649 B CN 105357649B CN 201510754984 A CN201510754984 A CN 201510754984A CN 105357649 B CN105357649 B CN 105357649B
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- channel
- broadcast message
- cognitive radio
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/30—Resource management for broadcast services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
Abstract
The invention discloses a kind of broadcasting methods based on the movable cognitive radio networks of PU.This method comprises the following steps: S1:i=1,The receiving node collection of broadcast message is not received in the neighbor node of A1=S, B1=S；Judge Ai whether beIfThen judge Bi whether beIfThen can judgement determine available channel and broadcast node；If can determine that broadcast node and available channel, broadcast node is added in Ti, receiving node corresponding with available channel is added in Ri, if not can determine that broadcast node and available channel, the broadcasting process of period i terminates；Update i+1 be i, judge whether the union of Ai and Ri is equal to Ai, if the union of Ai and Ri be not equal to Ai, update Ai and Ri union be Ai, then judge Ai whether beIfOr the union of Ai and Ri is equal to Ai, then entire broadcasting process terminates.This method can avoid information redundancy and reduce time delay, information transmission loss caused by PU is interrupted is reduced or avoided.
Description
Technical field
The present invention relates to cognition wireless electrical domain more particularly to a kind of broadcast based on the movable cognitive radio networks of PU
Method.
Background technique
The concept of cognitive radio (Cognitive Radio, CR) is established originating from Joseph doctor's Mitola in 1999
Mafic work, core concept be CR have learning ability, can with ambient enviroment interactive information, to perceive and utilize in the space
Usable spectrum, and limit and reduce conflict generation.Cognitive radio networks (Cognitive Radio Networks,
CRNs) be cognitive radio technology networking, be the research hotspot in active wireless network field.Before to cognition radio
The research of network is concentrated mainly in MAC layer and routing layer, becomes new about the broadcast issue of cognitive radio networks in recent years
Research hotspot.
Current research show the flooding algorithm in conventional wireless network be not suitable for cognitive radio networks, which is because,
In traditional wireless network, broadcast message can be transmitted by a public channel, and be lacked in cognitive radio networks
Weary available common signal channel.People attempt various flooding algorithms and are not suitable for cognition radio to solve existing flooding algorithm
The problem of network.Such as the selective broadcast algorithm that Kondareddy and Agrawal is proposed, which is to reduce broadcast letter
Breath needs the channel set sent；It is demonstrated experimentally that selective broadcast algorithm can effectively reduce broadcast time delay and reduce redundancy.Song
Et al. the distributed broadcast algorithm that proposes, this algorithm has very high reachability and has preferable delay.
But the existing flooding algorithm applied in cognitive radio networks there is no consider influence of the PU activity to channel or
Person does not carry out quantitative analysis to PU (Primary User, primary user) activity.Due to there is no unified available channel and PU living
The dynamic influence to channel, so that there are following challenges for cognitive radio networks:
First, for traditional ad hoc network, due to the uniformity of available channel, all nodes in network can be
Information is transmitted or received on the same channel.Wherein, Ad hoc net is a kind of multi-hop, acentric, ad hoc deployed wireless networks,
Also known as multihop network (Multi-hop Network), foundation-free facility network (Infrastructureless Network) or from
Group knitmesh (Self-organizing Network).However, there is no such one to all in CR ad hoc network
The all available channel of node.
To further illustrate the above problem, it is contemplated that single-hop is wide in traditional ad hoc network and CR ad hoc network
The scene broadcast.If Fig. 1, interior joint A are source nodes, B and C are the neighbor nodes of A.Such as Fig. 1 (a), in traditional ad hoc network
In, there is unified common signal channel CH1, therefore node A need to only send a broadcast message, it is all in the case where zero defect
Neighbor node can receive the information.But in CR ad hoc network, the available channel of each node is different, such as
In Fig. 1 (b), the available channel of node A is CH1 and CH3, and the available channel of node B is CH1 and CH2, the available channel of node C
For CH2 and CH3.At this point, node A needs to send broadcast message over multiple channels, its neighbor node could be covered.Therefore,
In the broadcasting process of cognitive radio networks, the available channel of each node need to be considered.
(2) when some node is transmitting broadcast message on certain channel, PU occupies this channel suddenly, to beat
The transmission for the node broadcasts information of breaking.Specifically, in cognitive radio networks, PU activity has a major impact SU, and PU can be with
When interrupt use of the SU to certain channel, SU must unconditionally concede the channel at this time, wherein PU (Primary User, it is primary
Family), SU (Secondary User, cognitive user).Therefore, it in the broadcasting process of cognitive radio networks, need to consider how
Loss caused by PU is interrupted is reduced or avoided, to reduce influence of the PU to SU.
Specifically, if energy look-ahead is within next period, whether certain channel can be used by PU, and at this moment SU will
Channel is reasonably selected according to the data of prediction and transmits broadcast message.It is measured in the prior art using single measure
PU activity such as measures PU busy channel probability with some value p assumed, to simulate influence of the PU to SU, this method and
Practical situation has greater difference, and cannot really portray the activity of PU.
Moreover, flooding algorithm of the current application in cognitive radio networks has the disadvantage that as in each node
Broadcast message is sent on all available channels, will cause biggish information redundancy and increases time delay；If using certain in some node
When a channel carries out broadcast message transmission, due to not accounting for influence of the PU activity to channel, PU to use this channel to
When interrupting the broadcast message transmission of the node, the efficiency of information propagation will affect.
Summary of the invention
The technical problem to be solved in the present invention is that simultaneously for the existing broadcasting method applied in cognitive radio networks
It does not account for influence of the PU activity to channel or PU activity is not carried out insufficient caused by quantitative analysis, a kind of base is provided
In the broadcasting method of the movable cognitive radio networks of PU.
The technical solution adopted by the present invention to solve the technical problems is: one kind being based on the movable cognitive radio networks of PU
Broadcasting method, include the following steps:
S1: initialization assignment makes i=1,A1 is initial broadcast node collection S, and B1 is initial broadcast section
The receiving node collection of broadcast message is not received in the neighbor node of point set S；
S2: judge Ai whether beIfEntire broadcasting process terminates, and returning to i is broadcast required time；IfThen follow the steps S3；
S3: judge Bi whether beIfEntire broadcasting process terminates, and returning to i is broadcast required time；IfThen follow the steps S4；
S4: can all channels of each sending node, judgement determine available channel and broadcast node in traversal Ai；Its
In, available channel is the maximum probability and expected time longest channel for so that PU is in idle state；Broadcast node be in Ai with
The connected sending node of available channel；
S5: if it is determined that broadcast node, then be added in Ti by available channel and broadcast node, to send broadcast message, and
Receiving node corresponding with available channel is added in Ri, to receive broadcast message；Until the broadcasting process knot of period i
Ai-Ti is updated to Ai, and Bi-Ri is updated to Bi by beam；Update i+1 is i；Execute step S7；
S6: if not can determine that available channel and broadcast node, the broadcasting process of period i terminates；Update i+1 is i；It holds
Row step S7；
S7: judge whether the union of Ai and Ri is equal to Ai；If the union of Ai and Ri is equal to Ai, entire broadcasting process knot
Beam, returning to i-1 is the time needed for entire broadcasting process；If the union of Ai and Ri is not equal to Ai, more by the union of Ai and Ri
Newly it is Ai, executes step S2；
Wherein, i is positive integer, indicates current slot；A1 is initial broadcast node collection S；Ai is indicated at period i-1 end
Tail has received broadcast message but the sending node collection without sending broadcast message；Bi is indicated in the end of period i-1, collection
Close the receiving node collection that broadcast message is not received in the neighbor node of Ai；Ti indicates to send the hair of broadcast message in period i
Send node collection；Ri indicates to receive the receiving node collection of broadcast message in period i.
Preferably, the step S4 includes:
S401: PU is acquired according to formula (1) and is in idle shape probability of state in any channel c
S402: the expected time u that PU is in any channel c idle state is acquired according to formula (2):
Wherein,It is the desired value that PU is in idle state duration in channel c；It is the desired value that PU is in busy state duration in channel c；
S403: traversing all channels, determines the maximum probability and expected time longest channel for so that PU is in idle state
For available channel, the sending node being connected with available channel is broadcast node；
Wherein, t is the period,The parameter of the probability density function of busy state is in for PU in channel c；
The parameter of the probability density function of idle state is in for PU in channel c.
It preferably, further include determining before the step S401 and S402WithProcess, specifically include: really
Determine the time that PU in channel c is in busy stateWith the time for being in idle stateIf PU in busy state and
Poisson process is obeyed in conversion between idle state, andWithExponential distribution is obeyed, then PU is in busy state in channel c
Probability density function bePU is in the probability density function of idle state in channel cAccording toWithIt determinesWith
Preferably, the step S4 further includes step S410: judging the transmission section in the broadcast node and Ti that determine in Ai
Point sends broadcast message with the presence or absence of conflict, and if it exists, the broadcast that conflict is sent then is excluded from the broadcast node determined in Ai
Node sends broadcast message；If it does not exist, then broadcast message is sent by the broadcast node determined in Ai.
Preferably, the broadcast node determined in the judgement Ai is with the sending node in Ti with the presence or absence of the transmission broadcast that conflicts
Information includes: to judge in Ti with the presence or absence of sending node and broadcast node in same period i through available channel to same
Receiving node sends broadcast message.
Preferably, each node of the cognitive radio networks is equipped with a transceiver, can only in the same period
It receives the broadcast message or sends the broadcast message；The cognitive radio networks include signal controller, for determining
The available channel of the sending node.
The invention has the following advantages over the prior art: implementing the present invention, in cognitive radio networks broadcasting process
In, the maximum probability and expected time longest channel for selecting PU to be in idle state, will be in Ai and available as available channel
The connected sending node of channel is determined as broadcast node, sends broadcast message by available channel, can avoid information redundancy and drops
Low time delay.Also, in the cognitive radio networks broadcasting process, by being in idle shape probability of state and expected time to PU
Quantitative analysis, to predict whether channel can be used by PU in subsequent channels, so that SU can select that letter can be used according to prediction result
Road sends broadcast message, information transmission loss caused by PU is interrupted is reduced or avoided, reduces influence of the PU to SU.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples, in attached drawing:
Fig. 1 is the schematic diagram that single-hop is broadcasted in traditional ad hoc network and CR ad hoc network.
Fig. 2 is the schematic diagram of the movable markoff process of PU.
Fig. 3 is that PU uses schematic diagram on channel c.
Fig. 4 is the flow chart of the broadcasting method based on the movable cognitive radio networks of PU in one embodiment of the invention.
Fig. 5 is the broadcast time delay under different SU numbers.
Fig. 6 is the broadcast time delay under different channels number.
Specific embodiment
For a clearer understanding of the technical characteristics, objects and effects of the present invention, now control attached drawing is described in detail
A specific embodiment of the invention.
In cognitive radio networks, if only one PU on every channel, the Markov of two states can be used
Process states the PU activity, both states are busy state and idle state respectively, and both states are distinguished
It is a continuous period.Wherein, busy state refers to channel busy, occupied by PU, thus SU unusable state.
Idle state refers to channel idle, is not used by PU, therefore the state of this channel can be used in SU.Such as Fig. 2, it is with channel c
Example, arrow indicate the direction of state transfer, and the expression formula beside arrow indicates the probability of state transfer.If current state is
Idle state, then its withProbability keep the state constant, withWith probability be transferred to busy state, whereinIf current state be busy state, then its withProbability keep the state constant, withGenerally
Rate is transferred to idle state, wherein
According to the movable Marko section husband's process of PU, PU in channel c can be obtained and use model, as shown in Figure 3.In Fig. 3, it is assumed that
PU is in the desired value of the duration of busy state in channel cWith the desired value of the duration in idle stateIf PU is converted between busy state and idle state obeys Poisson process, and is in busy state and idle state
Time spanWithExponential distribution is obeyed, then PU is in the probability density function of busy state and is in channel cPU is in the probability density function of idle state in channel c
The parameter of the probability density function of busy state is in for PU in channel c；Idle shape probability of state is in for PU in channel c
The parameter of density function.Only meetWithCondition, just can determineWith
WithParameter busy state is in for channel and idle state for time services the parameter of Poisson distribution, can pass through Poisson process reality
Test examination or observation determine.
According to the movable Marko section husband's process of PU, PU channel can be obtained and use model.In PU channel using in model, can adopt
Determine that PU is in idle shape probability of state and expected time in any channel c respectively with following steps S01 and step S02.
S01: when acquiring the t period according to formula (1), PU is in idle shape probability of state in any channel c
Correspondingly, according toWhen can acquire the t period, PU is in the general of busy state in any channel c
Rate
S02: the expected time u that PU is in any channel c idle state is acquired according to formula (2):
Wherein,It is the desired value that PU is in idle state duration in channel c；
It is the desired value that PU is in busy state duration in channel c.
To sum up, a candidate channel set is given, SU must find a most suitable channel and carry out transmitting broadcast information.Having
Body is in application, according to channel c idle shape probability of state can be in the t periodOr it is in busy shape probability of state
To judge whether subsequent time period channel c is available to SU, i.e. whether PU uses channel c.In practical applications, selection is in
Idle shape probability of stateMaximum channel, the influence to SU are minimum.Idle state is in any channel c in conjunction with PU
The length of expected time u is with the most suitable channel of determination, it is possible to understand that ground, PU are in the expectation of idle state in any channel c
Time, u was longer, then its influence to SU is minimum.Therefore, probability may be selected in SUThe longest channel of maximum and expected time u is made
For the channel of transmitting broadcast information, minimum is influenced by PU activity, and can effectively reduce time delay and avoid information redundancy.
According to the characteristic of cognitive radio networks, if each node of cognitive radio networks is equipped with a transceiver,
Broadcast message can only be received in the same period or sends broadcast message, and cannot send and receive broadcast channel simultaneously, and every
One node knows that oneself can send or receive the channel of broadcast message.In addition, cognitive radio networks are additionally provided with signal control
Device, for determining the selected channel of sending node for sending broadcast message.
As shown in Fig. 4 and combination algorithm 1 and algorithm 2, the present embodiment provides one kind to be based on the movable cognition radio of PU
The broadcasting method of network.In the broadcasting method based on the movable cognitive radio networks of PU, if i is positive integer, when indicating current
Between section；A1 is to indicate initial broadcast node collection S；Ai indicates to have received broadcast message at period i-1 end but do not sent
The sending node collection of broadcast message；Bi expression does not receive broadcast letter in the end of period i-1, the neighbor node of set Ai
The receiving node collection of breath；Ti indicates to send the sending node collection of broadcast message in period i；Ri indicates to receive in period i
The receiving node collection of broadcast message.
The basic thought of the broadcasting method based on the movable cognitive radio of PU is, every time one broadcast node of selection and
The number of available channel, the receiving node to ensure to be connected by available channel with broadcast node is most.Specifically, PU should be based on
The broadcasting method of movable cognitive radio includes the following steps:
S1: initialization assignment makes i=1,A1 is initial broadcast node collection S, and B1 is initial broadcast section
The receiving node collection of broadcast message is not received in the neighbor node of point set S.Wherein, all initialization broadcast nodes in S are (i.e.
Sending node) receive broadcast message and the sending node without sending broadcast message.
S2: judge Ai whether beIfThen indicate that, at period i-1 end, there is no received broadcast letter
Breath but the sending node without sending broadcast message；Therefore, entire broadcasting process terminates, and returning to i is broadcast required time.IfI.e. at period i-1 end, exists and received broadcast message but the sending node without sending broadcast message, then
Execute step S3.
S3: judge Bi whether beIfIt then indicates in period i-1 end, the neighbor node of set Ai not
In the presence of the receiving node for not receiving broadcast message；Therefore, entire broadcasting process terminates, and returning to i is broadcast required time.IfThat is there is the receiving node without reception broadcast message in the neighbor node of set Ai, then hold in the end period i-1
Row step S4.
S4: can all channels of each sending node, judgement determine available channel and broadcast node in traversal Ai；Its
In, available channel is the maximum probability and expected time longest channel for so that PU is in idle state；Broadcast node be in Ai with
The connected sending node of available channel.Specifically, step S4 includes:
S401: PU is acquired according to formula (1) and is in idle shape probability of state in any channel c
S402: the expected time u that PU is in any channel c idle state is acquired according to formula (2):
Wherein, t is the period,The parameter of the probability density function of busy state is in for PU in channel c；
The parameter of the probability density function of idle state is in for PU in channel c.
S403: traversing all channels, determines the maximum probability and expected time longest channel for so that PU is in idle state
For available channel, the sending node being connected in Ai with available channel is broadcast node.It is to be appreciated that in available channel covering Bi
Receiving node number it is most, i.e. the receiving node number being connected with broadcast node in Bi by available channel is most；Broadcast
Node sends broadcast message by available channel, can influence to avoid PU activity to SU, can be conducive to save broadcast time, drop
Low time delay simultaneously avoids information redundancy.
The step S4 further includes step S410: judging whether the sending node in the broadcast node and Ti that determine in Ai is deposited
Broadcast message is sent in conflict, and if it exists, is then excluded the broadcast node that conflict is sent from the broadcast node determined in Ai and is sent
Broadcast message.Specifically, it can be used by judging to pass through in same period i in Ti with the presence or absence of sending node and broadcast node
Channel sends broadcast message to same receiving node, sends broadcast message to determine whether there is conflict.It is to be appreciated that if Ai
The broadcast node of middle determination, which exists to conflict with the sending node in Ti, sends broadcast message, it would be possible to cause in the same period,
There are two or more than two sending node by selected available information to same receiving node transmission broadcast message, may lead
Congestion, information redundancy are write, to increase broadcast time delay.Therefore, conflict sends broadcast message if it exists, then excludes corresponding
Broadcast node sends broadcast message, to ensure that available channel is unimpeded.
S5: if it is determined that broadcast node, then be added in Ti by available channel and broadcast node, to send broadcast message；And
Receiving node corresponding with available channel is added in Ri, to receive broadcast message；Until the broadcasting process knot of period i
Beam.At this point, Ai-Ti is updated to Ai, and Bi-Ri is updated to Bi, i.e., excluded the sending node in Ti from Ai, it will be in Ri
Receiving node excluded from Bi, to avoid repeat send broadcast message or repeat receive broadcast message, to reduce time delay simultaneously
Information redundancy is avoided, to achieve the purpose that save broadcast time.Update i+1 is i；Execute step S7.
S6: if not can determine that available channel and broadcast node, the broadcasting process of period i terminates.Update i+1 is i；It holds
Row step S7.
S7: judging whether the union of Ai and Ri is equal to Ai, that is, judges the receiving node in the sending node collection and Bi in Ai
Whether the union of collection is equal to the sending node collection of Ai.If the union of Ai and Ri is equal to Ai, illustrate to receive broadcast in current slot i
The receiving node collection of information isThen entire broadcasting process terminates, and returning to i-1 is the time needed for entire broadcasting process.If Ai
It is not equal to Ai with the union of Ri, illustrates that the receiving node collection for receiving broadcast message in current slot i is notThen by Ai and Ri
Union be updated to Ai, i.e., the receiving node in Ri is added in Ai, execute step S2.
Circulation executes above-mentioned steps S2-S7, until entire broadcasting process terminates, the time returned is entirely to broadcast
The time required to journey.
To sum up, it in the broadcasting method based on the movable cognitive radio networks of PU provided by the present embodiment, selects at PU
In idle shape probability of stateThe maximum and longest channel of expected time u as available channel, by Ai with available channel phase
Sending node even is determined as broadcast node, sends broadcast message by available channel, can avoid information redundancy and reduces time delay.
Also, in the cognitive radio networks broadcasting process, by being in idle shape probability of state to PUIt is carried out with expected time u
Quantitative analysis, to predict whether channel can be used by PU in subsequent channels, so that SU can be most suitable according to prediction result selection
Available channel (i.e. PU is in idle shape probability of stateThe maximum and longest channel of expected time u) broadcast message is sent,
Cause to transmit information loss so that PU interruption is reduced or avoided, reduces influence of the PU to SU.
In the present embodiment, a kind of pseudocode of specific algorithm of the broadcasting method based on the movable cognitive radio networks of PU
Realization process is as follows, it is possible to understand that ground realizes that the broadcasting method based on the movable cognition wireless network of PU includes but is not limited to this
Algorithm provided by embodiment.
By experiment below, used provided by the present embodiment with verifying based on the movable cognitive radio networks of PU
Broadcasting method can effectively reduce broadcast time delay.
Before testing, the network topological diagram of molding cognitive radio networks is needed, can be used and generate at random
Method generates network topological diagram, and detailed process is as follows: firstly, generating a certain number of random points, each random point represents cognition
A node in radio net, wherein the abscissa value of each node and ordinate value are within 0--1000m.In order to
Avoid the distance between multiple SU too close, we can be set one apart from threshold values (such as 30m) make between adjacent node away from
From greater than threshold values with a distance from this.Then side is added into the distribution map of the random point, the node on behalf for having side to connect can carry out
The transmission of broadcast message.Assuming that all nodes and the central node in the circle that radius is R have centered on some node
While being attached.It, can be with centromere when not finding node in the circle that radius is R due to needing a connected graph in an experiment
Point is attached, and the value that we should increase R at this time ensures to find node and is attached with central node.By above
Step, if the figure also be not connection, found out in disconnected part figure nearest node to and add side, until the figure
For connected graph.
Have the topology diagram of cognitive radio networks, following methods used to distribute channel to each node: it is random for
Each edge distribute k (k=1,2 ..., M) a channel.The available channel collection of each node is defined as coupled side upper signal channel
Set.Assuming that the number of SU is changed between 1-100,0-10 channel is randomly assigned to each SU, above each channel
There is a PU.
Parameter list:
Message transmission rate: 2Kbps
Broadcast data size: 1024bits
Fig. 5 shows that broadcast time delay increases with the increase of interstitial content.Wherein, SB is indicated in cognitive radio networks
It is middle to be increased using the broadcast time delay of selective broadcast algorithm with the increase of interstitial content.GWP indicates quantitative analysis PU activity
Afterwards, the relationship of the broadcast time delay and interstitial content that are acquired using flooding algorithm provided in this embodiment.Shown in Fig. 5, identical section
Points now, the broadcast time delay using selective broadcast algorithm are lower than to the broadcast time delay after the analysis of PU movable quantitative；Therefore, originally
Flooding algorithm based on the movable cognitive radio networks of PU employed in embodiment can effectively reduce broadcast time delay.
Fig. 6 shows that broadcast time delay increases with the increase of available channel.In Fig. 6, specifically, m_n is indicated in network
There are m SU user, n available channel.SB indicates the broadcast time delay that selective broadcast algorithm is used in cognitive radio networks
Increase with the increase of available channel.After GWP indicates quantitative analysis PU activity, asked using flooding algorithm provided in this embodiment
The relationship of the broadcast time delay and available channel that obtain.It is proposed in this paper in the network topological diagram of identical cognitive radio networks
The broadcast time delay of flooding algorithm is lower than the broadcast time delay of selective broadcast algorithm；Therefore, based on PU employed in the present embodiment
The flooding algorithm of movable cognitive radio networks can effectively reduce broadcast time delay.
The present invention be illustrated by several specific embodiments, it will be appreciated by those skilled in the art that, do not departing from
In the case where the scope of the invention, various transformation and equivalent substitute can also be carried out to the present invention.In addition, being directed to particular condition or tool
Body situation can do various modifications to the present invention, without departing from the scope of the present invention.Therefore, the present invention is not limited to disclosed
Specific embodiment, and should include whole embodiments for falling within the scope of the appended claims.
Claims (6)
1. a kind of broadcasting method based on the movable cognitive radio networks of PU, which comprises the steps of:
S1: initialization assignment makes i=1,A1 is initial broadcast node collection S, and B1 is initial broadcast node collection S
Neighbor node in do not receive the receiving node collection of broadcast message；
S2: judge Ai whether beIfEntire broadcasting process terminates, and returning to i is broadcast required time；If
Then follow the steps S3；
S3: judge Bi whether beIfEntire broadcasting process terminates, and returning to i is broadcast required time；If
Then follow the steps S4；
S4: can all channels of each sending node, judgement determine available channel and broadcast node in traversal Ai；Wherein, may be used
It is the maximum probability and expected time longest channel for so that PU is in idle state with channel；Broadcast node is to believe in Ai with available
The connected sending node in road；
S5: if can determine that available channel and broadcast node, broadcast node being added in Ti, to send broadcast message, and will
Receiving node corresponding with available channel is added in Ri, to receive broadcast message；Until the broadcasting process of period i terminates,
Ai-Ti is updated to Ai, and Bi-Ri is updated to Bi；Update i+1 is i；Execute step S7；
S6: if not can determine that available channel and broadcast node, the broadcasting process of period i terminates；Update i+1 is i；Execute step
Rapid S7；
S7: judge whether the union of Ai and Ri is equal to Ai；If the union of Ai and Ri is equal to Ai, entire broadcasting process terminates, returns
Returning i-1 is the time needed for entire broadcasting process；If the union of Ai and Ri is not equal to Ai, the union of Ai and Ri are updated to
Ai executes step S2；
Wherein, i is positive integer, indicates current slot；A1 is initial broadcast node collection S；Ai indicates at period i-1 end,
Broadcast message but the sending node collection without sending broadcast message are received；Bi is indicated in the end of period i-1, set Ai
Neighbor node in do not receive the receiving node collection of broadcast message；Ti indicates to send the transmission section of broadcast message in period i
Point set；Ri indicates to receive the receiving node collection of broadcast message in period i.
2. the broadcasting method according to claim 1 based on the movable cognitive radio networks of PU, which is characterized in that described
Step S4 includes:
S401: PU is acquired according to formula (1) and is in idle shape probability of state in any channel c
S402: the expected time u that PU is in any channel c idle state is acquired according to formula (2):
Wherein, It is the desired value that PU is in idle state duration in channel c；
It is the desired value that PU is in busy state duration in channel c；
S403: traversing all channels, and determining makes that PU is in the maximum probability of idle state and expected time longest channel can
With channel, the sending node being connected with available channel is broadcast node；
Wherein, t is the period,The parameter of the probability density function of busy state is in for PU in channel c；For letter
PU is in the parameter of the probability density function of idle state in road c.
3. the broadcasting method according to claim 2 based on the movable cognitive radio networks of PU, which is characterized in that described
It further include determining before step S401 and S402WithProcess, specifically include: determining that PU is in busy in channel c
The time of stateWith the time for being in idle stateIf PU converts obedience pool between busy state and idle state
Loose process, andWithExponential distribution is obeyed, then PU is in the probability density function of busy state and is in channel cPU is in the probability density function of idle state in channel c
According toWithIt determinesWith
4. the broadcasting method according to claim 2 based on the movable cognitive radio networks of PU, which is characterized in that described
Step S4 further includes step S410: judging that the broadcast node determined in Ai is wide with the presence or absence of the transmission that conflicts with the sending node in Ti
Broadcast information, and if it exists, then exclude the broadcast node that conflict is sent from the broadcast node determined in Ai and send broadcast message；If no
In the presence of the broadcast node for then passing through determination in Ai sends broadcast message.
5. the broadcasting method according to claim 4 based on the movable cognitive radio networks of PU, it is characterised in that: described
Judge the broadcast node and the sending node in Ti that are determined in Ai with the presence or absence of the transmission broadcast message that conflict include: judge be in Ti
It is no that there are sending nodes and broadcast node in same period i sends broadcast letter to same receiving node by available channel
Breath.
6. the broadcasting method according to claim 1-5 based on the movable cognitive radio networks of PU, feature
It is, each node of the cognitive radio networks is equipped with a transceiver, can only receive in the same period described wide
It broadcasts information or sends the broadcast message；The cognitive radio networks include signal controller, for determining the transmission section
The available channel of point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510754984.7A CN105357649B (en) | 2015-11-09 | 2015-11-09 | Broadcasting method based on the movable cognitive radio networks of PU |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510754984.7A CN105357649B (en) | 2015-11-09 | 2015-11-09 | Broadcasting method based on the movable cognitive radio networks of PU |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105357649A CN105357649A (en) | 2016-02-24 |
| CN105357649B true CN105357649B (en) | 2019-01-29 |
Family
ID=55333482
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510754984.7A Active CN105357649B (en) | 2015-11-09 | 2015-11-09 | Broadcasting method based on the movable cognitive radio networks of PU |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105357649B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101965031A (en) * | 2010-05-19 | 2011-02-02 | 北京科技大学 | Maximum probability-based cognitive radio multi-path multicast routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010086487A1 (en) * | 2009-01-28 | 2010-08-05 | Nokia Corporation | Cognitive radio |
-
2015
- 2015-11-09 CN CN201510754984.7A patent/CN105357649B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101965031A (en) * | 2010-05-19 | 2011-02-02 | 北京科技大学 | Maximum probability-based cognitive radio multi-path multicast routing method |
Non-Patent Citations (1)
| Title |
|---|
| 基于首要信道的无线认知传感器网络多信道广播协议;普健杰等;《通信学报》;20130731;第34卷(第7期);第81-86页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105357649A (en) | 2016-02-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105451290B (en) | A kind of micropower wireless network ad hoc network method and micropower wireless network | |
| KR100881462B1 (en) | Establishing method of network topology able to relay transmission among sub-network in backbone-network | |
| JP5938480B2 (en) | Routing communications based on node availability | |
| CN104507168A (en) | Distributed topology control method for cognitive Ad Hoc network | |
| CN106559352A (en) | The QoS routing mechanisms that a kind of interference of smart grid-oriented NAN is perceived | |
| Cheng et al. | Taming collisions for delay reduction in low-duty-cycle wireless sensor networks | |
| CN103248463B (en) | A kind of method and apparatus of transmission frame information | |
| CN106658523B (en) | Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network | |
| Koneri Chandrasekaran et al. | Primary path reservation using enhanced slot assignment in TDMA for session admission | |
| Rehan et al. | Anatomizing the robustness of multichannel MAC protocols for WSNs: An evaluation under MAC oriented design issues impacting QoS | |
| Hunkeler et al. | A case for centrally controlled wireless sensor networks | |
| Radi et al. | Network initialization in low-power wireless networks: a comprehensive study | |
| CN112040528B (en) | Method for selecting control node of wireless ad hoc network center | |
| CN107222901B (en) | Method for realizing cognitive radio network routing protocol based on channel allocation | |
| JP2009225053A (en) | Radio communication system, and base station and radio device used therein | |
| CN105357649B (en) | Broadcasting method based on the movable cognitive radio networks of PU | |
| KR101294504B1 (en) | Method and Apparatus for supporting relay association in wireless communication network | |
| Kwon et al. | Distributed channel selection scheme based on the number of interfering stations in WLAN | |
| CN106131887B (en) | Distribution topology control method based on serial interference elimination | |
| Jiang et al. | On searching available channels with asynchronous MAC-layer spectrum sensing | |
| KR101136641B1 (en) | Method for allocating a frequency channel to a cluster head | |
| KR101662687B1 (en) | Apparatus and Method of Energy-efficient Hybrid MAC Protocol in Cognitive Radio enabled Sensor Networks | |
| Sánchez et al. | Beacon-less geographic routing in real wireless sensor networks | |
| CN104219679B (en) | A kind of improved method for channel allocation in cognitive radio networks | |
| KR20140098301A (en) | Energy effective routing method and apparatus in wireless ad-hoc 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 |