CN102612109A - Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction - Google Patents
Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction Download PDFInfo
- Publication number
- CN102612109A CN102612109A CN2011100219373A CN201110021937A CN102612109A CN 102612109 A CN102612109 A CN 102612109A CN 2011100219373 A CN2011100219373 A CN 2011100219373A CN 201110021937 A CN201110021937 A CN 201110021937A CN 102612109 A CN102612109 A CN 102612109A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- channel
- group
- routing
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction. During channel distribution, a routing channel union algorithm of optimizing a topological structure, routing the maximum flow, grouping links and group-distributing channels is adopted, so that the shaking problem during channel distribution and the problem about the routing efficiency can be effectively solved, and the throughput and the efficiency of a system can be further improved; network structure topology is optimized by virtue of a maximum flow minimum cut theory; the justice is kept, and the throughput is increased as much as possible; after the topological structure is optimized, the number of links participating in channel distribution is reduced, and interference and conflicts are reduced, so that the later channel distribution efficiency is improved greatly, the routing maintenance cost is reduced, and the system efficiency is improved; after routing, a routing algorithm and the channel distribution can be united effectively through a two-section channel distribution algorithm; and according to the two-section channel distribution algorithm, the integral shaking problem possibly caused by partial adjustment during channel distribution can be solved, the channel distribution efficiency is relatively high, and the performance of a network is improved greatly.
Description
Technical field
The present invention relates to the Mesh network topology structure and optimize and the channel allocation field, particularly a kind of based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference.
Background technology
Wireless Mesh netword makes it use more and more widely because of characteristics such as its low cost, flexibility and ease for use, and wireless Mesh netword can be deployed in various specific occasions, adopts limited infrastructure that ubiquitous network insertion service just can be provided.A Wireless Mesh local area network (LAN) is made up of some netted nodes, sees illustrated in figures 1 and 2ly, and these nodes realize that through wave point the multi-hop of network connects.
One of subject matter that current WMN faces is that when when the adjacent domain multilink transmits simultaneously, they can produce interference each other and cause network performance to descend.For addressing this problem, WMN uses a plurality of orthogonal channel patterns, and node transmits simultaneously on different channels through a plurality of network interfaces and receives, and in adjacent domain multiplexing simultaneously.This multichannel pattern can significantly improve the throughput of WMN; But because channel allocation receives the restriction of many factors such as number, network topology and communication requirement of available channel and interface; Particularly because the restriction of number of available channels purpose; Transmission is disturbed and can not be eliminated fully, still becomes a key factor that influences network throughput.
IEEE 802.11b/g and IEEE 802.11a standard are defined as 3 and 12 orthogonal channels respectively and in many interfaces WMNS, use, the raising network throughput that multichannel will be very big.One of most important design problem of many interfaces WMN is the channel allocation problem, solves how allocated channel of each radio frequency interface.Good channel allocation strategy; Will improve network throughput; But unsuitable channel allocation strategy will cause throughput to descend, because there is the multichannel hidden terminal problem in the channel allocation strategy, network topology is not communicated with the fairness that does not guarantee the user when causing network division and distributing bandwidth.
Current wireless node apparatus adopts a plurality of radio frequencies on same node; Each radio frequency design becomes can convert a plurality of orthogonal channels to; A plurality of like this channels can be launched in a zone simultaneously, make the interference mitigation of interchannel, thereby the throughput of system is also along with being improved.But because channel allocation receives the restriction of many factors such as number, network topology and communication requirement of available channel and interface, because the restriction of available channel, transmission is disturbed and can not be eliminated fully, still becomes a key factor that influences network throughput.
The channel allocation strategy also will be considered whole network connectivty, when two adjacent nodes distribute identical channel, and the communication each other of these two nodes.Adjacent node should be limited with identical channel transmission data in collision domain, and the link of neighbors will the phase mutual interference cause whole network throughput to descend.The channel allocation strategy also determines the available bandwidth on network link, and the link of distribution same channel can not transmit the heap(ed) capacity of data and their shared in common channels simultaneously in interference range.
Target at multi-channel wireless mesh network channel allocation strategy is to distribute a radio-frequency channel for each network interface.3 main restrictive conditions below in a channel allocation strategy, need satisfying: the channel number that each wireless mesh network node is distributed in (1) receives the restriction of node interface number.Some loads that (2) two nodes have comprised a virtual link and this link bearer, these two nodes will distribute an identical channel at least so.(3) in disturbing the territory, the link anticipated load summation of distribution same channel can not surpass the total capacity of channel.
Propose all to receive in the channel allocation strategy restriction of condition (1) in front, when a node radio frequency interface was selected a channel, the channel allocation strategy did not only depend on the information between link interference scope interior nodes.In the channel allocation strategy, ignore the interchannel relation of interdependence; May increase and run counter to (1) restrictive condition; For example node distributes the radio frequency interface number of different channels number greater than it; Usually the method that solves is channel allocation to be adjusted promptly replace previous channel allocation through recursion method, possibly cause whole network to carry out channel allocation again.So then can cause the time-delay of network.
In sum, the weak point of wireless Mesh netword is transmission interference effect throughput and the unreasonable operating efficiency that influences of channel allocation at present.
Summary of the invention
Technical problem to be solved by this invention provides a kind of wireless Mesh netword routed channels combined distributing method that disturbs based on topological optimization and reduction, avoids interference the reasonable distribution channel, optimizes the service efficiency of wireless Mesh netword.
For solving the problems of the technologies described above, the technical scheme that the present invention adopts is: a kind of based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference, may further comprise the steps:
1) signal transmission beginning;
2) optimize topological structure, the signal that transmits is converted into tree structure through a kind of topological structure greedy algorithm based on flow perception and flow equitable distribution, form the Mesh topological structure after optimizing;
3) utilize the AODV agreement to carry out Route Selection to the Mesh topological structure after the said optimization; The quick self-adapted dynamic link situation of AODV Routing Protocol; Make it to carry out route discovery, set up routing table content, i.e. dynamic link as required according to network topology structure according to the needs that send packet;
4) above-mentioned dynamic link is disturbed the heuristic channel allocation algorithm of avoiding of two steps; The first step, link-group binding; In second step, the group road distributes;
5) flow convergent-divergent;
6) signal allocation finishes.
Said step 2) in, supposes that all physical link capacity and node link capacity in a normal range (NR) [a, b], the situation that link has big difference can not occur; Simultaneously, in order to reduce the delay effect that jumping figure brings, the present invention's supposition does not communicate with the node between one deck, and node is successively to transmit, and does not consider the communication between the intra-gateway node, only considers the data interaction between node and the gateway.
In the said step 3), in route finding process, mainly carry out according to RREQ request message and RREP response message.In route maintenance procedure, mainly carry out according to Hello message and RERR message.
Mesh topological structure after the said optimization is when carrying out route discovery, and message is not propagated between with layer.
In the said step 4), said link group is bound, and promptly according to the link flow situation, according to utilance link is divided into groups, and simultaneously group is merged the link that makes node distribute and is no more than the number of ports restriction.
In the said step 5), said group of road distribution will be organized according to disturbed condition and carry out channel allocation, guarantee the primary distribution success, avoid the local channel adjustment to cause overall jitter.
The present invention is with respect to prior art; Have following beneficial effect: the present invention adopts the routed channels unified algorithm of " topological structure optimization-max-flow route-link packet-set of dispense channel " when channel allocation; Can effectively solve jitter problem and router efficiency problem in the channel allocation, to improve the throughput and the efficient of system.Utilize max-flow minimal cut principle that the network configuration topology is optimized, when keeping fairness, improve throughput as far as possible.After topological structure optimization, the number of links of participating in channel allocation reduces, and disturbs and the conflict minimizing, makes the channel allocation efficient of back improve greatly, reduces the cost of route maintenance, improves system effectiveness.After the route,, can realize effective associating of routing algorithm and channel allocation through two sections channel allocation algorithm.This algorithm can be avoided the overall jitter problem that local adjustment possibly cause in the channel allocation, and the efficient of channel allocation is higher, promotes the performance of network greatly.
Description of drawings
Fig. 1 is existing Mesh network structure;
Fig. 2 is existing Mesh topology of networks figure;
Fig. 3 is the feedback diagram that conventional channel is distributed the caused chain reaction of local adjustment;
Fig. 4 is the Mesh topology of networks figure that optimizes;
Fig. 5 is the Mesh topology of networks figure of present embodiment;
Fig. 6 is flowage structure figure of the present invention.
Embodiment
Below in conjunction with embodiment and accompanying drawing the present invention is described in further detail, but execution mode of the present invention is not limited thereto.
Of Fig. 6, be flowage structure figure of the present invention; 1) signal transmission beginning; 2) optimize topological structure, the signal that transmits is converted into tree structure through a kind of topological structure greedy algorithm based on flow perception and flow equitable distribution, form the Mesh topological structure after optimizing; 3) utilize the AODV agreement to carry out Route Selection to the Mesh topological structure after the said optimization; The quick self-adapted dynamic link situation of AODV Routing Protocol; Make it to carry out route discovery, set up routing table content, i.e. dynamic link as required according to network topology structure according to the needs that send packet; 4) above-mentioned dynamic link is disturbed the heuristic channel allocation algorithm of avoiding of two steps; The first step, link-group binding; In second step, the group road distributes; 5) flow convergent-divergent; 6) signal allocation finishes.
In this case study on implementation, at first utilize max-flow minimal cut principle that the network configuration topology is optimized, its detailed process is:
Suppose that in the stratification Mesh structural model, the link capacity of link ij is C
Ij, the flow that i node self produces is f (i), the capacity of supposing node is more than or equal to its uplink capacity.This algorithm will be the mesh network thaumatropy tree structure exactly; One side needs to keep node flow fairness in distribution property in the conversion process; Need improve network throughput as far as possible on the other hand; In conversion process, made full use of the max-flow minimal cut principle in the network flow spirogram, promptly the maximum stream flow of network is less than or equal to the capacity sum of the minimal cut of this directed graph.
For shown in Figure 4, node A is a gateway, and numeral is a link capacity, and unit is Mbps.Except that node A, if the flow f (i) that other all nodes self produce equates that the process that so topological structure is transformed is following:
(1) begins from gateway node, successively graph structure is carried out beta pruning.Through deleting some limits, make each node only link to each other with a upper layer node;
(2) at first the forward-path of node A, B, C, D, F is confirmed, need the node E of the second layer be handled, and in EB and EC, select a paths to carry out data forwarding.If transmit through EB this moment so, the link capacity that B, D, the maximum bandwidth of distributing of each node of E are link BA is divided by lower level node number, i.e. 54/3=18Mbps.If transmit through EC, the bandwidth that B, C, each node of E distribute at most be the link capacity of link BA divided by the lower level node number, i.e. 48/3=16Mbps, based on the greedy thought of maximization user bandwidth and throughput, this time should EB, deletes EC.
(3) handle one deck down, node H and I are carried out Path selection.EB deletes, and the flow of node H must pass through Node B so, if when 1 node is selected link IE, the bandwidth that Node B, D, E, G, H, I distribute at most are that the BA link capacity is divided by lower floor's service node sum, i.e. 54/6=9Mbps.If the I node is selected link IF, the bandwidth that node C, F, I, J distribute at most be the CA link capacity divided by lower floor's service node sum, i.e. 48/4=12Mbps, based on the greedy thought of maximization user bandwidth and throughput, this time should IF, deletes IE.In like manner the H node should be selected path HE, deletion HD.
(4) handle one deck down, need first processing node N, because node M and O must have only node N might select B or C through B and C.Distribute bandwidth through calculating maximum possible, learn that node N selects NI, deletion NH.In like manner can get node M and select MH, node O selects OI.
(5) in the link selection process, keep topology connective, keep each node all to be in a source node to the link of destination node.
Whole network utilizes the AODV agreement to carry out Route Selection behind topological structure optimization.AODV is a kind of typical on-demand routing protocol; Be to carry out route discovery according to the needs that send packet, network topology structure and routing table content are set up as required, and this Routing Protocol routing cost is less; Only just carry out route discovery when being necessary, very little to the load that network brings.Because the topological structure that the present invention optimizes, when changes in flow rate was little, topologies change was also little, and too big variation can not take place the channel of distribution yet, otherwise also little to the route influence, network is relatively stable, so be fit to utilize the AODV route to handle.Only in the time of node failure or the violent shake of flow, just need carry out the adjustment and the route discovery of topological structure again.The AODV Routing Protocol comprises route discovery and two processes of route maintenance, in the route finding process, mainly carries out according to RREQ request message and RREP response message.In the route maintenance procedure, mainly carry out, safeguard the deletion of local connectivity and route aging and route, tasks such as route repair according to Hello message and RERR message.Based on topological structure of the present invention, when carrying out route discovery, message is not propagated between with one deck.The AODV Routing Protocol provides quick self-adapted to the dynamic link situation, and processing expenditure and storage overhead are little, have good performance.
ADOV routing algorithm through topological structure optimization has obtained whole network link initial load situation, behind the anticipated load of given whole network virtual link, the present invention is based on and disturbs several steps below the channel allocation method for channel allocation branch of avoiding:
(a) link-group binding strategy, the link to every layer on the basis of layering carries out assign group, and carries out link group through network topology control and bind optimization, and this stage main purpose is to guarantee that the channel number of distributing to each node can not surpass its interface number;
(b) group channel allocation strategy is organized channel allocation on link group binding basis, main purpose is to minimize the interference volume that each collision domain link bandwidth overall utilization promptly minimizes each channel;
(c) confirm the maximum zoom factor, the flow set dispatched that obtains a channel allocation success closes.When the definite maximum zoom factor, utilize level and smooth method to eliminate some bigger zoom factor isolated points as far as possible, reduce the maximum zoom factor as far as possible.Its detailed process is:
A, link-group binding strategy
Variable describes.L (e) ∈ N, e ∈ E represent the group number that link e binds.Be the group L of every link e (e)=0 that link e does not have bindings group initially.Neigh (u) defined node u can the nodes in communication set.The different group number of the link bundling that is associated to u can not surpass the number of ports K of node u, we can say that therefore the group set that is associated node link binds is feasible.G (u) expression node u not on the same group the set of link bundling that is associated.Be expressed as link bandwidth utilization rate
Be link e all link e in the potential conflict territory
0Flow f (e
0), comprise self and the summation of link capacity ratio separately.At last the group in the maximum link bandwidth utilance as the group link bandwidth utilization rate.Therefore will distribute same channel to distribution phase link on the same group in the phase III, the group link bandwidth utilization rate will be represented collision domain link bandwidth overall utilization, and this also is the resulting final result of channel allocation algorithm.
The link of channel allocation algorithm-group binding strategy will be visited every layer of link set, carry out assign group through this layer link flow descending order.Suppose that each node has q interface, then the link bundling group has three kinds of possibility situation:
(1) (it is several on the same group all less than q that v, two node v u), u, their link that is associated have bound for link e.In this situation, we bind a new group give link e (v, u).
(2) link e (v, u) link that is associated of a node v in two nodes bound on the same group number equal q, another node u is less than q.In this situation, (v u) binds for the group of smallest group link bandwidth utilization rate and link e in the link that selection node v is associated.
(3) link e (v; U) link bundling that is associated of two nodes on the same group number all equal q, in this case, two kinds of situations are arranged; Having at least q bar link to bind link that q different group and this two nodes are associated in (1) two link that node is associated exists and binds identical group; This situation is with group and link e (v, u) binding of smallest group link bandwidth utilization rate.Having at least q bar link to bind link that q different group and this two nodes are associated in (2) two links that node is associated does not exist and binds mutually on the same group; When will be to link e (v; U) during bindings group, two groups in the link that then need be associated to two nodes merge.Detailed process is seen shown in Figure 6.
B, group channel allocation strategy
Second stage at the channel allocation strategy all is that every link is all bound a group among the E.Next will give channel of each set of dispense.The main target of this part is that to minimize each collision domain link bandwidth overall utilization be the minimize channel interference volume.
At first the group link bandwidth utilization rate is sorted from big to small, visit each every limit of group then.Definition ξ
cThe link set and the P (g) that are assigned to channel c for link are the potential interfering link set of the link of g (these links do not have and organize g and bind) for group.1 is defined as all terminal node collection that all links comprised among the group g.Node u in each node interference range of considering in I if be that the link of terminal node does not belong to group g with u, then adds this link among the collection P (g).Then for each channel c, calculate S (g, c), S (g c) is defined as the link of allocated channel c and the common factor of P (g)).If there is channel c
0,
This interfering link collection that all links among group g have been described is not assigned with channel c
0, have a plurality of such c
0The time, we will select a channel that is assigned with maximum number of links (is ξ
cIn the time of maximum), so at allocated channel c
0Link in not with group g in link mutual interference mutually.If there is not such channel c
0, allocated channel c gives group g, the maximum overall utilization of the collision domain of link among the g of minimizing group to greatest extent.
C, confirm the maximum zoom factor
The channel allocation strategy of part has calculated the maximum interference amount of each channel in front; Be expressed as it
and below will carry out convergent-divergent to whole network traffics set through zoom factor λ, can be expressed as:
f (e) here is the flow through link e.Could guarantee a schedulable flow set like this, satisfy
The foregoing description is merely preferred embodiment of the present invention, is not to be used for limiting practical range of the present invention.Be that all equalizations of doing according to content of the present invention change and modification, all contained by claim of the present invention scope required for protection.
Claims (6)
1. a wireless Mesh netword routed channels combined distributing method that disturbs based on topological optimization and reduction is characterized in that: may further comprise the steps: 1) signal transmission beginning;
2) optimize topological structure, the signal that transmits is converted into tree structure through a kind of topological structure greedy algorithm based on flow perception and flow equitable distribution, form the Mesh topological structure after optimizing;
3) utilize the AODV agreement to carry out Route Selection to the Mesh topological structure after the said optimization; The quick self-adapted dynamic link situation of AODV Routing Protocol; Make it to carry out route discovery, set up routing table content, i.e. dynamic link as required according to network topology structure according to the needs that send packet;
4) above-mentioned dynamic link is disturbed the heuristic channel allocation algorithm of avoiding of two steps; The first step, link-group binding; In second step, the group road distributes;
5) flow convergent-divergent:
6) signal allocation finishes.
2. according to claim 1 based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference; It is characterized in that: said step 2); Suppose that all physical link capacity and node link capacity are at a normal range (NR) [a; B] in, the situation that link has big difference can not appear; Simultaneously, in order to reduce the delay effect that jumping figure brings, the present invention's supposition does not communicate with the node between one deck, and node is successively to transmit, and does not consider the communication between the intra-gateway node, only considers the data interaction between node and the gateway.
3. according to claim 1 based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference; It is characterized in that: in the said step 3); In route finding process, mainly carry out according to RREQ request message and RREP response message.In route maintenance procedure, mainly carry out according to Hello message and RERR message.
4. according to claim 3 based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference, it is characterized in that: the Mesh topological structure after the said optimization is when carrying out route discovery, and message is not propagated between with layer.
5. according to claim 1 based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference; It is characterized in that: in the said step 4); Said link group is bound; Promptly, link is divided into groups, simultaneously group is merged the link that makes node distribute and be no more than the number of ports restriction according to utilance according to the link flow situation.
6. according to claim 4 based on topological optimization and the wireless Mesh netword routed channels combined distributing method that reduces interference; It is characterized in that: in the said step 5); Said group of road distribution will be organized according to disturbed condition and carry out channel allocation; Assurance primary distribution success avoids the local channel adjustment to cause overall jitter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100219373A CN102612109A (en) | 2011-01-19 | 2011-01-19 | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100219373A CN102612109A (en) | 2011-01-19 | 2011-01-19 | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102612109A true CN102612109A (en) | 2012-07-25 |
Family
ID=46529194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100219373A Pending CN102612109A (en) | 2011-01-19 | 2011-01-19 | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102612109A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946444A (en) * | 2012-12-06 | 2013-02-27 | 北京邮电大学 | Method for optimizing network topology of lightweight VoIP (voice over Internet protocol) system |
| CN104185242A (en) * | 2014-09-11 | 2014-12-03 | 电子科技大学 | Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference |
| CN104754589A (en) * | 2013-12-26 | 2015-07-01 | 中国科学院沈阳自动化研究所 | Traffic awareness based dynamic networking method |
| CN105407049A (en) * | 2015-10-26 | 2016-03-16 | 西安电子科技大学 | Delay tolerance network maximum flow routing method based on time aggregation graph |
| CN105554888A (en) * | 2015-12-10 | 2016-05-04 | 国网四川省电力公司电力科学研究院 | Link multi-rate-based multi-radio frequency multi-channel wireless Mesh network channel allocation algorithm |
| CN107548101A (en) * | 2017-06-20 | 2018-01-05 | 新华三技术有限公司 | Message processing method and device, AP and computer-readable storage medium |
| CN108475207A (en) * | 2016-01-26 | 2018-08-31 | 华为技术有限公司 | The joint auto zoom of cloud application |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494591A (en) * | 2008-01-23 | 2009-07-29 | 华为技术有限公司 | End-to-end routing method, device and system |
| CN101647238A (en) * | 2007-02-07 | 2010-02-10 | 汤姆逊许可公司 | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks |
-
2011
- 2011-01-19 CN CN2011100219373A patent/CN102612109A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101647238A (en) * | 2007-02-07 | 2010-02-10 | 汤姆逊许可公司 | A radio and bandwidth aware routing metric for multi-radio multi-channel multi-hop wireless networks |
| CN101494591A (en) * | 2008-01-23 | 2009-07-29 | 华为技术有限公司 | End-to-end routing method, device and system |
Non-Patent Citations (2)
| Title |
|---|
| SHU-QIANG HUANG, ET AL,: "An interference-aware power control scheme in Wireless Mesh networks", 《2009 INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING》, 31 December 2009 (2009-12-31) * |
| SHU-QIANG HUANG, ET AL,: "Research of Capacity Optimizing model on Wireless Mesh Networks", 《IEEE 2009》, 31 December 2009 (2009-12-31) * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946444A (en) * | 2012-12-06 | 2013-02-27 | 北京邮电大学 | Method for optimizing network topology of lightweight VoIP (voice over Internet protocol) system |
| CN102946444B (en) * | 2012-12-06 | 2016-01-13 | 北京邮电大学 | A kind of method of lightweight VoIP system topology optimization |
| CN104754589A (en) * | 2013-12-26 | 2015-07-01 | 中国科学院沈阳自动化研究所 | Traffic awareness based dynamic networking method |
| CN104754589B (en) * | 2013-12-26 | 2018-04-03 | 中国科学院沈阳自动化研究所 | Dynamic networking method based on traffic aware |
| CN104185242A (en) * | 2014-09-11 | 2014-12-03 | 电子科技大学 | Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference |
| CN105407049A (en) * | 2015-10-26 | 2016-03-16 | 西安电子科技大学 | Delay tolerance network maximum flow routing method based on time aggregation graph |
| CN105407049B (en) * | 2015-10-26 | 2018-07-03 | 西安电子科技大学 | Delay-tolerant network max-flow method for routing based on time aggregation figure |
| CN105554888A (en) * | 2015-12-10 | 2016-05-04 | 国网四川省电力公司电力科学研究院 | Link multi-rate-based multi-radio frequency multi-channel wireless Mesh network channel allocation algorithm |
| CN105554888B (en) * | 2015-12-10 | 2019-04-16 | 国网四川省电力公司电力科学研究院 | More radio frequency multi-Channel Wireless Mesh Network channel allocation algorithms based on link multi tate |
| CN108475207A (en) * | 2016-01-26 | 2018-08-31 | 华为技术有限公司 | The joint auto zoom of cloud application |
| CN108475207B (en) * | 2016-01-26 | 2021-10-26 | 华为技术有限公司 | Joint auto-scaling of cloud applications |
| CN107548101A (en) * | 2017-06-20 | 2018-01-05 | 新华三技术有限公司 | Message processing method and device, AP and computer-readable storage medium |
| CN107548101B (en) * | 2017-06-20 | 2020-12-04 | 新华三技术有限公司 | Message processing method and device, AP and computer storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mohsenian-Rad et al. | Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks | |
| CN102612109A (en) | Wireless Mesh network routing channel union distribution method based on topology optimization and interference reduction | |
| CN1878134A (en) | Time-delay constrained multipath routing method for Ad hoc network | |
| CN103888976A (en) | Link selection method combined with network scheduling and routing | |
| Mogaibel et al. | Review of channel assignment approaches in multi-radio multi-channel wireless mesh network | |
| CN103428803A (en) | Opportunistic routing method combining with opportunistic network coding | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN114374721A (en) | Power line and wireless communication fusion method and system for power internet of things | |
| CN101848522A (en) | Method for distributing Underaly cognitive radio Mesh network channel | |
| CN104754589B (en) | Dynamic networking method based on traffic aware | |
| CN101674634B (en) | Multichannel based reactive routing method in cognitive radio system | |
| CN103096413A (en) | Multi-interface multi-hop wireless network lower-distribution type cooperation route method | |
| Liu et al. | Channel assignment exploiting partially overlapping channels for wireless mesh networks | |
| Wang et al. | Scaling laws on multicast capacity of large scale wireless networks | |
| Ahmeda et al. | Review of routing metrics and protocols for wireless mesh network | |
| CN103298060B (en) | Wireless mesh network via node method for arranging centered by content | |
| CN110072266A (en) | Consider the wireless Mesh netword QoS routing method for channel allocation of jamming power | |
| Chen et al. | Channel assignment schemes in wireless mesh networks | |
| Theoleyre et al. | Assignment of roles and channels for a multichannel mac in wireless mesh networks | |
| CN101494593A (en) | Method for implementing optimization unite connection allowance and route control of wireless mesh network | |
| Fu et al. | Flow-based channel assignment in channel constrained wireless mesh networks | |
| Nargesi et al. | Efficient multicast and channel assignment in multi-channel wireless mesh networks | |
| Rezaei et al. | Online QoS multicast routing in multi-channel multi-radio wireless mesh networks using network coding | |
| Feng et al. | Improving capacity and flexibility of wireless mesh networks by interface switching | |
| Vergados et al. | Enhanced End-to-End TDMA for wireless ad-hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120725 |