CN104144461A - Multithread cooperation routing method for sensing interference - Google Patents
Multithread cooperation routing method for sensing interference Download PDFInfo
- Publication number
- CN104144461A CN104144461A CN201410089668.8A CN201410089668A CN104144461A CN 104144461 A CN104144461 A CN 104144461A CN 201410089668 A CN201410089668 A CN 201410089668A CN 104144461 A CN104144461 A CN 104144461A
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- link
- cooperative
- network
- 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
Abstract
The invention discloses a multithread cooperation routing method for sensing interference. According to the research on the method that cooperative transmission and direct transmission can be adopted among the nodes in a multi-hop cooperative wireless network, through combination of relay selection and channel distribution, the problem of cooperative routing sensitive in interference is researched, and a distributed and cooperative routing method design is provided. According to the method, in the process of building cooperative routing, channel distribution, optimal transmission mode selection and optimal cooperation node selection are finished. By means of the method, the optimal cooperative routing with the least interference is selected for multiple data flows in the network, and meanwhile, reasonable distribution of multiple channels in the wireless network in the multiple data flows is determined, so that end-to-end handling capacity of the network data flow is maximized, and the network delay is lowered.
Description
Technical field
The present invention relates to field of wireless, particularly relate to the wireless network of supporting cooperative communication technology, be specially a kind of multithread cooperative routing method that disturbs perception.
Background technology
Compare with MIMO technology, the cooperative communication technology of physical layer (Cooperative Communication) is the space diversity reception to communicate that is suitable for single antenna user.It utilizes the broadcast characteristic of wireless channel, and the physical resource that allows single antenna terminal equipment to share them in multi-user environment communicates, and forms virtual antenna array.The equipment of participation collaboration communication is forwarding information mutually, and a plurality of duplicates of same information can arrive receiving terminal by separate wireless channel, thereby obtains the gain of space diversity gain-collaboration diversity.
If Fig. 1 is simple 3 node cooperation traffic models.In this model, the transmission of signal is divided into two time slots: the first time slot is the broadcast stage, and information source S is to destination node D by broadcast transmission information, and now R can receive broadcasted information; The second time slot is the cooperation stage, cooperative node R by the package forward of receiving to destination node D.Information source S and cooperation node R form separate communication channel.A plurality of signal duplicates that transmitting terminal sends arrive receiving terminal by separate channel, just can produce diversity gain.Different treatments according to cooperative node to signal, at present 2 kinds of collaboration diversity schemes of main existence: amplification-forwarding (AF, amplify and forward), decoding-forward (DF, decode and forward).
As a kind of effective ways that can overcome channel fading, raising transmission capacity and reliability, extended coverage range and fall low-energy-consumption, the advantage of collaboration communication in single-hop wireless network confirmed, yet collaboration communication is applied to multi-hop wireless network, remains and have challenging problem.By physical layer cooperative communication technology and the combination of network layer Route Selection, design cross-layer routing scheme-cooperation route, becomes the solution that collaboration communication is applied to multi-hop wireless network.This scheme makes full use of the broadcast characteristic of wireless channel, and a plurality of nodes are formed to collaboration communication module, selects based on this optimal path, makes same information can arrive by different independent wireless channels the down hop of route.Like this, even in the situation that channel condition is more severe, still can guarantee the high reliability of network, for wireless user provides good network performance.
Due to the broadcast characteristic of wireless medium, between wireless transmission, exist channel competition to cause cochannel to disturb.Cochannel disturbs conflict and the re-transmission that causes data, has had a strong impact on the performance of network.Especially multi-hop wireless network, disturbs even the continuous double bounce of a data flow also exists serious cochannel, and along with the increase of jumping figure, throughput reduces end to end.Cochannel disturbs has become the outstanding problem that wireless multi-hop networks need to solve.And the cochannel that generally exists many data flow, the competition between multiple data stream more to aggravate wireless transmission in wireless multi-hop networks disturbs.Therefore the cochannel that reduces wireless transmission in the urgent need to carry out channel allocation when cooperating routing Design disturbs.
Many interfaces multi-channel wireless network can be equipped with many interfaces for each radio node.Existing research shows, than single interface network, many interfaces multichannel network can improve transmission performance and reliability and reduce cochannel and disturb.Yet existing cooperative routing method mainly concentrates on single interface multi-hop wireless network, study the cooperative routing method of considering interference effect under many interfaces multihop network environment, have challenge.
Many interfaces multi-channel wireless network can provide more resource for collaboration communication and cooperation route, make node can have larger space to select down hop forward node and collaboration relay node in sending the process of data, and can be good at the interference effect of avoiding cochannel to bring.In many interfaces multi-channel collaboration wireless network, the interference except between direct transmission node, also there is the interference between via node and via node, via node and the directly interference of transmission node.How in the situation that a plurality of data flow exist, carry out rational relay selection, combined channel distributes to design under many interfaces multichannel network and disturbs perception cooperative routing method, become and have challenging problem, also become the key and the difficult point that in many interfaces of multi-hop multichannel network, realize collaboration communication.
If Fig. 2 is in multi-hop collaborative network, if there are many concurrent streams, need to find for all simultaneous streamings the route that cooperates end to end.In figure, s represents source node, and d represents destination node, and numeral can be used as the intermediate node of routing node or collaboration relay node.Have two concurrent streams, source node is respectively from s0 and s1, and destination node is respectively d0 and d1, and solid black lines arrow represents data flow, and black dotted lines arrow expresses possibility and has collaboration relay node.The broken circle of grey has represented the interference range of node, only provides for convenience of description the interference range of cooperative node here.Article one, stream has selected 0,1, and 2 and 3 as routing node, and second stream has selected 5,8, and 9 and 10 as routing node.Suppose that the 3->d0 this jump selection 4 of article one stream is as cooperative node, because node 6 is in the interference range of node 4, to exist to disturb each other, if the now 5->8 this jump of second stream continues to select 6 as cooperative node, thereby the interference between two links will certainly the very large network performance that reduces.Candidate's cooperative node that therefore if the 5->8 this jump of second stream also has other not in the interference range of node 4 such as node 7, select node 7 can reduce the interference of two links as cooperative node, this is the disturbed condition that may exist between synergistic link.The situation of direct link and synergistic link can be seen second stream 10->d1 this jump, when having 11 and 12 two candidate's cooperative nodes simultaneously, select 12 than selecting 11 ideals, because select 11 to do interference that cooperative node brings to article one stream to do the interference that cooperative node brings large than selecting 12.As can be seen here, in wireless cooperative network, how to carry out the interference that relay selection reduces between link and have challenge meaning.
Summary of the invention
Technical problem to be solved by this invention is, not enough for prior art, a kind of multithread cooperative routing method that disturbs perception is provided, distributed earth is that many data flow in network select to disturb minimum optimum cooperation route, the reasonable distribution of a plurality of channels of simultaneously determining wireless network in many data flow, thereby the end-to-end throughput of maximization network data flow, reduces network delay.
For solving the problems of the technologies described above, the technical solution adopted in the present invention is: a kind of multithread cooperative routing method that disturbs perception, and the method is:
1) for the source node s of multi-hop cooperative wireless network network, when source node s need to be when certain destination node d communicates by letter, first source node s checks in its routing table whether have the route that arrives this destination node d, if had, according to the route in routing table, directly sends data; Otherwise source node s starts a route finding process according to following steps, by broadcast, select message RREQ to find an available route that arrives this destination node d:
A) calculate source node s to the route index of the link (s, z) between the neighbor node z of source node s, obtain s to the actual active volume P of z
sz;
B) by P
s=+∞ inserts in RREQ, P
srepresent that source node s, to the end-to-end active volume of s, then broadcasts this RREQ;
2), when intermediate node x receives the RREQ broadcasting from this intermediate node x upper hop node y, intermediate node x gets source node s to the end-to-end heap(ed) capacity P of node y from the RREQ of upper hop node y broadcast
ywith the actual active volume P of node y to intermediate node x
yx, utilize P
x'=min (P
yx, P
y) calculate intermediate node x to the P of heap(ed) capacity end to end of source node s
x', and process according to the following steps the RREQ that intermediate node x receives:
If a) intermediate node x is not the RREQ receiving for the first time from source node s broadcast, and P
x' <P
x, intermediate node x abandons the current RREQ receiving and no longer continues to forward, wherein P
xthe intermediate node x that the RREQ that expression is received according to intermediate node x before current time calculates is to the heap(ed) capacity end to end of source node s, and described heap(ed) capacity is kept in intermediate node x;
B) if intermediate node x is not destination node d, and in intermediate node x routing table, do not arrive the route of destination node d, first intermediate node x upgrades oneself to the end-to-end heap(ed) capacity P of source node s
x, i.e. P
x=P
x', then calculate respectively intermediate node x to the route index of the link of its all neighbor nodes, and by calculated all route indexs, and reach the selected channel of each route index, link transmission pattern, if link transmission pattern is collaboration communication pattern, calculate the optimum collaboration relay node of link corresponding to the route index that reaches under this collaboration communication pattern, above-mentioned information is inserted in the RREQ that intermediate node x receives, finally the P of heap(ed) capacity end to end to intermediate node x by source node s
xalso be inserted in the RREQ that intermediate node x receives, obtain the RREQ that upgrades, the RREQ that intermediate node x broadcast is upgraded;
C) if intermediate node x is destination node d, or while having the route that arrives destination node d in intermediate node x routing table, intermediate node x generates a RREP routing reply message, described RREP routing reply message comprises selected link, the communication channel of every hop link and link transmission pattern, and link is used the optimum collaboration relay node under cooperation transmission pattern;
2) in multi-hop cooperative wireless network network, arbitrary node l receives after RREP routing reply message, if selected route comprises node l, node l distributes the channel of transmission according to above-mentioned RREP routing reply message, link transmission pattern and cooperative node, if that is: channel to be allocated is not also used by the arbitrary network interface of node l, certain idle interface to node l by this channel allocation to be allocated, and this channel to be allocated is added to the working channel collection of ingress l, the available work channel set of new node l more, if node l selects cooperation transmission pattern, control channel broadcast Hello information is given cooperative node to be confirmed, and the idle network interface of channel allocation to be allocated being given to this cooperative node to be confirmed.
The present invention calculates the route index of link by following route index calculating method:
1) for any channel ch
w∈ FCH (i, j), FCH (i, j) is the alternative channel set of multi-hop cooperative wireless network network link (i, j), by step below, calculates the maximum available transmission capacity under this channel:
If a) in multi-hop cooperative wireless network network node i and node j at channel ch
wthe direct transmission mode of upper employing: in statistics multi-hop cooperative wireless network network with link (i, j, ch
w) the link number disturbed mutually, be designated as
utilize formula
computing node i and node j are at ch
wadopt the link active volume C under directly transmission
dT(i, j, ch
w), C (i, j, ch wherein
w) be while not considering to disturb, the node i of calculating according to Shannon's theorems and node j adopt the channel capacity of direct communication;
B) if node i and node j at channel ch
wupper employing cooperation transmission pattern: all alternative cooperative node of traversal in the communication range of node i and node j, in statistics multi-hop cooperative wireless network network with link (i, j, k, ch
w) the link number disturbed mutually, be designated as
utilize formula
Computing node i and node j are at channel ch
wadopt alternative cooperative node k to help the link active volume C of lower cooperation transmission
cC(i, j, k, ch
w), C (i, j, k, ch wherein
w) be while not considering to disturb, the node i of calculating according to Shannon's theorems and node j adopt alternative cooperative node k to help the channel capacity of lower cooperation transmission; Using available transfer capability maximum in all alternative cooperative nodes as node i, arrive the active volume that node j adopts cooperation transmission,
Wherein N (i) and N (j) represent the neighbor node collection of node i and node j, and select
as node i, j is at channel ch
wunder the optimum collaboration relay node of cooperation transmission;
C) relatively at channel ch
wlower link (i, j) is used the directly active volume C of transmission
dT(i, j, ch
w) and use the active volume C of cooperation transmission
cC(i, j, k, ch
w), select C
dT(i, j, ch
w), C
cC(i, j, k, ch
w) in peaked as this link (i, j) at channel ch
wunder active volume C (i, j, ch
w), i.e. C (i, j, ch
w)=max{C
dT(i, j, ch
w), C
cC(i, j, k, ch
w), transmission mode and via node that this maximum is corresponding are defined as node i, the ch that j is used
wtransmission pattern and via node;
2) utilize following formula to determine the route index C (i, j) of link (i, j):
And finally determine transmission mode, the via node of link (i, j) and use channel according to C (i, j).
Definite method of the alternative channel set FCH (i, j) of link (i, j) is:
1) if the number of the working channel collection CH (i) of node i is less than the number of ports M of each network node in multi-hop cooperative wireless network network, the available work channel set ACH (i) of node i gets all orthogonal channels, i.e. ACH (i)={ ch
1, ch
2..., ch
n, otherwise the available work channel set of node i equals working channel collection itself: ACH (i)=CH (i), in like manner calculates the available work channel set ACH (j) of node j;
2) the alternative channel set FCH (i, j) of link (i, j) is FCH (i, j)=ACH (i) ∩ ACH (j)-{ ch
1, ch wherein
1the control channel for transmitting control message (as RREQ and RREP message) that represents each node fixed allocation in multi-hop cooperative wireless network network, each node has a network interface unit to distribute use ch
1.
Compared with prior art, the beneficial effect that the present invention has is: the present invention can effectively solve the interference effect problem between many data flow, distributed earth is that many data flow in network select to disturb minimum optimum cooperation route, the reasonable distribution of a plurality of channels of simultaneously determining wireless network in many data flow, thereby the end-to-end throughput of maximization network data flow, has reduced network delay.
Accompanying drawing explanation
Fig. 1 is collaboration communication model schematic diagram;
Fig. 2 is the scene schematic diagram of network model of the present invention;
Fig. 3 is 1 route finding process schematic diagram in the claims in the present invention book, Fig. 3 (a) network topological diagram; Fig. 3 (b) link (i, j) local interference schematic diagram;
Fig. 4 is that same network topology changes the result schematic diagram under stream quantity term under identical experimental configuration; The network polymerization throughput result schematic diagram of Fig. 4 (a) for obtaining; The network data flow minimum throughout result schematic diagram of Fig. 4 (b) for obtaining; The network total delay result schematic diagram of Fig. 4 (c) for obtaining; The network data flow maximum delay result schematic diagram of Fig. 4 (d) for obtaining.
Fig. 5 is that same network topology changes the result schematic diagram under node density condition under identical experimental configuration; The network polymerization throughput result schematic diagram of Fig. 5 (a) for obtaining; The network data flow minimum throughout result schematic diagram of Fig. 5 (b) for obtaining; The network total delay result schematic diagram of Fig. 5 (c) for obtaining; The network data flow maximum delay result schematic diagram of Fig. 5 (d) for obtaining.
Fig. 6 is that same network topology changes the result schematic diagram under transmission range condition under identical experimental configuration; The network polymerization throughput result schematic diagram of Fig. 6 (a) for obtaining; The network data flow minimum throughout result schematic diagram of Fig. 6 (b) for obtaining; The network total delay result schematic diagram of Fig. 6 (c) for obtaining; The network data flow maximum delay result schematic diagram of Fig. 6 (d) for obtaining.
Fig. 7 is that same network topology changes the result schematic diagram under node interface quantity term under identical experimental configuration; The network polymerization throughput result schematic diagram of Fig. 7 (a) for obtaining; The network data flow minimum throughout result schematic diagram of Fig. 7 (b) for obtaining; The network total delay result schematic diagram of Fig. 7 (c) for obtaining; The network data flow maximum delay result schematic diagram of Fig. 7 (d) for obtaining.
Fig. 8 is that same network topology changes the result schematic diagram under network channel quantity term under identical experimental configuration; The network polymerization throughput result schematic diagram of Fig. 8 (a) for obtaining; The network data flow minimum throughout result schematic diagram of Fig. 8 (b) for obtaining; The network total delay result schematic diagram of Fig. 8 (c) for obtaining; The network data flow maximum delay result schematic diagram of Fig. 8 (d) for obtaining.
Embodiment
The present invention calculates the available alternative channel set FCH (i, j) between two node i and j according to step below:
1), if when the number of node i working channel collection CH (i) is less than number of ports M, also have idle interface to be used for any allocated channel, so node i available work channel set ACH (i) get all orthogonal channels, i.e. ACH (i)={ ch
1, ch
2..., ch
n, otherwise available work channel set equals working channel collection itself: ACH (i)=CH (i), in like manner calculates the available work channel set ACH (j) of node j;
2) the alternative channel set FCH (i, j) of link (i, j) is FCH (i, j)=ACH (i) ∩ ACH (j)-{ ch
1.The present invention calculates the cooperation route index of the interference perception of the link of (i, j) between any two adjacent node i and j according to the following steps:
1) for any channel ch
w∈ FCH (i, j), calculates the maximum available transmission capacity under this channel by step below;
If A. node i and node j are at channel ch
wthe direct transmission mode of upper employing, the maximum available under directly transmitting by step calculating below:
A) in statistics network with link (i, j, ch
w) the link number disturbed mutually, be designated as
B) node i and node j at ch
wadopt the actual active volume of link under direct communication to be calculated as
c (i, j, ch wherein
w) be the channel capacity that the node i calculated according to Shannon's theorems while not considering to disturb and node j adopt direct communication;
If B. node i and node j are at channel ch
wupper employing cooperation transmission pattern, the node of all whiles in the communication range of node i and node j now, can be as alternative cooperative transmission node, when determining maximum transfer capacity, need to determine optimum cooperative transmission node, the present invention passes through step below and calculates the maximum available transmission capacity under cooperation transmission:
A) all node k of the node of traversal in the communication range of node i and node j, in statistics network with link (i, j, k, ch
w) the link number disturbed mutually, be designated as
B) node i and node j at ch
wadopt node k to help the actual active volume of link of lower cooperation transmission to be calculated as
c (i, j, k, ch wherein
w) be that node i and the node j calculating according to Shannon's theorems while not considering to disturb adopts node k to help the channel capacity of lower cooperation transmission;
C) node i is available transfer capability maximum in all alternative cooperative nodes to the active volume of node j employing cooperation transmission,
And this node k is elected to be to i, the cooperative node of j transmission.
C. relatively at channel ch
wlower link (i, j) is used the directly active volume C of transmission
dT(i, j, ch
w) and use the active volume C of cooperation transmission
cC(i, j, k, ch
w), select this link (i, j) of maximum conduct at channel ch
wlower active volume C (i, j, ch
w), i.e. C (i, j, ch
w)=max{C
dT(i, j, ch
w), C
cC(i, j, k, ch
w), transmission mode now and via node are defined as to i, j is used ch
wtransmission pattern and via node.
2) the route index of link (i, j) is active volume maximum in all alternative available channels,
And according to this index, finally determine the transmission mode of link (i, j), via node and use channel.
When the present invention carries out Route Selection, node is mainly divided into following several for the processing mode of receiving message:
1), for source node, when source node need to communicate with certain destination node d, first source node checks in its routing table whether have the route that arrives this destination node d, if had, according to the route in routing table, directly sends data; Otherwise source node s starts a route finding process according to following steps finds an available route that arrives this destination node d by broadcast RREQ packet:
A. source node s calculates it according to route index calculating method in claim 2 and arrives neighbor node as link (s, z) the route index between z, and s is designated as P to the actual active volume of z
sz, by the P calculating
szbe inserted in RREQ;
B. by P
s=+∞ inserts in RREQ, and wherein Ps represents the end-to-end maximum available from source node s to node s, then broadcasts this RREQ.
2) when intermediate node x receives the broadcast RREQ from its upper hop node y, node x is with can get P from RREQ
y(being that s is to the end-to-end heap(ed) capacity of y) and P
yx(the actual active volume from y to x, utilizes claim 2 to calculate).Node x utilizes P
x'=min (P
yx, P
y) calculate oneself to the P of heap(ed) capacity end to end of source node
xand process according to the following steps the RREQ receiving:
If A. node x is not the RREQ receiving for the first time from source node s, and P
x' <P
x, P wherein
xbefore representing, receive the heap(ed) capacity end to end calculating after the RREQ from source node s and be kept in node x, node abandons current RREQ and no longer continues to forward;
B. otherwise, if node x is not neither while arriving the route of destination node d in destination node and its routing table yet, first node x upgrades oneself is this moment P to the end-to-end maximum throughput of source node
x=P
x', then according to route index calculating method in claim 2, calculate respectively neighbor node as the route index that the maximum route index between z is link (x, z), be designated as P
xz, it is inserted in RREQ, finally the P of maximum throughput end to end to node x by source node
xalso be inserted in RREQ, broadcast this RREQ;
If C. node x is that while having the route that arrives destination node d in destination node or routing table, node x generates a RouteReply(RREP);
D. after the selected route of the data flow for known, the channel of data flow upper network node, transmission mode and cooperative node also distribute in the routing reply stage according to RREP message thereupon.When node i is received after routing reply RREP, if channel ch to be allocated
walso do not used by channel ch
wdistribute to certain idle interface, and by ch
wadd CH (i), more the available work channel set ACH (i) of new node, if then this node is selected cooperation transmission pattern, utilizes control channel broadcast Hello information to cooperative node to be confirmed and distributes ch
wgive the idle data interface of this cooperative node.
The present invention considers the network scenarios that in a wireless multi-hop collaborative network, multithread is disturbed, this scene is comprised of F bar stream, between node, can directly transmit also can cooperation transmission, network scenarios as shown in Figure 2, in dashed rectangle, indicated cooperation transmission and direct mode, broken circle represents the interference range of cooperative node.
Fig. 3 is the process of 1 acquisition data flow cooperation route in the claims in the present invention, and node determines selected channel and cooperative node to its neighbor node by broadcast, final definite cooperation route.In the example of Fig. 3 (a), in network, existing two data flow, are shown in that, shown in solid black lines arrow, broken circle represents the interference range of its link, separately have node S to send route requests and find one to the path of destination node D, see dotted arrow.
When node i broadcast data packet is given its neighbor node j(or node g) time, execute claims book 3 and take to determine whether to be link (i, j) allocated channel.If two node available alternative channel set FCH (i, j) be not empty, according to claims 2, select optimum channel, by calculating the interfering link of this jump link, as shown in Fig. 3 (b), (comprise direct transmission link and cooperation transmission link).Link (i, j) around exist one can cooperative node g, when calculating link (i, j) interfering link except considering that directly transmitting situation also will consider to add the cooperation transmission situation after this via node.Therefore for i, arrive j this jump, the synergistic link that note node g participates in cooperation transmission is (i, j, g), be directly transmitted as link (i, j), after disturbing modeling, obtain respectively under these two kinds of patterns and (i, j) interfering link of cochannel, calculates its heap(ed) capacity, is link selection optimum channel.
With (i, j, g) under cooperation transmission pattern in Fig. 3 (b) for example, as selective channel ch
4time, can obtain two interfering links under cochannel for (n, p, o), (f, d
1), link (i, j) is used channel ch
4while directly transmitting, actual capacity is C
cC(i, j, g, ch
4)=C(i, j, g)/3, if (i, j) selects ch under direct transmission mode
4time the interfering link number that obtains be 1, actual capacity is C
dT(i, j, ch
4)=C(i, j)/2, suppose that (i, j) adds cooperative node g at channel ch
4under actual capacity be greater than direct transmission capacity, link (i, j) is used cooperation transmission to be better than direct transmission, executes claims book 2.2, travels through channel in all alternative channel sets and finally determines transmission mode, via node and the optimum channel of link.
Mode by emulation experiment illustrates the specific embodiment of the present invention below, and by with other embodiment relatively verify validity of the present invention.Emulation experiment has realized six kinds of different method for routing, first method is the channel allocation cooperative routing method based on disturbing perception that the present invention proposes, be designated as JCRAC, second method is that the interference channel perception proposing according to the present invention distributes method for routing, is designated as IDTRA.Whether the main difference of these two kinds of methods is used collaboration communication.Third and fourth two kinds of methods have been used accidental channel distribution.And the third method is used collaboration communication, note the method RandChlCT by name, and the 4th kind of method just used directly transmission, note the method RandChlDT by name.Five, 6 two kinds of methods are only applicable to single-channel situation.Difference is to be also whether use collaboration communication, is designated as respectively ICT and HOP.Under identical scene and experiment arrange, use Java programming to realize above method and carry out emulation experiment, we have compared the parameters such as the network polymerization throughput under various flows quantity, node density, transmission range, interface number and channel number, data flow minimum throughout, network total delay and network maximum delay of these six kinds of distinct methods.
In the arranging of emulation experiment, at 1000m * 1000m
2under such network scenarios, random layout node carries out test of many times, and under default situations, each node has 6 interfaces, and available channel number is 12, and between defining node, transmission range is 250m, and interference range is 550m.In addition, for the ease of calculating, suppose h
m,nthe free-space loss between node m and node n, and | h
m,n|
2=|| m, n||
-4, wherein || m, the distance between n|| dactylus point m and node n, the path loss factor is 4.So suppose that the noise of node is 10
-10w.
Fig. 4 changes the result that fluxion measures under same network topology.As the network polymerization throughput result schematic diagram of Fig. 4 (a) for obtaining, the network data flow minimum throughout result schematic diagram of Fig. 4 (b) for obtaining, the network total delay result schematic diagram of Fig. 4 (c) for obtaining, the network data flow maximum delay result schematic diagram of Fig. 4 (d) for obtaining.Increase along with stream, network polymerization throughput all presents increase tendency, but the throughput of single current presents downward trend, after visible increase stream, in network, disturb and also can increase so have influence on the throughput of other streams, but throughput of system does not also arrive saturated so network throughput and presents ascendant trend, and total delay is also the trend of rising overally.Can obviously see that the method that the present invention proposes can well avoid interference, aggregate throughput is than other algorithms (IDTRA, RandChlCT, RandChlDT, ICT, HOP) to exceed successively 23.761%, 94.586%, 168.468%, 842.782%, 711.972%, total delay reduces by 20.112%, 25.82%, 45.916% successively, 88.606%, 85.583%.
Fig. 5 result that for a change node density is used same network topology to obtain.Increase along with network node, network polymerization throughput all presents increase tendency, but the throughput of single current also presents ascendant trend, after visible increase node, in network, optional node is also more, can select than more excellent before node, therefore network throughput presents ascendant trend, and total delay is on a declining curve.Can obviously see that the method that the present invention proposes can well avoid interference the more excellent node of selection, aggregate throughput is than other algorithms IDTRA, RandChlCT, RandChlDT, ICT, HOP) to exceed successively 17.516%, 110.951%, 158.813%, 605.162%, 653.444%, total delay reduces by 14.721% successively, 30.485%, 42.579%; 84.461%, 85.962%.
Fig. 6 changes the result that node transmission range obtains under same network topology.Increase along with transmission range, network polymerization throughput all presents and first increases the trend subtracting afterwards, and the throughput of single current also presents ascendant trend, increases as seen after transmission range and disturbs obviously and increase in network, therefore network throughput presents first to rise after rising and falls trend, total delay present first decline after ascendant trend.Can obviously see that the method that the present invention proposes can well avoid interference selection, aggregate throughput is than other algorithms (IDTRA, RandChlCT, RandChlDT, ICT, HOP) to exceed successively 24.152%, 150.161%, 268.504%, 739.501%, 682.354%, total delay reduces by 15.652%, 24.223%, 48.003% successively, 88.669%, 87.18%.
Fig. 7 changes the result that node interface number obtains under same network topology.Along with number of ports object increases, network polymerization throughput all presents the trend of growth, and the throughput of single current also presents ascendant trend, increases as seen after interface number, node has unnecessary interface for channel allocation, has strengthened network connectivty and has made node have more more excellent nodes to select.Therefore network throughput presents growth trend, and total delay presents downward trend.Can obviously see that the method that the present invention proposes can well reduce interference, aggregate throughput is than other algorithms (IDTRA, RandChlCT, RandChlDT, ICT, HOP) to exceed successively 16.44%, 137.012%, 203.016%, 859.289%, 698.529%, total delay reduces by 14.478%, 37.263%, 47.154% successively, 89.721%, 86.462%.
Fig. 8 changes the result that channel number obtains under same network topology.Along with the increase of channel number, network polymerization throughput all presents the trend of growth, and the throughput of single current also presents ascendant trend, network total delay presents downward trend, after visible increase channel number, the alternative channel of node increases, and can better reduce the interference that cochannel brings.Therefore network throughput presents growth trend, and total delay presents downward trend.Can obviously see that the aggregate throughput of the method that the present invention proposes is than other algorithms (IDTRA, RandChlCT, RandChlDT, ICT, HOP) to exceed successively 20.266%, 109.042%, 160.087%, 663.496%, 535.545%, total delay reduces by 14.258% successively, 40.911%, 46.461%, 86.171%, 81.786%.
Therefore, the simulation experiment result shows that the method for channel allocation that the present invention proposes can effectively solve the interference effect problem between many data flow, and can improve the throughput reduction network delay of data flow.
Claims (3)
1. a multithread cooperative routing method that disturbs perception, is characterized in that, the method is:
1) for the source node s of multi-hop cooperative wireless network network, when source node s need to be when certain destination node d communicates by letter, first source node s checks in its routing table whether have the route that arrives this destination node d, if had, according to the route in routing table, directly sends data; Otherwise source node s starts a route finding process according to following steps, by broadcast, select message RREQ to find an available route that arrives this destination node d:
A) calculate source node s to the route index of the link (s, z) between the neighbor node z of source node s, obtain s to the actual active volume P of z
sz;
B) by P
s=+∞ inserts in RREQ, P
srepresent that source node s, to the end-to-end active volume of s, then broadcasts this RREQ;
2), when intermediate node x receives the RREQ broadcasting from this intermediate node x upper hop node y, intermediate node x gets source node s to the end-to-end heap(ed) capacity P of node y from the RREQ of upper hop node y broadcast
ywith the actual active volume P of node y to intermediate node x
yx, utilize P
x'=min (P
yx, P
y) calculate intermediate node x to the P of heap(ed) capacity end to end of source node s
x', and process according to the following steps the RREQ that intermediate node x receives:
If a) intermediate node x is not the RREQ receiving for the first time from source node s broadcast, and P
x' <P
x, intermediate node x abandons the current RREQ receiving and no longer continues to forward, wherein P
xthe intermediate node x that the RREQ that expression is received according to intermediate node x before current time calculates is to the heap(ed) capacity end to end of source node s, and described heap(ed) capacity is kept in intermediate node x;
B) if intermediate node x is not destination node d, and in intermediate node x routing table, do not arrive the route of destination node d, first intermediate node x upgrades oneself to the end-to-end heap(ed) capacity P of source node s
x, i.e. P
x=P
x', then calculate respectively intermediate node x to the route index of the link of its all neighbor nodes, and by calculated all route indexs, and reach the selected channel of each route index, link transmission pattern, if link transmission pattern is collaboration communication pattern, calculate the optimum collaboration relay node of link corresponding to the route index that reaches under this collaboration communication pattern, above-mentioned information is inserted in the RREQ that intermediate node x receives, finally the P of heap(ed) capacity end to end to intermediate node x by source node s
xalso be inserted in the RREQ that intermediate node x receives, obtain the RREQ that upgrades, the RREQ that intermediate node x broadcast is upgraded;
C) if intermediate node x is destination node d, or while having the route that arrives destination node d in intermediate node x routing table, intermediate node x generates a RREP routing reply message, described RREP routing reply message comprises selected link, the communication channel of every hop link and link transmission pattern, and the optimum collaboration relay node under link use cooperation transmission pattern;
3) in multi-hop cooperative wireless network network, arbitrary node l receives after RREP routing reply message, if selected route comprises node l, node l distributes the channel of transmission according to above-mentioned RREP routing reply message, link transmission pattern, and when link adopts collaboration communication, node l can select the cooperative node of communication, if that is: channel to be allocated is not also used by the arbitrary network interface of node l, certain idle interface to node l by this channel allocation to be allocated, and this channel to be allocated is added to the working channel collection of ingress l, the available work channel set of new node l more, if node l selects cooperation transmission pattern, control channel broadcast Hello information is given cooperative node to be confirmed, and the idle network interface of channel allocation to be allocated being given to this cooperative node to be confirmed.
2. the multithread cooperative routing method of interference perception according to claim 1, is characterized in that, calculates the route index of link by following route index calculating method:
1) for any channel ch
w∈ FCH (i, j), FCH (i, j) is the alternative channel set of multi-hop cooperative wireless network network link (i, j), by step below, calculates the maximum available transmission capacity under this channel:
If a) in multi-hop cooperative wireless network network node i and node j at channel ch
wthe direct transmission mode of upper employing: in statistics multi-hop cooperative wireless network network with link (i, j, ch
w) the link number disturbed mutually, be designated as
utilize formula
computing node i and node j are at ch
wadopt the link active volume C under directly transmission
dT(i, j, ch
w), C (i, j, ch wherein
w) be while not considering to disturb, the node i of calculating according to Shannon's theorems and node j adopt the channel capacity of direct communication;
B) if node i and node j at channel ch
wupper employing cooperation transmission pattern: all alternative cooperative node of traversal in the communication range of node i and node j, in statistics multi-hop cooperative wireless network network with link (i, j, k, ch
w) the link number disturbed mutually, be designated as
utilize formula
Computing node i and node j are at channel ch
wadopt alternative cooperative node k to help the link active volume C of lower cooperation transmission
cC(i, j, k, ch
w), C (i, j, k, ch wherein
w) be while not considering to disturb, the node i of calculating according to Shannon's theorems and node j adopt alternative cooperative node k to help the channel capacity of lower cooperation transmission; Using available transfer capability maximum in all alternative cooperative nodes as node i, arrive the active volume that node j adopts cooperation transmission,
Wherein N (i) and N (j) represent the neighbor node collection of node i and node j, and select
as node i, j is at channel ch
wunder the optimum collaboration relay node of cooperation transmission;
C) relatively at channel ch
wlower link (i, j) is used the directly active volume C of transmission
dT(i, j, ch
w) and use the active volume C of cooperation transmission
cC(i, j, k, ch
w), select C
dT(i, j, ch
w), C
cC(i, j, k, ch
w) in peaked as this link (i, j) at channel ch
wunder active volume C (i, j, ch
w), i.e. C (i, j, ch
w)=max{C
dT(i, j, ch
w), C
cC(i, j, k, ch
w), transmission mode and collaboration relay node that this maximum is corresponding are defined as node i, the ch that j is used
wtransmission pattern and collaboration relay node;
2) utilize following formula to determine the route index C (i, j) of link (i, j):
And determine transmission mode, the via node of link (i, j) and use channel according to C (i, j) value is final.
3. the multithread cooperative routing method of interference perception according to claim 2, is characterized in that, definite method of the alternative channel set FCH (i, j) of link (i, j) is:
1) if the number of the working channel collection CH (i) of node i is less than the number of ports M of each network node in multi-hop cooperative wireless network network, the available work channel set ACH (i) of node i gets all orthogonal channels, i.e. ACH (i)={ ch
1, ch
2..., ch
n, otherwise the available work channel set of node i equals working channel collection itself: ACH (i)=CH (i), in like manner calculates the available work channel set ACH (j) of node j;
2) the alternative channel set FCH (i, j) of link (i, j) is FCH (i, j)=ACH (i) ∩ ACH (j)-{ ch
1, ch wherein
1the control channel for transmitting control message that represents each node fixed allocation in multi-hop cooperative wireless network network, each node has a network interface unit to distribute use ch
1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410089668.8A CN104144461B (en) | 2014-03-12 | 2014-03-12 | It is a kind of to disturb the multithread cooperative routing method perceived |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410089668.8A CN104144461B (en) | 2014-03-12 | 2014-03-12 | It is a kind of to disturb the multithread cooperative routing method perceived |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104144461A true CN104144461A (en) | 2014-11-12 |
| CN104144461B CN104144461B (en) | 2017-12-01 |
Family
ID=51853509
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410089668.8A Active CN104144461B (en) | 2014-03-12 | 2014-03-12 | It is a kind of to disturb the multithread cooperative routing method perceived |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104144461B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454752A (en) * | 2015-08-06 | 2017-02-22 | 北京信威通信技术股份有限公司 | Broadcast information transmission method in 3GPP V2X communication |
| WO2020073586A1 (en) * | 2018-10-09 | 2020-04-16 | 长沙理工大学 | Interference-aware wireless energy-carrying transfer routing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020173310A1 (en) * | 2001-05-17 | 2002-11-21 | Koichi Ebata | Method of selecting base station, and mobile station, base station, and recording medium recording program |
| US20110110255A1 (en) * | 2009-11-06 | 2011-05-12 | Samsung Electronics Co., Ltd. | Apparatus and method for avoiding channel interference in a multi-channel sensor network |
| CN103096413A (en) * | 2013-02-21 | 2013-05-08 | 湖南大学 | Multi-interface multi-hop wireless network lower-distribution type cooperation route method |
-
2014
- 2014-03-12 CN CN201410089668.8A patent/CN104144461B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020173310A1 (en) * | 2001-05-17 | 2002-11-21 | Koichi Ebata | Method of selecting base station, and mobile station, base station, and recording medium recording program |
| US20110110255A1 (en) * | 2009-11-06 | 2011-05-12 | Samsung Electronics Co., Ltd. | Apparatus and method for avoiding channel interference in a multi-channel sensor network |
| CN103096413A (en) * | 2013-02-21 | 2013-05-08 | 湖南大学 | Multi-interface multi-hop wireless network lower-distribution type cooperation route method |
Non-Patent Citations (1)
| Title |
|---|
| 陶洋等: "一种基于干扰感知的网络编码意识路由", 《电脑知识与技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454752A (en) * | 2015-08-06 | 2017-02-22 | 北京信威通信技术股份有限公司 | Broadcast information transmission method in 3GPP V2X communication |
| WO2020073586A1 (en) * | 2018-10-09 | 2020-04-16 | 长沙理工大学 | Interference-aware wireless energy-carrying transfer routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104144461B (en) | 2017-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pan et al. | Cooperative communication aware link scheduling for cognitive vehicular networks | |
| CN1918858B (en) | Cost determination in a multihop network | |
| Wang et al. | Embracing interference in ad hoc networks using joint routing and scheduling with multiple packet reception | |
| Dong et al. | Performance analysis of multihop-diversity-aided multihop links | |
| CN110891294B (en) | Wireless ad hoc network routing method based on service type | |
| CN107771404A (en) | Path selection in wireless mesh network | |
| CN105993186A (en) | System and method for virtual multi-point transceivers | |
| CN104066142B (en) | The method and device of data transfer path in a kind of determination wireless sensor network | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| CN103096413B (en) | Distributed collaborative method for routing under a kind of multiplex roles multi-hop wireless network | |
| CN104822170B (en) | A kind of cooperating relay system of selection based on node type | |
| CN103596276A (en) | Wireless network channel distribution strategy based on channel interval | |
| CN103607745A (en) | Method for combining opportunistic routing selection and channel allocation in wireless network | |
| CN104994582A (en) | Wireless network scheduling method based on serial interference cancellation and power control | |
| CN111132236A (en) | Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol | |
| CN101729335A (en) | Wireless node | |
| CN103458470B (en) | Based on the transmission method of QoS in cognitive relay system | |
| CN104144461A (en) | Multithread cooperation routing method for sensing interference | |
| CN106255171B (en) | Realize the method and its application of the cross-layer cooperation transport protocol in multi-hop wireless self-organizing network | |
| Qadir et al. | Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks | |
| CN101808328A (en) | A kind of half distributed via node distribution method | |
| CN201355813Y (en) | Wireless node | |
| CN103607744B (en) | A kind of chance method for routing of many radio frequencies multi-channel wireless net mesh network channel-aware | |
| CN103188783B (en) | A kind of data relay method, system and via node |
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 |