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

Multipath selection method of wireless mesh network Download PDF

Info

Publication number
CN102769887A
CN102769887A CN2012101313926A CN201210131392A CN102769887A CN 102769887 A CN102769887 A CN 102769887A CN 2012101313926 A CN2012101313926 A CN 2012101313926A CN 201210131392 A CN201210131392 A CN 201210131392A CN 102769887 A CN102769887 A CN 102769887A
Authority
CN
China
Prior art keywords
node
label
vector
vector label
path
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
Application number
CN2012101313926A
Other languages
Chinese (zh)
Inventor
黄东
黄林果
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
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
Application filed by Individual filed Critical Individual
Priority to CN2012101313926A priority Critical patent/CN102769887A/en
Publication of CN102769887A publication Critical patent/CN102769887A/en
Pending legal-status Critical Current

Links

Images

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

A kind of multipath system of selection of wireless mesh network
Technical field
The present invention relates to communication technical field, particularly relate to the route theory.
Background technology
Wireless mesh network (Wireless Mesh Networks, WMN) be a kind of multi-hop, have a broadband wireless network structure of self-organizing and self-healing characteristics, the distributed network of promptly a kind of high power capacity, two-forty.WMN comprises two category nodes: mobile node MN (Mobile Node) and access node AP (Access Point); Each node in the network all possesses the function of Route Selection; Can transmit its received packet by other node (MN or AP) in network; Thereby WMN also is a kind of self-organizing and from supervising the network, can regard a kind of simple version of mobile Ad hoc network technology as.But both have certain difference again, and main difference is that the access point among the WMN can be used as the Data Relay Entity of a kind of equity of mobile Ad hoc network, can be used as a kind of bridger that is connected to other wired or wireless network again.WMN is different from traditional wireless network again simultaneously, can regard the fusion of WLAN (single-hop) and mobile Ad hoc network (multi-hop) as, and bring into play both advantages, and is as shown in Figure 1.
Because the network concussion influence when the multipath technology can be avoided single footpath well in the wireless mesh network, when making full use of Internet resources such as bandwidth, realize load balancing, route is circuitous and fault-tolerant etc.When certain bar link was because of the channel quality degrades cisco unity malfunction therein, other links can continue to use, and also can when routing failure, avoid operations such as route reconstruction.
The irrelevance in path is very important for the multipath route, and the irrelevance in path is strong more, and the multipath route can be utilized Internet resources more fully, increases internodal effective bandwidth, alleviates the congested of network, reduces packet loss rate.In the multipath route, the path irrelevance can be divided into node irrelevance and link irrelevance.Have the node irrelevance set of paths we be called the uncorrelated path set of node, do not have other common node except that source node with the destination node between the path in this set.Have the link irrelevance set of paths we be called the uncorrelated path of link, the path in the set does not have common link.
In sum: in wireless mesh network, be necessary to adopt routing resource efficiently, realize the efficient utilization of Internet resources.
 
