CN105846952A - Cognitive wireless network frequency-hopping communication method supporting network coding - Google Patents
Cognitive wireless network frequency-hopping communication method supporting network coding Download PDFInfo
- Publication number
- CN105846952A CN105846952A CN201610146138.1A CN201610146138A CN105846952A CN 105846952 A CN105846952 A CN 105846952A CN 201610146138 A CN201610146138 A CN 201610146138A CN 105846952 A CN105846952 A CN 105846952A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- path
- coding
- hop sequences
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
- H04L1/0077—Cooperative coding
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
Abstract
The invention belongs to the technical field of communication, and particularly relates to a frequency hopping and network coding based communication interaction mechanism used for a cognitive wireless network. The invention provides a cognitive wireless network frequency-hopping communication method supporting network coding. According to the communication method, a frequency hopping sequence combination which can support the network coding is generated by designing different frequency hopping sequences respectively for each cognitive coding code and each adjacent cognitive code of the cognitive coding code, so that each cognitive coding node can carry out the network coding efficiently to reduce the number of forwarding of the control information, each cognitive coding code and the upstream and downstream adjacent nodes thereof can realize frequency hopping convergence at all the access channels as far as possible, and mutual interference with authorized communication can be avoided efficiently while the control information interaction frequency is increased.
Description
Technical field
The invention belongs to communication technical field, particularly for cognition wireless network based on frequency hopping and network
The communication interaction mechanism of coding.
Background technology
In cognition wireless network, adjacent cognitive nodes needs to include that frequency spectrum perception result, clock synchronize and communications band alternately
The substantial amounts of control information such as reservation, with search out from multiple mandate communications bands flexibly and exactly the most all can free time
Frequency spectrum resource.To this end, cognitive nodes needs to avoid using by the mutual frequency range of continuous switching control information single fixing special
Interfere with authorizing to communicate with cognitive produced by the mutual frequency range of control information, search out uncommitted use flexibly and rapidly
The communications band (or channel) that family takies, thus possess preferable anti-authorized user's interference performance.But, existing based on frequency
In the control information interaction mechanism of rate saltus step, all intermediate nodes are all that the mode using Store and forword is to forward received by it
Control information, the switching number of times of part cognitive nodes and energy expenditure can be caused to increase, be unfavorable for whole cognition wireless network
Transmission performance promote.
Meanwhile, the information transmission mechanisms that controls based on network code is by allowing the via node being responsible for forwarding control information
Subsequently it is transmitted to save downstream after carrying out linear or nonlinear coded treatment to its multi-channel control information received
Point, thus reduce coding nodes send control information number of times and promote whole cognition wireless network interactive control information efficiency and
Performance.
As it is shown in figure 1, when node A needs send control information bit b1, to node E, node B needs to send control letter
When breath bit b2 is to node D, bit b1 and b2 received can be performed xor operation to generate one by intermediate node C
Individual new bitAnd this bit is disposably broadcast to node D and E.Receiving the bit that node C sendsAfter the bit b2 of node B transmission, node E can carry out xor operation to the two, thus decoding recovers
Its required bit b1 received；And node D can also use similar operation decoding to recover bit b2.Correspond
, in tradition control information transmission mechanisms based on route, node C needs to forward bit b1 and b2 to node respectively
D and E.Therefore, compared with control information frequency hopping interaction mechanism based on Store and forword mode with tradition, based on network code skill
The cognition wireless network of art controls information frequency hopping interaction mechanism can reduce the intermediate node hop count to the information of control further,
Be prevented effectively from authorize communicate interfere while promote cognition wireless network interactive control information performance.But,
Support that in the control information frequency hopping interaction mechanism of network code, each coding nodes only all realizes at upstream nodes all with it
All codings just can be received required after frequency hopping convergence (i.e. simultaneously jumping on same channel in same time slot)
Control information, and then complete to encode accordingly calculating, and the control information that coding is generated the most at last be broadcast to save downstream
Point.As it is shown in figure 1, intermediate node C only with node A and B realize respectively frequency hopping converge with receive bit b1 and
After b2, xor operation could be performed to generate new bitAnd in following and node D and E frequency hopping converges
By bitIt is broadcast to the latter.Therefore, it is necessary to separately design suitably for each cognitive nodes in cognition wireless network
Frequency hop sequences be obtained in that efficiently execution with the control information frequency hopping interaction guaranteeing above-mentioned support network code, thus to the greatest extent
Given play to frequency hopping and the network coding technique advantage in control information is mutual the most simultaneously.Described suitable frequency hop sequences
Design and need to meet three requirements:
A, single network code duration require: in the case of the most uncommitted communication of all channels takies, coding nodes only needs
Wanting 3 time slots just two control information from not source node can be performed primary network coding, i.e. coding nodes is front 2
Converged by frequency hopping in individual time slot and receive the control information from two upstream nodes respectively, and by jumping in the 3rd time slot
The new control information that frequency converges coding generates is broadcast to two accepted downstream nodes.
B, interference eliminate and require: in above-mentioned 3 frequency hoppings converge, if coding nodes needs to realize with part neighbor node
Frequency hopping on channel j converges, then other neighbor node of coding nodes all can not occur on channel j, to guarantee coding joint
Point communication on channel j will not be disturbed by the communication of other neighbor node, is conducive to promoting the execution efficiency of network code,
Wherein, j=1,2,3 ..., N, N are the natural numbers being not zero.
C, can converge channel number require: if coding nodes need with a certain group of neighbor node converge interactive controlling based on frequency hopping
Information, then they need to realize frequency hopping on all accessible channels and converge, it is thus possible to effectively avoid being authorized to communication institute
The channel taken.
Summary of the invention
The control mutual mistake of information frequency hopping of support network code is may insure that in order to meet each cognitive nodes in cognition wireless network
Journey is obtained in that three requirements of efficiently execution, and the present invention provides a kind of cognition wireless network frequency hopping communications supporting network code
Method.This communication means is that the adjacent cognitive nodes of each cognitive coding node and described cognitive coding node separately designs difference
Frequency hop sequences combine to generate a kind of frequency hop sequences that can support network code, so that it is guaranteed that each equal energy of cognitive coding node
Enough be effectively carried out network code to reduce control information hop count, and as much as possible with upstream and downstream neighbor node all can
Realize frequency hopping on the channel accessed to converge, be prevented effectively from while promoting control information interactive efficiency and authorize the generation phase that communicates
Interference mutually.
Technical scheme:
Assume that cognition wireless network is every pair according to the demand of cognitive nodes interactive control information and controls information
Sending node SiWith receiving node RiEstablish unidirectional path Route of unique control information transmissioni, cognition wireless network
According to the sending node S that the demand of cognitive nodes interactive control information is every pair of control informationjWith receiving node Rj
Establish unidirectional path Route of unique control information transmissionj.So, arranging node k is that coding nodes is to be responsible for institute
State RouteiAnd RoutejThe control information of upper transmission carries out network code, and the control information that coding generates is broadcast to further
Node k is at RouteiAnd RoutejOn downstream neighbor, the most described RouteiAnd RoutejTwo lifes for coding nodes k
Becoming path, wherein, i represents that node serial number, j represent that nodes encoding, k represent node serial number, i ≠ j ≠ k.
Node all of in cognition wireless network is divided into first kind node and Equations of The Second Kind node, described first kind node
Comprise all coding nodes and each coding nodes upstreams on its two generation paths in cognition wireless network
And downstream neighbor, described Equations of The Second Kind node comprises all non-first kind nodes in cognition wireless network.
Coding nodes randomly selects a frequency hop sequences as self frequency hop sequences in all optional frequency hop sequences, and by described
Self frequency hop sequences is broadcasted to the adjacent node of described coding nodes by DCCH.
The node of the control information receiving coding nodes broadcast in cognition wireless network generates the frequency hopping sequence of self according to respective algorithms
Row, after coding nodes receives the confirmation of whole end node, communication interaction based on frequency agility and network code mechanism
Initialization procedure terminate.
A kind of cognition wireless network frequency-hopping communication method supporting network code, comprises the steps:
Each source node in S1, cognition wireless network saves to the whole network on DCCH by the way of flooding
Point broadcasts its communication transmission needs；
S2, each joint after receiving the communication transmission needs of institute's active node described in S1, in cognition wireless network
Point checks oneself whether to there is code machine meeting, if there is code machine meeting, then this node is called coding nodes, then described
Coding nodes provides net by showing that the data for which source node are transmitted by it to the whole network node by the way of flooding
Network encodes；
In S3, cognition wireless network, each non-coding node is after receiving the information of coding nodes broadcast described in S2,
The node type carrying out non-coding node is needed to judge, it is determined that rule is:
In cognition wireless network, each coding nodes at the upstream and downstream adjacent node that its two generate on path is
First kind node, all non-first kind nodes are Equations of The Second Kind node, and wherein, described generation path meets following regular:
Assume that cognition wireless network is every pair according to the demand of cognitive nodes interactive control information and controls information
Sending node SiWith receiving node RiEstablish unidirectional path Route of unique control information transmissioni, cognition wireless network
According to the sending node S that the demand of cognitive nodes interactive control information is every pair of control informationjAnd receiving node
RjEstablishing the unidirectional path of unique control information transmission, arranging node k is that coding nodes is to be responsible for described Routei
And RoutejThe control information of upper transmission carries out network code, and the control information that coding generates is broadcast to node k further exists
RouteiAnd RoutejOn downstream neighbor, the most described RouteiAnd RoutejTwo for coding nodes k generate paths,
Wherein, i represents that node serial number, j represent that nodes encoding, k represent node serial number, i ≠ j ≠ k, described RouteiAnd Routej
Meet following restrictive condition simultaneously:
Condition 1, exist at least one cognitive nodes k meetWherein,
UN(Routei, k) represent that cognitive nodes k is at path RouteiOn upstream neighbor node, UN (Routej, k) cognitive nodes k exists
Path RoutejOn upstream neighbor node；
Condition 2, path RouteiOn source node SiWith path RoutejOn destination node RjBetween minimal cut be more than
In 2, path RoutejOn source node SjWith path RouteiOn destination node RiBetween minimal cut more than or equal to 2；
S4, coding nodes randomly select a frequency hop sequences as self frequency hop sequences in all optional frequency hop sequences, and will
Self frequency hop sequences described is broadcasted to the adjacent node of described coding nodes by DCCH, wherein, and special control
Channel processed is the appointment channel in cognition wireless network；
S5, cognition wireless network receive the node of the control information of coding nodes broadcast described in S4 generate certainly according to respective algorithms
The frequency hop sequences of body, if described in receive coding nodes described in S4 the node of broadcast message be source node or destination node, then institute
State source node or destination node can reply confirmation letter with mode of unicast to coding nodes described in S4 according to the raw address in control information
Breath, if described in receive coding nodes described in S4 the node of broadcast message be not source node or destination node, then this node is with extensively
The mode broadcast forwards the control information received to its adjacent node；
S6, after coding nodes described in S4 receives the confirmation of whole end node, based on frequency agility and network code logical
The initialization procedure of letter interaction mechanism terminates, and wherein, described end node includes source node and destination node.
Further, the frequency hop sequences specific rules that S5 generates self according to respective algorithms divides according to node type,
First kind node generate self frequency hop sequences method particularly as follows:
Step 1, definition coding nodes are node C, and it is node A that the Article 1 of definition coding nodes generates the upstream node in path,
It is node E that the Article 1 of definition coding nodes generates the downstream node in path, and the Article 2 of definition coding nodes generates the upper of path
Trip node is node B, and it is node D that the Article 2 of definition coding nodes generates the downstream node in path；
Step 2, randomly choose frequency hop sequences numbering N for node C described in step 1C∈[0,m3)；
Step 3, the frequency hop sequences of node D described in step 1 is numbered it is set to
It is set to the frequency hop sequences of node E described in step 1 is numbered
NE=(NC+m2)modulo(m3)；
If step 4 ND=(m-1) modulo (m), then the frequency hop sequences numbering of node A described in step 1 is set to
NA=ND-1, if ND≠ (m-1) modulo (m), then the frequency hop sequences numbering of node A described in step 1 is set to
NA=ND+1；
If step 5 NE=(m-1) modulo (m), then number the frequency hop sequences of node B described in step 1 and be set to
NB=NE-1, if NE≠ (m-1) modulo (m), then number the frequency hop sequences of the node B described in step 1 and be set to
NB=NE+1；
Step 6, the frequency hop sequences of node A, node B, node C, node D and node E is numbered it is each mapped to ring
3 time slot hopping sequence answeredWith
Step 7, by each 3 time slot hopping sequenceExpansion is
Equations of The Second Kind node generate self frequency hop sequences method particularly as follows:
Step 1, definition coding nodes are node C, and the Article 1 of definition coding nodes generates path RouteiUpstream node be
Node A, the Article 1 of definition coding nodes generates path RouteiDownstream node be node E, definition coding nodes second
Bar generates path RoutejUpstream node be node B, definition coding nodes Article 2 generate path RoutejDownstream joint
Point is node D；
Step 2, all Equations of The Second Kind nodes are respectively divided in node set L and node set R, wherein, described node
Set L comprises Article 1 and generates path RouteiUpper source node generates to all Equations of The Second Kind nodes between node A, Article 2
Path RoutejUpper node D is to all Equations of The Second Kind nodes between destination node, RouteiSource node to RoutejPurpose saves
Without all Equations of The Second Kind nodes on coding nodes path between point, and all adjacent Equations of The Second Kind of these Equations of The Second Kind nodes
Node, described node set R comprises Article 2 and generates path RoutejUpper source node saves to all Equations of The Second Kinds between node B
Point, Article 1 RouteiGenerate node E on path to all Equations of The Second Kind nodes between destination node, RoutejSource node
To RouteiDestination node between without all Equations of The Second Kind nodes on coding nodes path, and these Equations of The Second Kind nodes
All adjacent Equations of The Second Kind nodes, and guarantee that any one Equations of The Second Kind node can only uniquely belong to set L or set R；
Step 3, initiation parameter c=(ND) modulo (m) and d=(NE)modulo(m)；
Step 4, from [(ND-c+2m2)modulo(m3),(ND-c+2m2+m-1)modulo(m3)] interior for described in step 2
In set L, each node selects a frequency hop sequences numbering；
If step 5So from [NE-d+m2-m,NE-d+m2-1]
In the range of randomly choose a frequency hop sequences numbering for gathering each node in R described in step 2, otherwise, from
[NE-d-m,NE-d-1] in the range of randomly choose a frequency hop sequences numbering for gathering each node in R described in step 2；
Step 6, the frequency hop sequences of each node n is numbered it is mapped as corresponding 3 time slot hopping sequence
Step 7, by 3 time slot hopping sequence of each node nExpansion is
The invention has the beneficial effects as follows:
Cognition wireless network based on frequency hopping convergence and network code designed by the present invention controls information interaction mechanism and both can ensure that
All adjacent communication nodes (including coding nodes and ordinary node) all can on all accessible channels property performance period
Frequency hopping converges, and is prevented effectively from the interference to authorized user's communication, lacking, authorized user's frequency spectrum can be taken real time information again
In the case of utilize efficiently network coding technique to increase network transmission average throughput and the utilization rate of wireless link.
Accompanying drawing explanation
Fig. 1 is the control mutual example of information based on network code.
Fig. 2 is any two-way in cognition wireless network to be controlled information carry out the schematic diagram of network code, and in figure, every dotted line is equal
It is to control the omission of multiple intermediate nodes and link on information one-way transmission path to represent one.
Fig. 3 is 3 time slot hopping sequence that 5 cognitive nodes being expressed as in Fig. 1 based on 33 systems are generated.
Fig. 4 is as m=3, can realize supporting the 9 time slot hopping sequence examples that network code frequency hopping converges.
Fig. 5 is that frequency hopping based on network code converges topological diagram example.
Fig. 6 is a kind of frequency hop sequences example of all cognitive nodes in Fig. 5.
Fig. 7 is that node density and channel number are certain and in the presence of not having primary user, uses the jumping being proposed support network code
Frequently with existing, agreement does not support that network code frequency hopping protocol affects Comparative result on whole network throughput.
Fig. 8 is that node density and channel number are certain and in the presence of having primary user, uses the frequency hopping being proposed support network code
With existing, agreement does not support that network code frequency hopping protocol affects Comparative result to whole network throughput.
Detailed description of the invention
Below in conjunction with embodiment and accompanying drawing, describe technical scheme in detail.
On DCCH, by the way of flooding, to the whole network node broadcasts, it leads to each source node in cognition wireless network
Letter transmission demand.
Receiving after the communication transmission needs of active node, whether each node inspection oneself exists code machine meeting.If
There is code machine meeting, then this node needs to show that it is by the data for which source node to the whole network node by the way of flooding
Transmission provides network code.
After receiving the information of coding nodes broadcast, each non-coding node is it needs to be determined that it belongs to the first kind or Equations of The Second Kind
Node.The division of first kind node and Equations of The Second Kind node particularly as follows:
As a example by cognition wireless network as shown in Figure 2, node C is simultaneously on Route1 and Route2, and it is at these two
Possess on path between different upstream neighbor nodes, and minimal cut and node S2 and R1 between node S1 and R2
Minimal cut is 2, and therefore node C is the coding nodes of path Routei and Routej, and node C and at Routei
Belong to first kind node with neighbor node A, B, D and the E on Routej, and other node beyond these nodes is equal
Belong to Equations of The Second Kind node.In 5 meshed networks as shown in Figure 1, all nodes belong to first kind node, and this network
There is not Equations of The Second Kind node.Therefore this network is the example the most simply supporting network code.Network code shown in Fig. 2
Example can be counted as the general expansion of example shown in Fig. 1.Every dotted line in Fig. 2 is all to control information list to one
On transmission path, the omission of multiple intermediate nodes and link represents.
Coding nodes randomly selects a frequency hop sequences as self frequency hop sequences in all optional frequency hop sequences, and by this jumping
Frequency sequence is broadcasted to its neighbor node by DCCH.
After receiving the control information of coding nodes, each first kind node can use first kind node to generate self frequency hop sequences
Method generate self frequency hop sequences, and each Equations of The Second Kind node can use Equations of The Second Kind node to generate self frequency hop sequences
Method generates the frequency hop sequences of self.
For each node receiving coding nodes control information, if it is source node, then it can be with broadcast
Mode forwards the frequency hop sequences of self to its neighbor node；Otherwise, it can be according to the source address in control information with the side of clean culture
Formula replys confirmation to coding nodes.
When coding nodes receives the confirmation of whole end node (source node and destination node), then based on frequency agility and net
The initialization procedure of the communication interaction mechanism of network coding i.e. completes.
Support the frequency hop sequences generating algorithm example converged based on network code frequency hopping
When accessible total number of channels is m=3, N=m3=27.
First, at random choose a frequency hop sequences for coding nodes C: 0,1,2}, according to the sequence number corresponding to this frequency hop sequences,
And first kind node generate self frequency hop sequences method just can draw respectively remaining four first kind node A, D, E and
The frequency hop sequences of B be respectively 0,2,1}, 0,2,2}, 1,1,2} and 1,1,1}, wherein, first kind node generate self jump
The method of frequency sequence particularly as follows:
Step 1, definition coding nodes are node C, and it is node A that the Article 1 of definition coding nodes generates the upstream node in path,
It is node E that the Article 1 of definition coding nodes generates the downstream node in path, and the Article 2 of definition coding nodes generates the upper of path
Trip node is node B, and it is node D that the Article 2 of definition coding nodes generates the downstream node in path；
Step 2、Frequency hop sequences numbering N is randomly choosed for node C described in step 1C∈[0,m3)；
Step 3, the frequency hop sequences of node D described in step 1 is numbered it is set to
It is set to the frequency hop sequences of node E described in step 1 is numbered
NE=(NC+m2)modulo(m3)；
If step 4 ND=(m-1) modulo (m), then the frequency hop sequences numbering of node A described in step 1 is set to
NA=ND-1, if ND≠ (m-1) modulo (m), then the frequency hop sequences numbering of node A described in step 1 is set to
NA=ND+1；
If step 5 NE=(m-1) modulo (m), then number the frequency hop sequences of node B described in step 1 and be set to
NB=NE-1, if NE≠ (m-1) modulo (m), then number the frequency hop sequences of the node B described in step 1 and be set to
NB=NE+1；
Step 6, the frequency hop sequences of node A, node B, node C, node D and node E is numbered it is each mapped to ring
3 time slot hopping sequence answeredWith
Step 7, by each 3 time slot hopping sequenceExpansion is
Thus, it is possible to obtain the periodicity frequency hop sequences that the cycle is 3*m=3*3=9:
CHC={0,1,2,1,2,0,2,0,1}
CHS1={0,2,1,1,0,2,2,1,0}
CHR2={0,2,2,1,0,0,2,1,1}
CHR1={1,1,2,2,2,0,0,0,1}
CHS2={1,1,1,2,2,2,0,0,0}
The method generating self frequency hop sequences according to first kind node frequency hop sequences and Equations of The Second Kind node can obtain, in set L
The selectable frequency hop sequences of all nodes is { 2,2,0}, { 2,2,1} and { 2,2,2}, and it is selectable to gather all nodes in R
Frequency hop sequences is that { 1,0,0}, { 1,0,1} with { 1,0,2}, wherein, the method that Equations of The Second Kind node generates self frequency hop sequences is concrete
For:
Step 1, definition coding nodes are node C, and it is node A that the Article 1 of definition coding nodes generates the upstream node in path,
It is node E that the Article 1 of definition coding nodes generates the downstream node in path, and the Article 2 of definition coding nodes generates the upper of path
Trip node is node B, and it is node D that the Article 2 of definition coding nodes generates the downstream node in path；
Step 2, all Equations of The Second Kind nodes are respectively divided in node set L and node set R, wherein, described node
Set L comprises Article 1 and generates source node on path to all Equations of The Second Kind nodes between node A, on Article 2 generation path
Node D is to all Equations of The Second Kind nodes between destination node, and Article 1 generates the source node on path to Article 2 generation path
Without all Equations of The Second Kind nodes on coding nodes path between upper destination node, and all phases of these Equations of The Second Kind nodes
Adjacent Equations of The Second Kind node, described node set R comprises Article 2 and generates source node on path to all Equations of The Second Kinds between node B
Node, Article 1 generates node E on path to all Equations of The Second Kind nodes between destination node, and Article 2 generates on path
Source node generates to Article 1 between the destination node on path without all Equations of The Second Kind nodes on coding nodes path, with
And all adjacent Equations of The Second Kind node of these Equations of The Second Kind nodes, and guarantee that any one Equations of The Second Kind node can only uniquely belong to collection
Close L or set R；
Step 3, initiation parameter c=(ND) modulo (m) and d=(NE)modulo(m)；
Step 4, from [(ND-c+2m2)modulo(m3),(ND-c+2m2+m-1)modulo(m3)] interior for described in step 2
In set L, each node selects a frequency hop sequences numbering；
If step 5So from [NE-d+m2-m,NE-d+m2-1]
In the range of randomly choose a frequency hop sequences numbering for gathering each node in R described in step 2, otherwise, from
[NE-d-m,NE-d-1] in the range of randomly choose a frequency hop sequences numbering for gathering each node in R described in step 2；
Step 6, the frequency hop sequences of each node n is numbered it is mapped as corresponding 3 time slot hopping sequence
Step 7, by 3 time slot hopping sequence of each node nExpansion is
Thus, it is possible to the frequency hop sequences set that cycle is 3m=9 obtaining gathering L node and set R node is respectively as follows:
CHL={{2,2,0,0,0,1,1,1,2}, 2,2,1,0,0,2,1,1,0}, 2,2,2,0,0,0,1,1,1}} and
CHR={{1,0,0,2,1,1,0,2,2}, { 1,0,1,2,1,2,0,2,0}, { 1,0,2,2,1,0,0,2,1}}.
Each Equations of The Second Kind node can be belonging to gather L according to it and still gather R and select at random from corresponding frequency hop sequences set respectively
Select the frequency hop sequences that cycle is 9 time slots.
Do not support the frequency hop sequences generating algorithm example converged based on network code frequency hopping
The frequency hop sequences generating algorithm phase that this nodes frequency hop sequences generating algorithm converges based on network code frequency hopping with support
With, here is omitted.The difference of Liang Zhong network model based on network coding technique is that data transmission whether can
Handling capacity and link utilization to network bring bigger lifting.
Simulation comparison
In simulations, the cognition wireless network communication scenes being made up of 25 cognitive user is set.In this communication scenes, institute
Cognitive user is had to be evenly distributed in the middle of the square area of 1000m × 1000m.Simultaneously as this region is also at one
Within the communication coverage of individual primary user, therefore primary user take each authorization channel all can be to all cognitive nodes
Data transmission all causes certain impact.Additionally, the data transmission channel model of each cognitive user uses free space path to decline
Subtracting model, it may be assumed that S=P-(32.44+20lgD+20lgF), wherein, D represents that transmission range, unit are km, and F represents
Node operating frequency, unit is MHz；S represents that cognitive nodes receives power, and unit dBm, P represents that cognitive nodes is launched
Power, unit is dBm.Design parameter is arranged as shown in table 1.Network coding technique whether is used to incite somebody to action when transmitting according to data
Scene is divided into two classes, and the frequency hopping communications performance being respectively directed to this two classes network scenarios has carried out simulation analysis.
In table 1 cognition network, the major parameter of communication node is arranged
From the result of Fig. 7 it is recognised that cognition network uses the frequency hopping communications machine of the support network code that we are proposed
Making compared with using common frequency hopping communications mechanism, the handling capacity of its whole network improves will by about one time.
From Fig. 8 to know, when cognition network existing primary user and taking communication channel at random, the behavior of its busy channel for
The impact of the frequency hopping communications mechanism of the support network code proposed is less than the tradition not supporting to converge based on network code frequency hopping
Frequency hopping communications mechanism is compared with Fig. 7 in the presence of having primary user, and the decline of its handling capacity is about (400 380)/400=5%.
But, the existence of primary user but creates serious impact to the cognition network using common frequency hopping communications mechanism to communicate,
Its throughput degradation is about (200 120)/200=40%.
Therefore, by the result of Fig. 7 and Fig. 8 it is recognised that the frequency hopping communications for using support network code is machine-processed
Cognition network in the presence of there is no primary user, we can obtain higher handling capacity, in the presence of having primary user, this lead to
Letter mechanism can ensure that whole cognition network has higher anti-interference.
Claims (2)
1. the cognition wireless network frequency-hopping communication method supporting network code, it is characterised in that include walking as follows
Rapid:
Each source node in S1, cognition wireless network saves to the whole network on DCCH by the way of flooding
Point broadcasts its communication transmission needs；
S2, each joint after receiving the communication transmission needs of institute's active node described in S1, in cognition wireless network
Point checks oneself whether to there is code machine meeting, if there is code machine meeting, then this node is called coding nodes, and described
To the whole network node, coding nodes shows that the data for which source node are transmitted by it by the way of flooding provides network
Coding；
In S3, cognition wireless network, each non-coding node is after receiving the information of coding nodes broadcast described in S2,
The node type carrying out non-coding node is needed to judge, it is determined that rule is:
In cognition wireless network, each coding nodes at the upstream and downstream adjacent node that its two generate on path is
First kind node, all non-first kind nodes are Equations of The Second Kind node, and wherein, described generation path meets following regular:
Assume that cognition wireless network is every pair according to the demand of cognitive nodes interactive control information and controls information
Sending node SiWith receiving node RiEstablish unidirectional path Route of unique control information transmissioni, cognition wireless network
According to the sending node S that the demand of cognitive nodes interactive control information is every pair of control informationjWith receiving node Rj
Establishing the unidirectional path of unique control information transmission, arranging node k is that coding nodes is to be responsible for described RouteiWith
RoutejThe control information of upper transmission carries out network code, and the control information that coding generates is broadcast to node k further exists
RouteiAnd RoutejOn downstream neighbor, the most described RouteiAnd RoutejTwo for coding nodes k generate paths,
Wherein, i represents that node serial number, j represent that nodes encoding, k represent node serial number, i ≠ j ≠ k, described RouteiAnd Routej
Meet following restrictive condition simultaneously:
Condition 1, exist at least one cognitive nodes k meetWherein,
UN(Routei, k) represent that cognitive nodes k is at path RouteiOn upstream neighbor node, UN (Routej, k) cognitive nodes k exists
Path RoutejOn upstream neighbor node；
Condition 2, path RouteiOn source node SiWith path RoutejOn destination node RjBetween minimal cut be more than
In 2, path RoutejOn source node SjWith path RouteiOn destination node RiBetween minimal cut more than or equal to 2；
S4, coding nodes randomly select a frequency hop sequences as self frequency hop sequences in all optional frequency hop sequences, and will
Self frequency hop sequences described is broadcasted to the adjacent node of described coding nodes by DCCH, wherein, and special control
Channel processed is the appointment channel in cognition wireless network；；
S5, cognition wireless network receive the node of the control information of coding nodes broadcast described in S4 generate certainly according to respective algorithms
The frequency hop sequences of body, if described in receive coding nodes described in S4 the node of broadcast message be source node or destination node, then institute
State source node or destination node can reply confirmation letter with mode of unicast to coding nodes described in S4 according to the raw address in control information
Breath, if described in receive coding nodes described in S4 the node of broadcast message be not source node or destination node, then this node is with extensively
The mode broadcast forwards control information to its adjacent node；
S6, after coding nodes described in S4 receives the confirmation of whole end node, based on frequency agility and network code logical
The initialization procedure of letter interaction mechanism terminates, and wherein, described end node includes source node and destination node.
A kind of cognition wireless network frequency-hopping communication method supporting network code the most according to claim 1, its
It is characterised by: the frequency hop sequences specific rules that S5 generates self according to respective algorithms divides according to node type,
First kind node generate self frequency hop sequences method particularly as follows:
Step 1, definition coding nodes are node C, and it is node A that the Article 1 of definition coding nodes generates the upstream node in path,
It is node E that the Article 1 of definition coding nodes generates the downstream node in path, and the Article 2 of definition coding nodes generates the upper of path
Trip node is node B, and it is node D that the Article 2 of definition coding nodes generates the downstream node in path；
Step 2, randomly choose frequency hop sequences numbering N for node C described in step 1C∈[0,m3)；
Step 3, the frequency hop sequences of node D described in step 1 is numbered it is set to
It is set to the frequency hop sequences of node E described in step 1 is numbered
NE=(NC+m2)modulo(m3)；
If step 4 ND=(m-1) modulo (m), then the frequency hop sequences numbering of node A described in step 1 is set to
NA=ND-1, if ND≠ (m-1) modulo (m), then the frequency hop sequences numbering of node A described in step 1 is set to
NA=ND+(1；
If step 5 NE=(m-1) modulo (m), then number the frequency hop sequences of node B described in step 1 and be set to
NB=NE-1, if NE≠ (m-1) modulo (m), then number the frequency hop sequences of the node B described in step 1 and be set to
NB=NE+1；
Step 6, the frequency hop sequences of node A, node B, node C, node D and node E is numbered it is each mapped to phase
3 time slot hopping sequence answeredWith
Step 7, by each 3 time slot hopping sequenceExpansion is
Equations of The Second Kind node generate self frequency hop sequences method particularly as follows:
Step 1, definition coding nodes are node C, and it is node A that the Article 1 of definition coding nodes generates the upstream node in path,
It is node E that the Article 1 of definition coding nodes generates the downstream node in path, and the Article 2 of definition coding nodes generates the upper of path
Trip node is node B, and it is node D that the Article 2 of definition coding nodes generates the downstream node in path；
Step 2, all Equations of The Second Kind nodes are respectively divided in node set L and node set R, wherein, described node
Set L comprises Article 1 and generates source node on path to all Equations of The Second Kind nodes between node A, on Article 2 generation path
Node D is to all Equations of The Second Kind nodes between destination node, and Article 1 generates the source node on path to Article 2 generation path
Without all Equations of The Second Kind nodes on coding nodes path between upper destination node, and all phases of these Equations of The Second Kind nodes
Adjacent Equations of The Second Kind node, described node set R comprises Article 2 and generates source node on path to all Equations of The Second Kinds between node B
Node, Article 1 generates node E on path to all Equations of The Second Kind nodes between destination node, and Article 2 generates on path
Source node generates to Article 1 between the destination node on path without all Equations of The Second Kind nodes on coding nodes path, with
And all adjacent Equations of The Second Kind node of these Equations of The Second Kind nodes, and guarantee that any one Equations of The Second Kind node can only uniquely belong to collection
Close L or set R；
Step 3, initiation parameter c=(ND) modulo (m) and d=(NE)modulo(m)；
Step 4, from [(ND-c+2m2)modulo(m3),(ND-c+2m2+m-1)modulo(m3)] interior for described in step 2
In set L, each node selects a frequency hop sequences numbering；
If step 5So from [NE-d+m2-m,NE-d+m2-1]
In the range of randomly choose a frequency hop sequences numbering for gathering each node in R described in step 2, otherwise, from
[NE-d-m,NE-d-1] in the range of randomly choose a frequency hop sequences numbering for gathering each node in R described in step 2；
Step 6, the frequency hop sequences of each node n is numbered it is mapped as corresponding 3 time slot hopping sequence
Step 7, by 3 time slot hopping sequence of each node nExpansion is
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610146138.1A CN105846952B (en) | 2016-03-15 | 2016-03-15 | A kind of cognition wireless network frequency-hopping communication method for supporting network code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610146138.1A CN105846952B (en) | 2016-03-15 | 2016-03-15 | A kind of cognition wireless network frequency-hopping communication method for supporting network code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105846952A true CN105846952A (en) | 2016-08-10 |
| CN105846952B CN105846952B (en) | 2018-12-11 |
Family
ID=56587087
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610146138.1A Expired - Fee Related CN105846952B (en) | 2016-03-15 | 2016-03-15 | A kind of cognition wireless network frequency-hopping communication method for supporting network code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105846952B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106411472A (en) * | 2016-11-28 | 2017-02-15 | 盐城工学院 | Physical layer network coding routing method and device |
| CN107395251A (en) * | 2017-07-17 | 2017-11-24 | 电子科技大学 | Suitable for the frequency hopping sequence generating method of more transceiver cognition wireless networks |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040062393A1 (en) * | 2000-09-27 | 2004-04-01 | Sitrick David H. | Targeted anti-piracy system and methodology |
| US20050153725A1 (en) * | 2002-06-24 | 2005-07-14 | Nokia Corporation | Mobile mesh Ad-Hoc networking |
| CN101199174A (en) * | 2005-05-06 | 2008-06-11 | 诺基亚公司 | Radio resource allocation in telecommunication system |
| CN102884844A (en) * | 2010-04-07 | 2013-01-16 | 宏达国际电子股份有限公司 | Communication device and method thereof |
-
2016
- 2016-03-15 CN CN201610146138.1A patent/CN105846952B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040062393A1 (en) * | 2000-09-27 | 2004-04-01 | Sitrick David H. | Targeted anti-piracy system and methodology |
| US20050153725A1 (en) * | 2002-06-24 | 2005-07-14 | Nokia Corporation | Mobile mesh Ad-Hoc networking |
| CN101199174A (en) * | 2005-05-06 | 2008-06-11 | 诺基亚公司 | Radio resource allocation in telecommunication system |
| CN102884844A (en) * | 2010-04-07 | 2013-01-16 | 宏达国际电子股份有限公司 | Communication device and method thereof |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106411472A (en) * | 2016-11-28 | 2017-02-15 | 盐城工学院 | Physical layer network coding routing method and device |
| CN106411472B (en) * | 2016-11-28 | 2019-07-19 | 盐城工学院 | A kind of physical-layer network coding method for routing and device |
| CN107395251A (en) * | 2017-07-17 | 2017-11-24 | 电子科技大学 | Suitable for the frequency hopping sequence generating method of more transceiver cognition wireless networks |
| CN107395251B (en) * | 2017-07-17 | 2019-07-02 | 电子科技大学 | Frequency hopping sequence generating method suitable for more transceiver cognition wireless networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105846952B (en) | 2018-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Cui et al. | Energy efficient opportunistic network coding for wireless networks | |
| Sanderovich et al. | Uplink macro diversity with limited backhaul capacity | |
| CN101895376B (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| Permuter et al. | Message and state cooperation in multiple access channels | |
| Altman et al. | Dynamic control of coding in delay tolerant networks | |
| Sugiyama | Pulsed power network based on decentralized intelligence for reliable and low loss electrical power distribution | |
| Kim et al. | Is rate adaptation beneficial for inter-session network coding? | |
| Costa et al. | Informed network coding for minimum decoding delay | |
| Chao et al. | Providing complete rendezvous guarantee for cognitive radio networks by quorum systems and latin squares | |
| CN103428803A (en) | Opportunistic routing method combining with opportunistic network coding | |
| CN105846952A (en) | Cognitive wireless network frequency-hopping communication method supporting network coding | |
| Zhang et al. | MBMS with user cooperation and network coding | |
| Atkin et al. | An efficient modulation/coding scheme for MFSK systems on bandwidth constrained channels | |
| Wang et al. | Contention resolution mechanisms for multi-channel cognitive radio ad hoc networks | |
| CN105451352B (en) | A kind of cognition wireless network frequency-hopping communication method of supporting node priority | |
| Shamai et al. | Joint multi-cell processing for downlink channels with limited-capacity backhaul | |
| CN103475453B (en) | Collaboration communication method based on random linear network encoding | |
| CN206807465U (en) | The multi-user quantum key distribution network structure of football alkene structure | |
| Gui et al. | Distributed best-route selection for multipath routing in cognitive radio ad hoc networks | |
| Seferoglu et al. | Distributed rate control for video streaming over wireless networks with intersession network coding | |
| Baik et al. | Generalized unequal error protection rateless codes for distributed wireless relay networks | |
| Xu et al. | Cache-aided interference management in partially connected linear networks | |
| Li et al. | Random network coding based on adaptive sliding window in wireless multicast networks | |
| Hu et al. | CoAOR: An efficient network coding aware opportunistic routing mechanism for wireless mesh networks | |
| Osseiran et al. | Advances in wireless network coding for IMT-Advanced & beyond |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181211 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |