New! View global litigation for patent families

CN102769887A - Multipath selection method of wireless mesh network - Google Patents

Multipath selection method of wireless mesh network Download PDF

Info

Publication number
CN102769887A
CN102769887A CN 201210131392 CN201210131392A CN102769887A CN 102769887 A CN102769887 A CN 102769887A CN 201210131392 CN201210131392 CN 201210131392 CN 201210131392 A CN201210131392 A CN 201210131392A CN 102769887 A CN102769887 A CN 102769887A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
network
mesh
wireless
selection
method
Prior art date
Application number
CN 201210131392
Other languages
Chinese (zh)
Inventor
黄东
黄林果
Original Assignee
黄林果
Priority date (The priority date 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 date listed.)
Filing date
Publication date

Links

Abstract

The invention provides a multipath selection method of a wireless mesh network. Optimal path selection is realized by initializing route through the wireless mesh network, selecting a node with the minimum vector label and calculating the number of new vector labels. The multipath selection method of the wireless mesh network has the advantages that optimized utilization of network resources and efficient transmission of business resources in the wireless mesh network are realized.

Description

—种无线mesh网络的多路径选择方法 - selection method of multi-path wireless mesh network species

技术领域 FIELD

[0001 ] 本发明涉及通信技术领域,特别是涉及路由理论。 [0001] The present invention relates to communication technologies, and more particularly to routing theory.

背景技术 Background technique

[0002] 无线mesh网络(Wireless Mesh Networks, WMN)是一种多跳、具有自组织和自愈特点的宽带无线网络结构,即ー种高容量、高速率的分布式网络。 [0002] Wireless mesh networks (Wireless Mesh Networks, WMN) is a multi-hop wireless broadband network architecture having self-organizing and self-healing characteristics, i.e. high capacity ー A distributed network, a high rate. WMN包括两类节点:移动节点MN(Mobile Node)和接入节点AP (Access Point),网络中的姆个节点都具备路由选择的功能,可以向网络中的其它节点(MN或AP)转发它所接收到的数据包,因而WMN也是ー种自组织和自管理网络,可以看成是移动Adhoc网络技术的ー种简化版本。 WMN comprises two types of nodes: the mobile node MN (Mobile Node) and an access node AP (Access Point), the network nodes are equipped with Tim routing functions, it may be forwarded to other nodes (MN or AP) network the received packet, and thus also the WMN ー kinds of self-organizing and self-managed network can be seen as a mobile Adhoc network technology ー species simplified version. 但两者又有一定的区别,主要的不同在于WMN中的接入点可以作为移动Adhoc网络的一种对等的数据转发实体,又可以作为一种连接到其它有线或无线网络的桥接器。 However, there are certain differences between the two, the main difference is that the access point may WMN as a kind of data such as moving forward Adhoc network entity, but also as a connector to other wired or wireless network bridge. 同时WMN又不同于传统的无线网络,可以看成是WLAN(单跳)和移动Adhoc网络(多跳)的融合,且发挥了两者的优势,如图I所示。 Meanwhile WMN is different from the traditional wireless network, it can be seen as WLAN (single hop) and Mobile Adhoc network (multi-hop) fusion, and advantages of both, as shown I FIG.

[0003] 由于无线mesh网络中多径技术可以很好地避免单径时的网络震荡影响,在充分利用带宽等网络资源的同时实现负载均衡、路由迂回和容错等。 [0003] Since the multipath wireless mesh network technology can avoid the influence of the shock at the time of single-path network, at the same time full use of bandwidth and other network resources, load balancing, fault tolerance, and circuitous routes. 在其中某条链路因为信道质量恶化不能正常工作时,其他链路可以继续使用,也可以在路由故障时,避免路由重建等操作。 When a link where the channel quality deteriorates because not work, the other can continue to use the link, the fault may be routing to avoid routing reconstruction operation.

[0004] 路径的不相关性对于多路径路由来说是非常重要的,路径的不相关性越强,多路径路由越能充分地利用网络资源,増大节点间的有效带宽,减轻网络的拥塞,降低分组丢失率。 Irrelevance [0004] path for multi-path routing is very important, irrelevant of the path of the stronger, multi-path routing more able to make full use of network resources, effective bandwidth between zo large node, reduce network congestion, reduce the packet loss rate. 在多路径路由中,路径不相关性可分为节点不相关性和链路不相关性。 In the multi-path routing, the path may be divided into no correlation irrelevance irrelevant nodes and links. 具有节点不相关性的路径集合我们称为节点不相关路径集,这个集合中的路径之间除源节点和目的节点以外没有其他共同节点。 Path having no relevance set of nodes we call path set uncorrelated nodes, there is no other common node between the collection path except the source node and the destination node. 具有链路不相关性的路径集合我们称为链路不相关路径,集合中的路径没有共同的链路。 Paths with no correlation link collection we call links are not relevant path, the path set no common link.

[0005] 综上所述:在无线mesh网络中,有必要采用高效的路径选择方法,实现网络资源的高效利用。 [0005] In summary: In the wireless mesh network, it is necessary to use an efficient path selection method, for efficient use of network resources.

[0006] [0006]

发明内容 SUMMARY

[0007] 本发明所要解决的技术问题是:解决无线mesh网络中多径优化选择问题。 [0007] The present invention solves the technical problem: solving multipath wireless mesh network selection optimization.

[0008] 本发明为解决上述技术问题所采用的技术方案为:提供一种基于矢量标签的无线mesh网络的多径优化选择方法,该方法通过选择具有最小矢量标签的节点获取最优路径;其特征在于:发明ー种针对无线mesh网络的多路径优化选择方法,包括以下步骤: [0008] Technical Solution The present invention to solve the above technical problem are: to provide an alternative method for optimizing wireless mesh network multipath vector based tag, which tag node having the minimum vector acquired by selecting the optimal path; which characterized in that: species invention ー wireless mesh networks for multi-path selection optimization method, comprising the steps of:

A、无线mesh网络路由初始化并选择具有最小矢量标签的节点; A, wireless mesh network routing and select the node having the smallest initialization vector tags;

B、计算新的矢量标签数量,并选择最优路径。 B, the number of vectors calculating a new label, and select the optimal path.

[0009] 所述步骤A中,首先进行初始化,令 [0009] In the step A, firstly initialized, so

4 = (0,0),对于所有的节点J其O有/) = (00,①)'并且ア=(厂),矣={l},r = {l},ち=0。 4 = (0,0), the node J has all its O /) = (00, ①) 'and ア = (plant), carry = {l}, r = {l}, ち = 0. [0010] 所述步骤A中,进行具有最小矢量标签节点的选择。 [0010] In the step A, the vector having the smallest label selected node. 令r为无线mesh网络中的节点集合,并且ち#0,令为序号J的集合,并且Jer或者ち#0。 Let r wireless mesh network collection of nodes, and ち # 0, so is the set number J, and Jer or ち # 0. 如果T不存在, If T does not exist,

则选择最优路径,如果ァ存在,则计算c = ,并选择节点ノ,使其满足 Selecting an optimal path, if present ASTON, is calculated c =, and selects the node Techno, to satisfy

J = max fk ^cck' = C ,K eT,HE i?(.J ,如果馬不存在,则从Pq中删除路径社,从.ア中删除.j,如 J = max fk ^ cck '= C, K eT, HE i? (. J, if the horse does not exist, the path is deleted from Pq Co., .j. ア deleted from, such as

果,为最终值,则停止计算,反之则计算新的标签个数,其中为链路(I,/)的双标签矢量,6为从节点r至节点J的第夺路径的双标签矢量,CcJ为从节点r至节点J的 As a result, a final value, the calculation is stopped, otherwise new calculated number of labels, wherein a link (I, /) vector ditag, the ditag 6 is a vector from node r to node J of the first capture path, CcJ from node r to node J

第k条路径的第,个属性代价,ち为节点J的非主向量标签的序号r的集合,如图2所示。 A set of non-primary vector r number tag of the k-th path, the cost attribute, ち to node J, as shown in FIG.

[0011] 所述步骤B中,进行新的矢量标签个数的计算。 The [0011] Step B, a new calculation of the number of tag vectors. 对于从节点J中产生的每ー个节点t ,计算路径ii新的矢量标签,并执行以下步骤:如果た,则为节点t产生ー个新的矢量标签,并令A =U),T7 = TUM,^ = ^Ul*},并返回进行具有最小矢量标签节点的选择;如果たer并且たgr,则将节点.t的非主矢量标签与新的矢量标签进行对比,如果其具有重要作用,则将其删除,反之则将其添加于列表中,选择未在h中出现的i值作为第一个值,并令4=仞,T=TUM,返回进行具有最小矢量标签节点的选择;如果并且 For each node ー t generated from the node J, the new vector calculating path label ii, and perform the following steps: If ta, for the node t generate new vectors ー label, and let A = U), T7 = TUM, ^ = ^ Ul *}, and returns the selected node having the smallest vector tag; if ta and ta er GR, then a non-primary node .t vector new vector tag label comparison, if it has an important role , it is deleted, whereas it is added to the list, select the value of i does not appear as the first value h, and let Ren = 4, T = TUM, the vector having the smallest return label selected node; and if

keT ,则将节点た的未选择的非主矢量标签与新的矢量标签进行对比,若一部分新的矢量标签具有重要作用,则将其删除,然后将节点i的非主矢量标签与新的矢量标签进行对比, Ket, then node ta unselected non-primary vector with the new tag label vector comparison, if the vector part of the new tag has an important role, it is deleted, then the non-master node i and the label vector New Vector label comparison,

选择未在馬中出现的i值作为第一个值,并令み=M ,并返回进行具有最小 Selecting the value of i does not appear in horses as a first value, and let Mi = M, and a minimum return for having

矢量标签节点的选择。 Vector label selected node.

[0012] 所述步骤B中,进行最优路径的选择。 [0012] In the step B, selecting the optimal path. 从上述步骤获得的路径代价函数和寻找获得的所有非主路径,可基于最小代价值选择最优路径。 All non-primary route path obtained from the above step to obtain the cost function and find, select the optimal path based on the minimum cost value.

[0013] 本发明的有益效果为:提供一种基于矢量标签的无线mesh网络的多径选择方法,实现了网络资源的高效利用。 [0013] Advantageous effects of the present invention is: to provide a multi-path method for selecting a wireless mesh network tag based vector, to achieve efficient use of network resources.

附图说明 BRIEF DESCRIPTION

[0014] 图I为无线mesh网络结构示意图; [0014] Figure I is a schematic structure of a wireless mesh network;

图2为多径选择方法实现流程示意图。 FIG 2 is a schematic flow diagram implemented method of multi-path selector.

Claims (5)

