CN104185242B - A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method - Google Patents
A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method Download PDFInfo
- Publication number
- CN104185242B CN104185242B CN201410462227.8A CN201410462227A CN104185242B CN 104185242 B CN104185242 B CN 104185242B CN 201410462227 A CN201410462227 A CN 201410462227A CN 104185242 B CN104185242 B CN 104185242B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- node
- channel
- link
- 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.)
- Expired - Fee Related
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method, and it includes channel assignment step and route pathfinding step：（1）Calculate most short hop count and be layered；（2）Calculate neighbours' number and node load；（3）Channel distribution is carried out according to heuristic method for channel allocation according to interference weight；（4）Intermediate node RX path request message, calculate upper hop MCDI and added up, consider to flow interior and inter-stream interference when calculating MCDI；（5）By obtained value compared with the value stored in routing table, the minimum path request message of MCDI values is replied and establishes path.The present invention proposes a kind of static channel allocation method based on link load weight, reach the purpose for minimizing the interference between link in network, then interference and inter-stream interference factor in stream are taken into full account in Route Selection, obtain optimal path, the handling capacity in network is improved, reduces delay.
Description
Technical field
The present invention relates to more radio frequency multi-Channel Wireless Mesh Network channel distributions and routing optimality, more particularly to a kind of reduction
The wireless Mesh netword channel distribution of interference and route combined optimization system and method.
Background technology
Wireless Mesh netword receives more and more higher with the features such as its special network structure, high coverage rate, high reliability
Concern, more and more widely applied to radio communication, it is considered to be future wireless system development key technology.Wireless Mesh
Return network Organization Chart is as shown in Figure 1.But with requirement of the application in wireless Mesh netword to data transmission performance increasingly
Improve so that the requirement such as capacity, delay to wireless Mesh netword also more and more higher.
In face of this problem, industry proposes various solution methods：More radio frequency multichannel technology, network coding technique and dynamics
Cluster technology etc., raising wireless Mesh netword performance that can be to a certain extent.And more radio frequency multichannel technologies are to performance boost
It is the most obvious, how to carry out the difficulties that effectively quick correctly channel distribution is still wireless Mesh netword.Therefore it is right
The research of method for channel allocation has higher theoretical research value and actual application prospect.Method for channel allocation is divided into static letter
Channel allocation method, dynamic channel assignment method and hybrid channel assignment method.Static channel allocation method refers to for radio frequency mouth point
The channel matched somebody with somebody immobilize or in the period of one considerably long in keep constant；Dynamic channel assignment method refers to for any radio frequency
Any channel of port assignment, and the channel of prevention at radio-frequency port is not fixed, but dynamic translation can be carried out；Mixed channel
Distribution method combines the characteristics of static channel allocation and dynamically distributes, and the channel of a part of radio frequency interface distribution of node is fixed
Constant, the channel of another part prevention at radio-frequency port distribution can then need to carry out dynamic translation according to transmission.
The patent of Application No. 201210123432.2 discloses to be distributed in a kind of more wireless radiofrequency Mesh networks of multichannel
Formula method for channel allocation, the patent define a kind of criterion WA_ETT, when distributing channel to link, calculate this link and exist
WA_ETT sizes on each channel, the minimum channel distributions of WA_ETT are then selected to be used to link in routing procedure
Route metric criterion EWCETT is as route criterion；This scheme distributes channel during pathfinding, exists in a network a plurality of
When data flow, or even when common node between data flow is more, channel distribution of the program to common node
Number is more, then requires higher to the number of ports of node, if the excessive interface of each node equipment, cost is too high, Er Qiefang
EWCETT is calculated in case to determine to select the method for optimal path to be only suitable for source routing, is not suitable for routeing one by one, there is limitation.And
The present invention according to node topology, uses node priority and closeness to load weight for link calculation, then according to negative first
Weight distribution channel is carried, the mode of this static allocation channel sufficiently make use of Internet resources, in a network actual number of transfers
Will not also have an impact when according to stream to network topology, docking port number it is less demanding, it is cost-effective, and in channel distribution
After completion, the problem of considering to flow interior interference and inter-stream interference on path when computation measure of the invention, calculated in invention
MCDI (Metric of Channel Diversity Index, channel diversity indices measurement) measurement that optimal path uses
Suitable various Routing Protocols, scalability are relatively good.
The patent of Application No. 201110021937.3 disclose it is a kind of based on topological optimization and reduce interference it is wireless
Mesh network routed channels combined distributing method, the program are tied by the topology distributed based on traffic aware and flow equitable first
Topological structure is converted into tree structure by structure greedy algorithm, the topological structure formed after optimization, then the Mesh after optimization is opened up
Flutter structure to be routed using AODV, the heuristic channel allocation algorithm of two steps then carried out to link, in the program for
Network topology needs to optimize, and topology is first converted into tree, this structure change can cause patrolling for network topology
Collect annexation and actual annexation is not inconsistent, it is likely that cause to need to get to by multi-hop on the contrary between adjacent node,
Transmission delay, while flow all in this tree network are added, either goes out the data that net networks still in net
It is required for forwarding by root node, can causes to load seriously around root node.And in the present invention it is the position by gateway node
It is real so as to come to set different priority for different nodes and consider neighbours' number around node to calculate link load
Existing channel distribution, it is contemplated that the flow style issues in network, while the present invention do not change the Topology connection situation of network, root
Come to distribute channel for link according to topology, the data in network will not be forwarded all from root node, reduce the load of root node, so
Interference and inter-stream interference, channel distribution and Route Selection combined optimization in stream are added in routing procedure afterwards and realizes carrying for performance
Rise.
The patent of Application No. 201310112381.8 discloses a kind of link for multi-Channel Wireless Mesh Network point
Then method of completing the square, the program associate first by being nodal hierarchy in the distance of node to gateway node for each layer of node
Link calculation channel interfering link set, then according to interfering link set calculate link degree of disturbance and link distribution
The distribution index of index and node, a link is assigned on one or more channel under conditions of network interface card constraint is met
Go, but the program is only come to distribute channel for the link of each layer of association by foundation of network hierarchy, limited in view of interface
Under conditions of for link distribute available channel, do not account for the flow style issues of network, do not account for routing procedure yet
Interference and inter-stream interference problem in the stream that middle multichannel is brought.And it is logical the present invention be directed to flow style issues and routing issue
Cross and assign different load weights to the different link of being calculated as of link load, then by each of the links distribute one it is fixed
Minimum channel is disturbed, so that minimum interference in network, is then added in stream in routing procedure between interference and stream
Interference considers, the overall performance of network is lifted by the combined optimization of channel distribution and Route Selection.
Application No. US20050057577 patent discloses the specific step of a kind of centralized channel distribution and routing algorithm
Suddenly, the expectation load in the program first in pre-estimation network on each link, and by the load of estimation come to each in network
Bar link distributes channel, then sees whether that all link capacities disclosure satisfy that expectation loads and need during actually routeing
Ask, fed back if being unsatisfactory for according to the link capacity of reality come channel distribution again, until the result of channel distribution can expire
Foot it is expected link load requirement, and redistribute can ratio for channel when changes in flow rate is quick in wireless Mesh netword for this method
It is relatively frequent, and the delay that the moire effect brought in this channel allocation also results in channel distribution becomes big, network convergence
It is relatively slow, the stability of network can be influenceed.And the present invention is the static channel carried out based on wireless Mesh netword flow pattern feature
Distributing, then channel assignment scheme is constant in the case of the topological novariable of network, reduces the variation of network, while in route
Optimize the feedback not as channel distribution, but in order to reach the mesh of overall interference minimum with channel distribution joint route
's.
The content of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide a kind of wireless Mesh netword channel for reducing interference
Distribution and route combined optimization system and method, reach the purpose for minimizing the interference between link in network, then selected in route
Interference and inter-stream interference factor in stream are taken into full account in selecting, obtains optimal path, improves the handling capacity in network, reduces delay.
The purpose of the present invention is achieved through the following technical solutions：A kind of wireless Mesh netword channel for reducing interference
Distribution and route combined optimization system, it includes link information computing module, channel assignment module and route pathfinding module, described
Link information computing module be used to calculate the initial information of input, output and the channel point of link information computing module
Connected with module, the output of channel assignment module is connected with route pathfinding module, route pathfinding module output channel distribution result
With source mesh optimal path.
Described initial information includes network topology, root node, nodal information and set of available channels.
A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization method, it includes link information meter
Calculating step, channel assignment step and route pathfinding step, described link information calculation procedure includes following sub-step：
S11：Input the available network interface card number K (u) of each node, gateway node, nodal information, number of available channels set C (u)
With physical topology G (V, E)；
S12：Each node is calculated to the most short hop count of gateway node using dijkstra's algorithm, and with most short hop count
For each node hierarchy, the series of gateway node is up to the first order, and a hop neighbor of gateway node is the second level, past successively
Lower point, until all nodes have all been divided level PLi, labeled as PLi=1,2 ... n, wherein PLi=1 represents routing node i
For gateway point, PLi=n represents that routing node i is apart from the farthest node of gateway；
S13：Each node calculates neighbours' number NB around oneself simultaneouslyi, then level PL can be passed throughiWith neighbours' number NBi
The two parameters obtain node load neighbours' number of each nodeThe link load weight of network is calculated simultaneouslyThat is link eijBoth ends node load sum, is expressed as：
Described channel assignment step includes following sub-step：
S21：Link load is arranged according to size order, then weighed according to heuristic method for channel allocation from link load
WeightMaximum proceeds by channel distribution, and wherein each of the links needs to calculate an interference weight CID when distributing channel,
The link load weight sum for disturbing weight CID to be other links in interference range using same channel, is expressed as：
In formula, I (eijeuv) represent link eijWith link euvIn the presence of interference, both links that and if only if in interference range,
Potential interference link each other, and same link is all assigned with, it is expressed as：
Two nodes of link are that i and j link L distributes channel according to following sub-step：
S211：If K (i) ≠ Φ and node K (j) ≠ Φ, for link L distribute channel c, c ∈ c | c=C (i) ∩ C
(j) }, if c is not unique, select to disturb the minimum channels of weight CID in set c；
S212：If K (i) ≠ Φ, but K (j)=Φ, then selection interference is weighed in the channel that node j has been allocated for
Channel c minimum weight CID distributes to node i, as link L distribution channels c；
S213：If K (j) ≠ Φ, but K (i)=Φ, then selection interference is weighed in the channel that node i has been allocated for
Channel c minimum weight CID distributes to node j, as link L distribution channels c；
In formula, Φ is empty set, and K (j)=Φ is expressed as node j and not can use network interface card；
S22：Channel distribution finishes；
Described route pathfinding step includes following sub-step：
S31：When source node needs to send data, source node broadcasts footpath request message PREQ starts pathfinding
Journey；
S32：After intermediate node receives path request message PREQ, the channel diversity of present node upper hop is calculated
MCDI in exponential metric MCDI and accumulated path request message PREQ, obtained value and the MCDI values stored in routing table are entered
Row compares, if smaller, preserve the value and updates the MCDI in path request message PREQ, continues forward-path request message
PREQ；If larger, this path request message PREQ is abandoned, described MCDI is expressed as：
In formula, MCDI (p) represents the channel diversity indices measurement on the p of path, and i is arbitrary node in the p of path, and α and β are
Weight factor, for interference and inter-stream interference shared weight, CDP in whole MCDI in equiulbrium flowiPerceived for channel diversity
Parameter, ETTiFor the expectation transmission time of current ink, EWTiFor the expectation stand-by period of current ink, CDPiIt is represented by：
In formula, ni,hopRepresent hop count of the node i on the p of path, if node i to source node hop count more than 3, the value
For 3, if less than 3, the value is the hop count to source node；nchRepresent node i and three jumps formed between first three corresponding hop node
Link uses the number of different channels, if three hop links formed between node i and first three corresponding hop node use different channels
Number more than 3, then the value be 3, if less than 3, then the value is different channels number；
ETTiAnd EWTiRelation be represented by：
In formula, epre(i)Represent the link between node i and upper hop node, I (epre(i)i) represent to produce interference to link
All links set；
S33：When destination node receives multiple path request message PREQ, calculate the MCDI of all upper hops and tire out
Add the MCDI in path request message PREQ, path return information PREP reply is carried out to the minimum PREQ of MCDI values, is established
Play the path that MCDI values are minimum on path；
S34：Path selection terminates, and starts data transfer.
As two end points neighbours' number NB of linkiThe more not higher link load weight of multipriorityIt is bigger, it is on the contrary
Two end points neighbours' number NBiThe lower described link load weight of fewer priority levelWith regard to smaller.
Described channel diversity perceptual parameters CDPiInterior interference is flowed for reducing, the expectation transmission of described current ink
Time ETTiWith the expectation stand-by period EWT of current inkiFor reducing inter-stream interference.
Described weight factor α is interference coefficient in stream, and described weight factor β is inter-stream interference coefficient, alpha+beta=1.
The beneficial effects of the invention are as follows：According to this flow feature and its topology information of wireless Mesh netword, it is proposed that one
Static channel allocation method of the kind based on link load weight, reach the purpose for minimizing the interference between link in network, then
Interference and inter-stream interference factor in stream are taken into full account in Route Selection, obtains optimal path, the handling capacity in network is improved, subtracts
Small delay.
Brief description of the drawings
Fig. 1 is Wireless Mesh return network Organization Chart；
Fig. 2 is present system and method schematic diagram；
Fig. 3 is the inventive method flow chart；
Fig. 4 is calculate node load and neighbours' number schematic diagram in embodiment；
Fig. 5 is that the load weight schematic diagram in each of the links is calculated in embodiment；
Fig. 6 is distribution load maximum link schematic diagram in embodiment；
Fig. 7 is channel distribution result in embodiment；
Fig. 8 is path selection analysis figure in embodiment.
Embodiment
Technical scheme is described in further detail below in conjunction with the accompanying drawings：The present embodiment be 3*3 mesh topology under,
2 network interface cards, 4 available channels, gateway node are the channel distribution situation of node 5.
As shown in figure 3, calculating the neighbours' number and grade of each node first, the NB expressions of each node are sections
Neighbours' quantity of point, what PL was represented is the level of node.
Then the loading condition of link is calculated, as a result as shown in Figure 4.In Fig. 4, the numerical value on each link represents
It is each link load situation.
Channel is distributed since the link of load maximum according to heuritic approach according to link load weight magnitude relationship.Such as
Shown in Fig. 5, distributed since link load maximum, first distribute middle four links, link load of then reallocating is less
Link.Final channel distribution result is as shown in Figure 6.
, can be to be calculated during pathfinding again by MCDI in routing algorithm to seek after channel distribution result is obtained
Seek optimal path.The routing algorithm that the present embodiment uses is the HMWP Routing Protocol defined in 802.11s, by Routing Protocol
Route criterion space-time measurement replaces with the MCDI in the present invention.
When thering are data to need transmission in network, as shown in fig. 7, when node 1 needs to transmit data to node 6
To wait, source node is asked by broadcasting PREQ, and PREQ calculates the MCDI sizes on each link during node 6 is reached,
Node 6 it is expected the minimum path of transmission time as data transfer path according to the MCDI sizes selection calculated.
If from 1->6 now You Liangtiao roads, are 1- respectively>2->5->6 and 1->2->3->6, three jump on the first paths
Within used three different channels respectively, and on the second path three jump within only used two channels, it is evident that first road
Interference is less than the second paths in the stream in footpath；And the middle double bounce 2- on the first paths simultaneously>5->6 with the second paths
On middle double bounce 2->3->6 compare, the channel 4 and channel 3 chosen on the first paths institute in the interference range of double bounce
The inter-stream interference being subject to is smaller；After theory analysis, it is respectively 0.5 and 0.5 that we, which set interference and inter-stream interference coefficient in stream,
And assume that data in each transmission time jumped onto are all homogeneously ETT, calculate the specific metric of two paths.ETTiWith
1- first>2, the CDP calculated at node 22=1 (under be designated as calculated node), due to 1->2 use
Channel 2 have three links using same channel in double bounce interference range, then 1->2 expectation stand-by period EWT2=
3ETT, obtain MCDI (2)=0.5*1*ETT+0.5*3*ETT=2ETT；This value is on the first paths and the second paths
It is the same.
1- on path one>2->5 have used two different channels, then CDP5=1, due to 2->5 channels 4 used exist
An only link using same channel in double bounce interference range, then the expectation stand-by period is EWT5=ETT, then MCDI
(5)=MCDI (2)+0.5*1*ETT+0.5*ETT=3ETT；1- on path two simultaneously>2->Two identical letters have been used on 3
Road, then CDP3=2, due to 2->3 channels 2 used have three links for using same channel in double bounce interference range, that
2->3 expectation stand-by period is EWT3=3ETT；MCDI (3)=MCDI (2)+0.5*2*ETT+0.5* can then be obtained
3ETT=4.5ETT.
1- on path one>2->5->6 have used three different channels, then CDP6inPath1=1, due to 5->6 use
Channel 3 only has a link using same channel in double bounce interference range, then the expectation stand-by period is EWT6inPath1=
ETT, then MCDI (6inPath1)=MCDI (5)+0.5*1*ETT+0.5*ETT=4ETT；Path 1->2->3->Make in 6 three jumps
With two different channels, then CDP6inPath2=3/2, due to 3->6 channels 1 used have three in double bounce interference range
Bar uses the link of same channel, then 3->6 expectation stand-by period EWT6inPath2=3ETT, then MCDI (6inPath2)=
MCDI (3)+0.5*3/2*ETT+0.5*3ETT=6.75ETT.
To sum up can obtain the expectation transmission time on two paths is respectively 4ETT and 6.75ETT, and node 6 can be according to calculating
Out MCDI choose in inter-stream interference and stream less first paths of interference as data transfer path.
Claims (5)
1. a kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization method, applied to the nothing for reducing interference
Line Mesh network channel distribution includes link information computing module, channel assignment module with route combined optimization system, the system
With route pathfinding module, described link information computing module is used to calculate the initial information of input, link information meter
The output for calculating module is connected with channel assignment module, and the output of channel assignment module is connected with route pathfinding module, route pathfinding
Module exports channel distribution result and source mesh optimal path, it is characterised in that：This method includes link information calculation procedure, channel
Allocation step and route pathfinding step, described link information calculation procedure include following sub-step：
S11：Input available network interface card number K (u), gateway node, nodal information, number of available channels set C (u) and the thing of each node
Manage topological G (V, E)；
S12：Using dijkstra's algorithm come to calculate each node to the most short hop count of gateway node, and using most short hop count be every
One node hierarchy, the series of gateway node is up to the first order, and a hop neighbor of gateway node is the second level, successively down
Point, until all nodes have all been divided level PLi, labeled as PLi=1,2 ... n, wherein PLi=1 represents that routing node i is
Gateway point, PLi=n represents that routing node i is apart from the farthest node of gateway；
S13：Each node calculates neighbours' number NB around oneself simultaneouslyi, then level PL can be passed throughiWith neighbours' number NBiThis two
Individual parameter obtains node load neighbours' number of each nodeThe link load weight of network is calculated simultaneouslyI.e.
Link eijBoth ends node load sum, is expressed as：
<mrow>
<msub>
<mi>w</mi>
<msub>
<mi>e</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>NB</mi>
<mi>i</mi>
</msub>
</mrow>
<mrow>
<msub>
<mi>PL</mi>
<mi>i</mi>
</msub>
</mrow>
</mfrac>
<mo>+</mo>
<mfrac>
<mrow>
<msub>
<mi>NB</mi>
<mi>j</mi>
</msub>
</mrow>
<mrow>
<msub>
<mi>PL</mi>
<mi>j</mi>
</msub>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
Described channel assignment step includes following sub-step：
S21：Link load is arranged according to size order, then according to heuristic method for channel allocation from link load weightMaximum proceeds by channel distribution, and wherein each of the links needs to calculate an interference weight CID when distributing channel, does
The link load weight sum that weight CID is other links in interference range using same channel is disturbed, is expressed as：
<mrow>
<mi>C</mi>
<mi>I</mi>
<mi>D</mi>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>e</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>,</mo>
<msub>
<mi>e</mi>
<mrow>
<mi>u</mi>
<mi>v</mi>
</mrow>
</msub>
<mo>&Element;</mo>
<mi>E</mi>
<mo>,</mo>
<msub>
<mi>e</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&NotEqual;</mo>
<msub>
<mi>e</mi>
<mrow>
<mi>u</mi>
<mi>v</mi>
</mrow>
</msub>
</mrow>
</munder>
<mo>&lsqb;</mo>
<mi>I</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>e</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>e</mi>
<mrow>
<mi>u</mi>
<mi>v</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mrow>
<mo>(</mo>
<msub>
<mi>w</mi>
<msub>
<mi>e</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</msub>
<mo>+</mo>
<msub>
<mi>w</mi>
<msub>
<mi>e</mi>
<mrow>
<mi>u</mi>
<mi>v</mi>
</mrow>
</msub>
</msub>
<mo>)</mo>
</mrow>
<mo>&rsqb;</mo>
<mo>,</mo>
</mrow>
In formula, I (eijeuv) represent link eijWith link euvIn the presence of interference, both links that and if only if are in interference range, each other
Potential interference link, and same link is all assigned with, it is expressed as：
Two nodes of link are that i and j link L distributes channel according to following sub-step：
S211：If K (i) ≠ Φ and node K (j) ≠ Φ, channel c, c ∈ { c | c=C (i) ∩ C (j) } is distributed for link L,
If c is not unique, select to disturb the minimum channels of weight CID in set c；
S212：If K (i) ≠ Φ, but K (j)=Φ, then weight CID is disturbed in selection in the channel that node j has been allocated for
Minimum channel c distributes to node i, as link L distribution channels c；
S213：If K (j) ≠ Φ, but K (i)=Φ, then weight CID is disturbed in selection in the channel that node i has been allocated for
Minimum channel c distributes to node j, as link L distribution channels c；
In formula, Φ is empty set, and K (j)=Φ is expressed as node j and not can use network interface card；
S22：Channel distribution finishes；
Described route pathfinding step includes following sub-step：
S31：When source node needs to send data, source node broadcasts footpath request message PREQ starts pathfinding process；
S32：After intermediate node receives path request message PREQ, the channel diversity indices of present node upper hop is calculated
The MCDI in MCDI and accumulated path request message PREQ is measured, obtained value and the MCDI values stored in routing table are compared
Compared with, if smaller, preserve the value and update the MCDI in path request message PREQ, continuation forward-path request message
PREQ；If larger, this path request message PREQ is abandoned, described MCDI is expressed as：
<mrow>
<mi>M</mi>
<mi>C</mi>
<mi>D</mi>
<mi>I</mi>
<mrow>
<mo>(</mo>
<mi>p</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mi>o</mi>
<mi>d</mi>
<mi>e</mi>
<mi>i</mi>
<mo>&Element;</mo>
<mi>p</mi>
</mrow>
</munder>
<mrow>
<mo>(</mo>
<msub>
<mi>&alpha;CDP</mi>
<mi>i</mi>
</msub>
<mo>&times;</mo>
<msub>
<mi>ETT</mi>
<mi>i</mi>
</msub>
<mo>+</mo>
<msub>
<mi>&beta;EWT</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>,</mo>
</mrow>
In formula, MCDI (p) represents the channel diversity indices measurement on the p of path, and i is arbitrary node in the p of path, and α and β are weight
The factor, for interference and inter-stream interference shared weight, CDP in whole MCDI in equiulbrium flowiFor channel diversity perceptual parameters,
ETTiFor the expectation transmission time of current ink, EWTiFor the expectation stand-by period of current ink, CDPiIt is represented by：
<mrow>
<msub>
<mi>CDP</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>n</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>h</mi>
<mi>o</mi>
<mi>p</mi>
</mrow>
</msub>
<msub>
<mi>n</mi>
<mrow>
<mi>c</mi>
<mi>h</mi>
</mrow>
</msub>
</mfrac>
<mo>,</mo>
</mrow>
In formula, ni,hopRepresent hop count of the node i on the p of path, if node i to source node hop count more than 3, the value is 3,
If less than 3, the value is the hop count to source node；nchRepresent node i and three hop links formed between first three corresponding hop node
Using the number of different channels, if three hop links formed between node i and first three corresponding hop node use of different channels
Number is more than 3, then the value is 3, and if less than 3, then the value is different channels number；
ETTiAnd EWTiRelation be represented by：
<mrow>
<msub>
<mi>EWT</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<munder>
<mi>&Sigma;</mi>
<mrow>
<msub>
<mi>e</mi>
<mrow>
<mi>a</mi>
<mi>b</mi>
</mrow>
</msub>
<mo>&Element;</mo>
<mi>I</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>e</mi>
<mrow>
<mi>p</mi>
<mi>r</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mi>i</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</munder>
<msub>
<mi>ETT</mi>
<msub>
<mi>e</mi>
<mrow>
<mi>a</mi>
<mi>b</mi>
</mrow>
</msub>
</msub>
<mo>,</mo>
</mrow>
In formula, epre(i) link between node i and upper hop node, I (e are representedpre(i)i) represent to produce link the institute of interference
There is the set of link；
S33：When destination node receives multiple path request message PREQ, the MCDI of all upper hops and cumulative road are calculated
MCDI in the request message PREQ of footpath, path return information PREP reply is carried out to the minimum PREQ of MCDI values, it is established that road
The minimum path of MCDI values on footpath；
S34：Path selection terminates, and starts data transfer.
2. a kind of wireless Mesh netword channel distribution for reducing interference according to claim 1 and route combined optimization side
Method, it is characterised in that：Described initial information includes network topology, root node, nodal information and set of available channels.
3. a kind of wireless Mesh netword channel distribution for reducing interference according to claim 1 and route combined optimization side
Method, it is characterised in that：As neighbours' number NB of two end points of linkiThe more not higher link load weight of multipriorityMore
Greatly, otherwise as neighbours' number NB of two end pointsiThe lower described link load weight of fewer priority levelWith regard to smaller.
4. a kind of wireless Mesh netword channel distribution for reducing interference according to claim 1 and route combined optimization side
Method, it is characterised in that：Described channel diversity perceptual parameters CDPiInterior interference, the phase of described current ink are flowed for reducing
Hope transmission time ETTiWith the expectation stand-by period EWT of current inkiFor reducing inter-stream interference.
5. a kind of wireless Mesh netword channel distribution for reducing interference according to claim 1 and route combined optimization side
Method, it is characterised in that：Described weight factor α is interference coefficient in stream, and described weight factor β is inter-stream interference coefficient, alpha+beta
=1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410462227.8A CN104185242B (en) | 2014-09-11 | 2014-09-11 | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410462227.8A CN104185242B (en) | 2014-09-11 | 2014-09-11 | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104185242A CN104185242A (en) | 2014-12-03 |
| CN104185242B true CN104185242B (en) | 2017-12-05 |
Family
ID=51965900
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410462227.8A Expired - Fee Related CN104185242B (en) | 2014-09-11 | 2014-09-11 | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104185242B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104936249B (en) * | 2015-06-05 | 2018-10-16 | 电子科技大学 | A kind of routing self-healing method suitable for wireless network |
| CN105163389B (en) * | 2015-07-08 | 2018-11-27 | 电子科技大学 | A kind of more radio frequency multi-channel wireless mesh network portion intersection method for channel allocation |
| CN105554888B (en) * | 2015-12-10 | 2019-04-16 | 国网四川省电力公司电力科学研究院 | More radio frequency multi-Channel Wireless Mesh Network channel allocation algorithms based on link multi tate |
| CN106332107A (en) * | 2016-10-21 | 2017-01-11 | 高道华 | Network resource planning method of wireless mesh |
| CN106792980B (en) * | 2016-11-25 | 2020-08-18 | 北京中电普华信息技术有限公司 | Joint routing metric and partially overlapping channel allocation method |
| CN106685836B (en) * | 2017-03-23 | 2020-01-14 | 江苏中科羿链通信技术有限公司 | HWMP on-demand routing broadcast packet suppression method |
| CN109756353B (en) * | 2017-11-03 | 2022-01-11 | 富士通株式会社 | Method and device for determining link, path and network capacity |
| CN110072266B (en) * | 2019-04-28 | 2022-09-09 | 吉林大学 | Wireless Mesh network multicast routing channel allocation method considering interference power |
| CN111148116B (en) * | 2019-12-11 | 2022-08-30 | 郑州大学 | WMN gateway deployment and channel allocation joint optimization method facing emergency communication |
| CN113872875B (en) * | 2021-07-27 | 2023-07-11 | 广西电网有限责任公司桂林供电局 | Self-adaptive intelligent gateway discovery method based on load balancing |
| CN113747536B (en) * | 2021-09-24 | 2022-06-21 | 腾云悦智科技(深圳)有限责任公司 | QoS-aware multi-path routing method of WSNs in mobile environment |
| CN114244767B (en) * | 2021-11-01 | 2023-09-26 | 北京邮电大学 | Link minimum end-to-end delay routing algorithm based on load balancing |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7369512B1 (en) * | 2003-11-06 | 2008-05-06 | Bbn Technologies Corp. | Systems and methods for efficient packet distribution in an ad hoc network |
| CN100499552C (en) * | 2007-03-07 | 2009-06-10 | 阿德利亚科技(北京)有限责任公司 | Channel distributing method and device in wireless mesh network |
| CN101790233B (en) * | 2009-12-29 | 2013-06-05 | 中兴通讯股份有限公司 | Channel allocating method and device for multichannel multi-interface wireless mesh network |
| CN102612109A (en) * | 2011-01-19 | 2012-07-25 | 黄书强 | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction |
| CN102625362B (en) * | 2012-04-25 | 2018-10-16 | 北京邮电大学 | Distributed channel distributing method in a kind of more wireless radiofrequency Mesh networks of multichannel |
-
2014
- 2014-09-11 CN CN201410462227.8A patent/CN104185242B/en not_active Expired - Fee Related
Non-Patent Citations (2)
| Title |
|---|
| Distributed joint channel and routing assignment for multimedia wireless mesh networks;W.L. Warner Hong, et al;《2012 IEEE International Conference on Multimedia and Expo》;20121231;全文 * |
| 无线mesh网络联合信道分配和路由协议研究;刘峰，等;《计算机技术与发展》;20100831;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104185242A (en) | 2014-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| CN101647238B (en) | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks | |
| Tizghadam et al. | Betweenness centrality and resistance distance in communication networks | |
| CN102223644B (en) | System and method for combining relay selection and power distribution | |
| CN102355670B (en) | Multichannel wireless mesh network channel distribution method | |
| CN101263687A (en) | Wireless routing implementation mode | |
| GB2502775A (en) | Selecting routes between nodes in a network based on node processing gain and lifetime | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| CN103457852B (en) | A kind of survivability mapping method of multicast virtual network | |
| CN109639575A (en) | Route planning method based on link congestion coefficient | |
| CN106789744A (en) | Handled up resource regulating method with the height that time delay is perceived based on UNE virtualization | |
| CN102387585B (en) | Communication method and communication nodes for wireless communication network | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN100499552C (en) | Channel distributing method and device in wireless mesh network | |
| CN109067920A (en) | A kind of load balancing and method for routing for server content update | |
| CN105050149A (en) | Routing method for overcoming congestion of tree type Zigbee network | |
| CN107343303B (en) | Based on the routing optimization method of Duality Decomposition in wireless Mesh netword | |
| CN104734808B (en) | Worst time delay perceives cross-layer optimizing method in a kind of wireless sensor network | |
| CN106993310A (en) | Integrated routing method and system based on Load-aware in a kind of wireless self-networking | |
| CN108521660A (en) | A kind of route renewing method of balancing energy | |
| CN106162787A (en) | A kind of method for routing foundation and device | |
| CN103167619B (en) | A kind of method for channel allocation for multi-channel wireless sensor network | |
| CN104093182A (en) | Method for acquiring a plurality of reliable communication paths based on field intensity in multi-layer wireless network | |
| CN105744550A (en) | Wireless Mesh network, and routing method and apparatus thereof | |
| CN110072266B (en) | Wireless Mesh network multicast routing channel allocation method considering interference power |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171205 Termination date: 20180911 |