Summary of the invention
Technical problem to be solved by this invention is: solve multipath optimized choice problem in the wireless mesh network.
The present invention solves the problems of the technologies described above the technical scheme that is adopted to be: a kind of multipath The optimization method of the wireless mesh network based on the vector label is provided, and this method is obtained optimal path through the node of selecting to have minimum vector label; It is characterized in that: invent a kind of multi-path optimization system of selection, may further comprise the steps to wireless mesh network:
A, the initialization of wireless mesh network route and selection have the node of minimum vector label;
B, the new vector number of labels of calculating, and select optimal path.
In the said steps A; At first carry out initialization; Make
Figure 918713DEST_PATH_IMAGE001
;
Figure DEST_PATH_IMAGE002
has
Figure 773536DEST_PATH_IMAGE003
for all nodes, and .
In the said steps A, has the selection of minimum vector label node.Make and be the node set in the wireless mesh network; And ; Make
Figure 260067DEST_PATH_IMAGE007
to be the set of sequence number
Figure DEST_PATH_IMAGE008
, and
Figure 74439DEST_PATH_IMAGE009
perhaps
Figure 834585DEST_PATH_IMAGE006
.If
Figure 39301DEST_PATH_IMAGE005
do not exist; Then select optimal path; If
Figure 238202DEST_PATH_IMAGE005
exists; Then calculate
Figure DEST_PATH_IMAGE010
; And selection node
Figure 343299DEST_PATH_IMAGE008
; Make its satisfied ; If
Figure DEST_PATH_IMAGE012
do not exist; Then from
Figure 28675DEST_PATH_IMAGE012
, delete path
Figure 765687DEST_PATH_IMAGE013
; Deletion
Figure 656599DEST_PATH_IMAGE008
from
Figure 289072DEST_PATH_IMAGE005
; If
Figure 835908DEST_PATH_IMAGE008
is end value; Then stop to calculate; Otherwise then calculate new label number; Wherein
Figure DEST_PATH_IMAGE014
is two label vectors of link
Figure 111032DEST_PATH_IMAGE015
;
Figure DEST_PATH_IMAGE016
is two label vectors of
Figure DEST_PATH_IMAGE018
paths from node
Figure 190721DEST_PATH_IMAGE017
to node
Figure 463570DEST_PATH_IMAGE008
;
Figure 130175DEST_PATH_IMAGE019
is
Figure DEST_PATH_IMAGE020
individual attribute cost of paths from node
Figure 146672DEST_PATH_IMAGE017
to node
Figure 644650DEST_PATH_IMAGE008
;
Figure 740837DEST_PATH_IMAGE012
is the set of sequence number
Figure 913509DEST_PATH_IMAGE020
of the non-principal vector label of node , and be as shown in Figure 2.
Among the said step B, carry out the calculating of new vector label number.For each node
Figure 231675DEST_PATH_IMAGE018
that from node , produces; The new vector label of calculating path
Figure 652292DEST_PATH_IMAGE013
; And execution following steps: if
Figure 561080DEST_PATH_IMAGE021
; Then be that node
Figure 612213DEST_PATH_IMAGE018
produces a new vector label; And make
Figure DEST_PATH_IMAGE022
;
Figure 35978DEST_PATH_IMAGE023
;
Figure DEST_PATH_IMAGE024
, and return selection with minimum vector label node; if
Figure 135653DEST_PATH_IMAGE025
and ; Then the non-master vector label of node
Figure 633368DEST_PATH_IMAGE018
and new vector label are compared; If it has important function; Then with its deletion; Otherwise then it is made an addition in the tabulation;
Figure 330245DEST_PATH_IMAGE020
value of selecting in
Figure 917719DEST_PATH_IMAGE027
, not occur is as first value; And make
Figure DEST_PATH_IMAGE028
;
Figure 233610DEST_PATH_IMAGE023
returns the selection with minimum vector label node; if and
Figure 542549DEST_PATH_IMAGE029
; Then the unselected non-master vector label of node and new vector label are compared; If the new vector label of a part has important function; Then with its deletion; Then the non-master vector label of node
Figure 468138DEST_PATH_IMAGE018
and new vector label are compared;
Figure 943430DEST_PATH_IMAGE020
value of selecting in
Figure 769807DEST_PATH_IMAGE027
, not occur is as first value; And make
Figure 330549DEST_PATH_IMAGE028
;
Figure DEST_PATH_IMAGE030
, and return selection with minimum vector label node.
Among the said step B, carry out the selection of optimal path.From above-mentioned steps the path cost function that obtains and all non-main paths of seeking acquisition, can select optimal path based on the minimum cost value.
Beneficial effect of the present invention is: a kind of multi-path selecting method of the wireless mesh network based on the vector label is provided, has realized the efficient utilization of Internet resources.
Description of drawings
Fig. 1 is the wireless mesh network structural representation;
Fig. 2 is a multi-path selecting method realization flow sketch map.

Claims (5)

1. a kind of multipath The optimization method of the wireless mesh network based on the vector label is provided, obtains optimal path, realized professional optimization transmission, comprise the steps: through the node of selecting to have minimum vector label
A, the initialization of wireless mesh network route and selection have the node of minimum vector label;
B, the new vector number of labels of calculating, and select optimal path.
2. according to the method for claim 1; It is characterized in that for said steps A: at first carry out initialization; Make ; has
Figure 655172DEST_PATH_IMAGE003
for all nodes, and
Figure 519222DEST_PATH_IMAGE004
.
3 The method according to claim 1, wherein for the step A in that: for the node having the smallest vector label selection, so that
Figure 333595DEST_PATH_IMAGE005
for the wireless mesh network node set and
Figure 592276DEST_PATH_IMAGE006
, so that
Figure 859309DEST_PATH_IMAGE007
is the number to set and
Figure 727088DEST_PATH_IMAGE009
or
Figure 189293DEST_PATH_IMAGE006
, if
Figure 943622DEST_PATH_IMAGE005
does not exist, then select the optimal path, if
Figure 680634DEST_PATH_IMAGE005
exist , calculate
Figure 204019DEST_PATH_IMAGE010
, and select a node
Figure 102705DEST_PATH_IMAGE008
, so as to satisfy
Figure 282014DEST_PATH_IMAGE011
, if does not exist, from
Figure 669450DEST_PATH_IMAGE012
Delete path
Figure 4616DEST_PATH_IMAGE013
from
Figure 733538DEST_PATH_IMAGE005
Delete
Figure 812352DEST_PATH_IMAGE008
, if as the ultimate value, then stop the calculation, otherwise calculate the number of the new label, where
Figure 550818DEST_PATH_IMAGE014
is a link
Figure 501457DEST_PATH_IMAGE015
double label vector, from node
Figure 205288DEST_PATH_IMAGE017
to the node first
Figure 585770DEST_PATH_IMAGE018
double label vector paths,
Figure 6387DEST_PATH_IMAGE019
from node to the node first path first
Figure 709322DEST_PATH_IMAGE020
attribute consideration,
Figure 239660DEST_PATH_IMAGE012
for the node
Figure 524011DEST_PATH_IMAGE008
non-primary vector labels No.
Figure 936538DEST_PATH_IMAGE020
collection.
4. according to the method for claim 1; It is characterized in that for said step B: carry out the calculating of new vector label number; For each node that from node
Figure 964537DEST_PATH_IMAGE008
, produces; The new vector label of calculating path
Figure 804634DEST_PATH_IMAGE013
; And carry out following substep: if a.
Figure 704457DEST_PATH_IMAGE021
; Then be that node
Figure 270567DEST_PATH_IMAGE018
produces a new vector label; And make
Figure 41077DEST_PATH_IMAGE022
;
Figure 401652DEST_PATH_IMAGE023
; , and return selection with minimum vector label node; B. if
Figure 158572DEST_PATH_IMAGE025
and
Figure 49168DEST_PATH_IMAGE026
; Then the non-master vector label of node
Figure 315064DEST_PATH_IMAGE018
and new vector label are compared; If it has important function; Then with its deletion; Otherwise then it is made an addition in the tabulation; value of selecting in
Figure 923900DEST_PATH_IMAGE027
, not occur is as first value; And make ;
Figure 544871DEST_PATH_IMAGE023
returns the selection with minimum vector label node; C. if
Figure 641003DEST_PATH_IMAGE025
and
Figure 352607DEST_PATH_IMAGE029
; Then the unselected non-master vector label of node and new vector label are compared; If the new vector label of a part has important function; Then with its deletion; Then the non-master vector label of node and new vector label are compared;
Figure 658638DEST_PATH_IMAGE020
value of selecting in
Figure 408922DEST_PATH_IMAGE027
, not occur is as first value; And make
Figure 643911DEST_PATH_IMAGE028
;
Figure 422511DEST_PATH_IMAGE030
, and return selection with minimum vector label node.
5. according to the method for claim 1, it is characterized in that: carry out the selection of optimal path,, can select optimal path based on the minimum cost value then from above-mentioned steps the path cost function that obtains and all non-main paths of seeking acquisition for said step B.
CN2012101313926A 2012-05-02 2012-05-02 Multipath selection method of wireless mesh network Pending CN102769887A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2012101313926A 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
CN2012101313926A CN102769887A (en) 2012-05-02 2012-05-02 Multipath selection method of wireless mesh network

Publications (1)

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

Family

ID=47097108

Family Applications (1)

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

Country Status (1)

Country Link
CN (1) CN102769887A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106304170A (en) * 2016-10-21 2017-01-04 黄东 A kind of uplink resource optimization method of wireless mesh network

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 北方电讯网络有限公司 Clinching a tie during shortest path is determined

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 北方电讯网络有限公司 Clinching a tie during shortest path is determined

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106304170A (en) * 2016-10-21 2017-01-04 黄东 A kind of uplink resource optimization method of wireless mesh network

Similar Documents

Publication Publication Date Title
Jiang et al. A multicast delivery approach with minimum energy consumption for wireless multi-hop networks
CN108112049B (en) A kind of wireless sensor network efficiency optimization cluster-dividing method based on whale group algorithm
CN102137465B (en) Channel allocation method suitable for opportunistic routing in multi-radio frequency multi-channel wireless mesh network
CN108882299B (en) Distributed congestion control, routing and power distribution method for wireless multi-hop network
Unnikrishnan et al. Cooperative routing for improving the lifetime of wireless ad-hoc networks
CN103200643A (en) Distributed fault-tolerant topology control method based on dump energy sensing
CN111132236B (en) Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol
CN108134772A (en) A kind of safety routing method using AODV or DSDV protocol realizations
CN102711125A (en) Method for improving transmission capability of wireless mesh network
CN105472484A (en) Wave channel balancing route wavelength allocation method of power backbone optical transport network
Seppänen et al. Multipath routing for mmWave WMN backhaul
Zhu et al. Efficient hybrid multicast approach in wireless data center network
Waqas et al. A game theoretical approach for topology control in wireless ad hoc networks with selfish nodes
CN106658647A (en) Relay selection algorithm based on interference perception
Medjiah et al. GEAMS: a geographic energy-aware multipath stream-based routing protocol for WMSNs
CN108093496B (en) ISA100.11a standard-based consistency networking method
CN102769887A (en) Multipath selection method of wireless mesh network
CN103228020A (en) Mobile ad-hoc network routing system and method based on intelligent water drop
CN202353820U (en) Novel wireless network system
CN103686916A (en) Multi-path data transmission method of industrial wireless sensor network based on surplus energy and expected transmission count
CN103619047A (en) Opportunistic routing method in multiple-concurrent-flow wireless mesh network
Shao et al. Traffic scheduling for wireless meter data collection in smart grid communication network
CN103581838B (en) A kind of Ad Hoc network information sharing method
CN102694623A (en) Method for distributing speed rate in multi-hop wireless network based on network coding among sessions
Liu et al. A load balanced routing protocol based on ant colony algorithm for wireless mesh 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
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20121107