1.提供一种基于矢量标签的无线mesh网络的多径优化选择方法,通过选择具有最小矢量标签的节点获取最优路径,实现了业务的优化传输,包括如下步骤: A、无线mesh网络路由初始化并选择具有最小矢量标签的节点; B、计算新的矢量标签数量,并选择最优路径。 1. A wireless mesh network to provide a tag-based vector multipath The optimization method, by selecting a node having the smallest vector obtaining optimal path label, to achieve the optimal transmission services, comprising the steps of: A, wireless mesh network routing initialization and select the node having the smallest vector labels; B, calculating a new label number of vectors, and select the optimal path.
2.根据权利要求I的方法,对于所述步骤A其特征在于:首先进行初始化,令41 = (O, O),对于所有的节点O 有/; = (»,》),并且T=(r), Rr = {1}, r = {U'. = 0。 2. The method of claim I, for the step A wherein: First, initialization, so 41 is = (O, O), for all nodes have O /; = ( »"), and T = ( r), Rr = {1}, r = {U '. = 0.
3.根据权利要求I的方法,对于所述步骤A其特征在于:进行具有最小矢量标签节点的选择,令-为无线mesh网络中的节点集合,并且巧#0,令力序号J的集合,并且J 或者如果·T不存在,则选择最优路径,如果T存在,则计算c = ,并选择节点』,使其满足^/ = !!!^.+# = ^,^^!^^^ ,如果4不存在,则从&中删除路径S,从了中删除J,如果J为最终值,则停止计算,反之则计算新的标签个数,其中4 =¾., 为链路的双标签矢量,ή为从节点^至节点j的第k条路径的双标签矢量,ccf为从节点广至节卢的第L条路径的第:个属性代价,i?,.为节点J的非主向量标签的序号I的集合。 3. A method according to claim I, for the said step A comprising: selecting a node having the minimum vector of the label, so that - for the wireless mesh network collection of nodes, and clever # 0, so that the force of the set number J, · T and J or if does not exist, choose the best path, if T is present, calculated c =, and select the node "to meet the ^ / = ^! + # = ^ ^ ^! ^^ ^, if absent, & deleted from the path S, the deleted from the J, if J is the final value, the calculation is stopped, otherwise calculating a new label number, where 4 = ¾., to link ditags vector, ή first of ^ to ditag vector node k-th path j is, ccf is wide from the node from the node to the section Lu article L paths:?. attribute consideration, i, for the node J non-set number of principal vectors I tag.
4.根据权利要求I的方法,对于所述步骤B其特征在于:进行新的矢量标签个数的计算,对于从节*中产生的每一个节点A,计算路径H新的矢量标签,并执行以下子步骤:a.如果免g F ,则为节点是产生一个新的矢量标签,并令& ={1},T^T{J{k] , V^V\J{k),并返回进行具有最小矢量标签节点的选择;b.如果teF并且tg'r,则将节点i的非主矢量标签与新的矢量标签进行对比,如果其具有重要作用,则将其删除,反之则将其添加于列表中,选择未在八中出现的,值作为第一个值,并令,T = TIJM,返回进行具有最小矢量标签节点的选择;c.如果免eF并且则将节点i的未选择的非主矢量标签与新的矢量标签进行对比,若一部分新的矢量标签具有重要作用,则将其删除,然后将节点t的非主矢量标签与新的矢量标签进行对比,选择未在Λ中出现的ί值作为第一个值,并令Rk={i] ,Rk = Rk\J{i], 4. A method according to claim I, for the said step B further comprising: calculating a new label number of a vector, for each node generated from section A * calculated path H new label vector, and performs following sub-steps:. a Free If g F, compared to generate a new node is a vector label, and let & = {1}, T ^ T {J {k], V ^ V \ J {k), and returns tag having the minimum vector selected node;. b and if teF tg'r, non-primary vector label a node i with the new label vector comparison, if it has an important role, it is deleted, then it is vice versa added to the list, select not appear in the eight value as the first value, and so, T = TIJM, returns a vector having the smallest label selected node; if not selected will eF Free nodes i and c. non-primary vector with the new tag compare vector label, if the label portion of the new vector has an important role, it is deleted, then non-master node t of the vector with the new tag label vector comparison, the selection is not Λ ί values ​​occurring as a first value, and so Rk = {i], Rk = Rk \ J {i], 返回进行具有最小矢量标签节点的选择。 Returns a vector having the smallest label selected node.
5.根据权利要求I的方法,对于所述步骤B其特征在于:进行最优路径的选择,然后从上述步骤获得的路径代价函数和寻找获得的所有非主路径,可基于最小代价值选择最优路径。 5. A method according to claim I, for the said step B further comprising: selecting the optimal path, the path and all non-primary path obtained from the above steps and find the cost function obtained, may be selected based on the smallest cost value most shortest paths.
CN 201210131392 2012-05-02 2012-05-02 Multipath selection method of wireless mesh network CN102769887A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201210131392 CN102769887A (en) 2012-05-02 2012-05-02 Multipath selection method of wireless mesh network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201210131392 CN102769887A (en) 2012-05-02 2012-05-02 Multipath selection method of wireless mesh network

Publications (1)

Publication Number Publication Date
CN102769887A true true CN102769887A (en) 2012-11-07

Family

ID=47097108

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201210131392 CN102769887A (en) 2012-05-02 2012-05-02 Multipath selection method of wireless mesh network

Country Status (1)

Country Link
CN (1) CN102769887A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007005805A1 (en) * 2005-06-30 2007-01-11 Intel Corporation Channel selection for mesh networks having nodes with multiple radios
CN101022379A (en) * 2007-03-07 2007-08-22 阿德利亚科技(北京)有限责任公司 Channel distributing method and device in wireless mesh network
CN101965715A (en) * 2007-12-26 2011-02-02 北方电讯网络有限公司 Tie-Breaking in Shortest Path Determination

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007005805A1 (en) * 2005-06-30 2007-01-11 Intel Corporation Channel selection for mesh networks having nodes with multiple radios
CN101022379A (en) * 2007-03-07 2007-08-22 阿德利亚科技(北京)有限责任公司 Channel distributing method and device in wireless mesh network
CN101965715A (en) * 2007-12-26 2011-02-02 北方电讯网络有限公司 Tie-Breaking in Shortest Path Determination

Similar Documents

Publication Publication Date Title
US7035937B2 (en) Independent-tree ad hoc multicast routing
Florens et al. Lower bounds on data collection time in sensory networks
US20120033668A1 (en) IP Multicast Snooping and Routing with Multi-Chassis Link Aggregation
US8553562B2 (en) Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism
US20060133282A1 (en) Systems and methods for multipath routing
US20100290464A1 (en) Method and apparatus for providing fast reroute of a multicast packet within a network element to an available port associated with a multi-link trunk
WO2011083780A1 (en) Communication system, control apparatus, processing rule setting method, packet transmitting method and program
US20120033678A1 (en) Multi-chassis inter-process communication
Lui et al. STAR: a transparent spanning tree bridge protocol with alternate routing
US20130308444A1 (en) Method and apparatus for determining paths between source/destination pairs
US20060087965A1 (en) Method and apparatus for forwarding data in a data communications network
Müller et al. Survivor: an enhanced controller placement strategy for improving SDN survivability
Ramasubramanian et al. Disjoint multipath routing using colored trees
CN101325544A (en) Method for establishing multi-path route based on link multiple characteristic values in wireless sensor network
US20100290396A1 (en) Split-plane wireless network architecture
US20100293200A1 (en) Method and apparatus for maintaining port state tables in a forwarding plane of a network element
CN102970225A (en) Internet protocol (IP) over wavelength division multiplexing (WDM) network energy-aware routing method based on multipriority business
Guo et al. Traffic engineering in SDN/OSPF hybrid network
US20140029412A1 (en) Systems and methods for providing anycast mac addressing in an information handling system
US20140241146A1 (en) System and method for traffic polarization during failures
Cheng et al. Bernoulli sampling based (ε, δ)-approximate aggregation in large-scale sensor networks
US20120057603A1 (en) Automated Traffic Engineering for 802.1AQ Based Upon the Use of Link Utilization as Feedback into the Tie Breaking Mechanism
CN1738291A (en) Ad hot network subsequent multi-path route method based on load balance
US8059638B2 (en) Inter-node link aggregation system and method
CN101754316A (en) QoS energy-saving routing method based on maximization network life cycle

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
C12 Rejection of a patent application after its publication