CN101616431A - The implementation method of network in wireless mesh network and node - Google Patents

Abstract

The invention discloses a kind of implementation method and node of network in wireless mesh network.The implementation method of described network in wireless mesh network comprises step: to need in the network to obtain the node and the routing information of monitoring; According to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, selects the bigger node set of the resident weights of node in the candidate collection described agency, acts on behalf of as monitoring; Adopt the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network; Wherein, the expection transmission time SMETT of calculating path and form route result of calculation in described route transmission process, and control the grouping route or transmit operation according to described result.The present invention can improve network performance, reduces resource consumption.

Description

The implementation method of network in wireless mesh network and node

Technical field

The present invention relates to the communications field, particularly relate to wireless mesh network Mesh network (WMN, wireless Mesh Network).

Background technology

Wireless Mesh netword is based on the WiMAX access technology of IP agreement, it has merged WLAN (wireless local area network) (WLAN, Wireless LAN) and the Adhoc network advantages, support multi-multipoint network structure, have characteristics such as intelligent advantages such as MANET, selfreparing, multi-hop cascade, node self-management and mobile broadband, wireless location, be the network of a kind of big capacity, two-forty, wide coverage, become a kind of effective means of broadband access.Say that in a sense what the Mesh network was main is a kind of network architecture thought, major function is embodied in no center, MANET, multistage jumper connection and route and judges selection etc.

In the network that adopts the Mesh technology building, its topological structure is grid-like, and typical structure as shown in Figure 1.Whole network is made up of WAP (wireless access point) (AP), wireless router (WR), terminal equipment (CLIENT).Wherein, an AP can connect a plurality of WR in tens to up to a hundred meters scope, the main effect of AP is that wireless network is inserted core net, secondly each terminal equipment that links to each other with WR is linked together, and makes the terminal equipment that wireless network card is housed can share the resource of core net by AP.In addition, described AP can be replaced by smart access point (IAP), and IAP is the equipment that has increased the Adhoc routing function on the basis of AP.In addition, AP/IAP also has network management function, realizes control and management to Radio Access Network, with traditional intelligent being distributed in the access point (AP/IAP), and the construction cost of saving backbone network greatly, the ductility of raising network.As the WR of IAP lower floor configuration, its function is that the terminal equipment (being the user) for bottom provides packet routing and transfer functions, and downloads and realize the radio broadcasting software upgrading from IAP.Route according to spendable node configuration offhand decision is at that time transmitted grouping information promptly realizes dynamic routing.In this network configuration, can realize that by using WR the elasticity of communication range between mobile terminal device and AP extends.Terminal equipment then has both main frame and two kinds of roles of router.On the one hand, terminal equipment is as the relevant application program of main frame operation; On the other hand, terminal equipment need move relevant Routing Protocol as router, participates in common routing operations such as route discovery, route maintenance.

In wireless Mesh netword, any wireless device node all can be simultaneously as router, and each node in the network can both send and received signal, and each node can both carry out direct communication with one or more peer node.The largest benefit of this structure is: congested if nearest AP causes owing to flow is excessive, data can re-route a less adjacent node of communication flows automatically and transmit.The rest may be inferred, and packet can also continue to be routed to nearest with it next node and transmit according to the situation of network, till arriving the final destination.Such access mode is the multi-hop visit.

In carrying out the invention process, the inventor finds that there is following problem at least in above-mentioned prior art wireless mesh network:

Routing Protocol at the cable network design is not useable for mobile ad-hoc network, and subject matter is the unreliability of Radio Link:

1) existing wireless Mesh netword route setting causes producing very big delay.

In the existing wireless Mesh netword, the shortest passage of chosen distance is not the most important characteristics of these mobile wireless agreements usually.Such as quick route assemblage, high respond, link reliability, avoid congested, load balance, limit processing, battery performance and the through-put power (self-interference) etc. that each node must carry out and be only the prior characteristic of radio mobile self-organizing network.

Delay when delay when finding the route that is connected to the opposite end at first and current route find another alternative route when breaking down, it is extremely important that route is provided with time delay, and the handover in it and the cellular network is similar.Extremely important to the throughput that improves custom system to greatest extent than low path by cost.Network scalability can be subjected to the influence of route cost, because in case reach the route cost limit value of permission, and extended network more just.In addition, mobility is supported in the context switching of carrying out handover in the wireless self-organization network and must carrying out at wired bridge.But when terminal equipment when a network moves to the another one network, route setting according to the prior art wireless mesh network, network that terminal equipment need carry out switches and context switching meeting produces very big delay in communication, even makes communication disruption.

2) monitoring of existing wireless Mesh netword agency is provided with and causes consuming a large amount of Internet resources.

Because the unreliability of Mesh wireless network need be provided with the fault detect that the monitoring agency helps through network in network.

In the Mesh wireless network, the network failure that causes took place often because node motion or physical link lose efficacy.Therefore in network management, always wish that the fault management center can receive the report all about network failure, so that analyze and maintaining network.After yet fault took place, the loss that how to reduce Trouble Report was the difficult point in the network failure management always.

In communication network, for avoid the generation of above situation as far as possible, the monitoring agency is set in network usually is used for the monitoring network fault, and after monitoring the fault generation, in time Trouble Report is sent to the fault management center, so that response is accurately and timely made by administrative center.For the Mesh wireless network, under perfect condition, each node is the most reliable way to manage as the monitoring agent node of network all.But along with the increase of network size, such method of salary distribution will consume a large amount of Internet resources.

Summary of the invention

The technical problem that the present invention mainly solves provides a kind of implementation method and node of network in wireless mesh network, can improve network performance effectively, reduces resource consumption simultaneously.

For solving the problems of the technologies described above, the technical scheme that the present invention adopts is: a kind of implementation method of network in wireless mesh network is provided, comprises step: need in the network to obtain the node and the routing information of monitoring; According to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, selects the bigger node set of the resident weights of node in the candidate collection described agency, acts on behalf of as monitoring; Adopt the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network; Wherein, the expection transmission time SMETT of calculating path and form route result of calculation in described route transmission process, and control the grouping route or transmit operation according to described result, described SMETT is the summation of the excitation expection transmission METT of all single-hops on the path, with following formulate:

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i$

Wherein, described METT is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}$

Wherein, S is the size of grouping, and D _kBe that link k sends data rate, ETX _kThe number of transmissions of expression link k expection, TIF _kBe the transmission infectant, be defined as respectively:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}$

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})$

Wherein, S (k)=p (k-1) * (1-p), p=1-(1-p _f) * (1-p _r), S (K) the expression grouping probability that success sends after k trial from x to y, p represents the unsuccessful probability of the transmitted in packets from x to y, p _fAnd p _rPacket loss probability on expression forward direction and the reverse link.

Wherein, after the step of route transmission, comprising in the described monitoring wireless mesh network network: send described network failure report to the fault management center when breaking down monitoring described route transmission.

Wherein, act on behalf of in the step of selecting the bigger node set of the resident weights of node in the candidate collection described, the resident weights of described node are: network insertion control centre distributes to the resident weights of node according to the node situation when node enters described network, and its computing formula is as follows:

Ti＝Wi(r，l，t)

And wi (r, l, t) ∈ [0,1]

In the formula, r is role's parameter that node is born in network, and l is the location parameter of node in network, and t is the residence time parameter that node and network insertion control centre are consulted.

Wherein, describedly send in the step of described network failure report to the fault management center when breaking down monitoring described route transmission, the network failure that monitors comprises: the network failure that node motion or physical link lost efficacy and cause.

Wherein, need the step of the routing information of monitoring to comprise in the described acquisition network: to obtain with route in the network and reflect the relational matrix that links between node and node as association; Delete all column element values in the described relational matrix and be 0 path, needing to obtain the routing information of monitoring.

For solving the problems of the technologies described above, another technical solution used in the present invention is: a kind of network in wireless mesh network node is provided, comprises: the node path acquiring unit is used for obtaining network and needs the node and the routing information of monitoring; Selected cell is acted on behalf of in monitoring, be used for according to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, selects the bigger node set of the resident weights of node in the candidate collection described agency, acts on behalf of as monitoring; The network node monitoring means adopts the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network; Routing unit, be used for calculating the expection transmission time SMETT in described route transmission process path and forming route result of calculation, and the described result of foundation controls the grouping route or transmits operation, described SMETT is the summation of the excitation expection transmission METT of all single-hops on the path, with following formulate:

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i$

Wherein, described METT is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}$

Wherein, S is the size of grouping, and D _kBe that link k sends data rate, ETX _kThe number of transmissions of expression link k expection, TIF _kBe the transmission infectant, be defined as respectively:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}$

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})$

Wherein, S (k)=p (k-1) * (1-p), p=1-(1-p _f) * (1-p _r), S (K) the expression grouping probability that success sends after k trial from x to y, p represents the unsuccessful probability of the transmitted in packets from x to y, p _fAnd p _rPacket loss probability on expression forward direction and the reverse link.

Wherein, comprising: resident weights acquiring unit is used to obtain when node enters described network network insertion control centre and distributes to the resident weights of node according to the node situation, and adopts computing formula as follows:

Ti＝Wi(r，l，t)

And wi (r, l, t) ∈ [0,1]

In the formula, r is role's parameter that node is born in network, and l is the location parameter of node in network, and t is the residence time parameter that node and network insertion control centre are consulted.

Wherein, comprise: the 802.11Wi-Fi radio frequency component of two cover standards and two cover mesh network architecture MEA mobile broadband radio frequency components, wherein a cover Wi-Fi and MEA radio frequency component are operated in 2.4GHz and exempt from licensed band, and another set of operating frequency is a 5.8GHz public safety licensed band; The frequency range that described 2.4GHz frequency range is used is 2400MHz～2483.5MHz, and being divided into is 4 channels, comprises a Mesh channel, 1 802.11g channel, and 4 channel widths are 20MHz; The employed frequency range of described 5.8GHz frequency range is 5725～5850MHz, and being divided into is 148 channels, and first channel is the Mesh channel, channel width is 20MHz, be control and this channel of data sharing, second begins the channel for 802.11a, and channel width is 10MHz.

Wherein, described network in wireless mesh network node is a terminal.

Wherein, comprise failure report sending, be used for sending described network failure report to the fault management center when breaking down monitoring described route transmission.

The invention has the beneficial effects as follows: be different from prior art with each node all as the monitoring agent node of network and the situation that consumes a large amount of Internet resources, the present invention has provided the Mesh wireless network monitoring agent allocation program, method based on the resident weights of node, this method can search out the minimum monitoring that covers crucial link path effectively and act on behalf of candidate collection, and select the optimum monitoring agent node of stability in the network according to the resident weights of node, has less time complexity, analysis result shows, the present invention can seek for the Mesh wireless network effectively and distribute the monitoring agency, improves network monitor efficient; The present invention adopts new route criterion, compares with single-hop counting criterion and WCETT criterion, and average throughput improves more than 20% than single-hop counting criterion, improves more than 10% than WCETT, and whole losing probability also reduces.

Description of drawings

Fig. 1 is the network architecture schematic diagram of prior art Mesh wireless network;

Fig. 2 is the implementation method embodiment flow chart of network in wireless mesh network of the present invention;

Fig. 3 is the theory diagram of network in wireless mesh network node embodiment one of the present invention;

Fig. 4 is the theory diagram of network in wireless mesh network node embodiment two of the present invention;

Fig. 5 is the theory diagram of network in wireless mesh network node embodiment three of the present invention;

Fig. 6 is the theory diagram of network in wireless mesh network node embodiment four of the present invention.

Embodiment

Research emphasis of the present invention is how reasonably to distribute the network monitor agent list of a minimum.The present invention is directed to the characteristic that the Mesh wireless network architecture changes often, proposed the network monitoring method of a kind of utilization based on the monitoring agent allocation program, method of resident weights, the present invention has following characteristics:

1) introduces the resident faith mechanism of node, avoid the expense that produces owing to the frequent replacement of agent node;

2) functional, its time complexity can not be exponential increase along with the expansion of network size;

3) adopt new route criterion, avoid the computing network bandwidth, and consider it to be the interference of bottleneck of whole transmission, so it is more suitable for the real world.

The present invention introduces the notion of the resident weights of node, the monitoring agent node set that meets the demands is optimized, to distribute the most rational network monitor agency.

Consult Fig. 2, the implementation method embodiment of network in wireless mesh network of the present invention mainly may further comprise the steps:

Step 101: to need in the network to obtain the node and the routing information of monitoring;

Step 102: according to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, select the bigger node set of the resident weights of node in the candidate collection described agency, as the monitoring agency;

Step 103: adopt the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network;

Wherein, the expection transmission time SMETT of calculating path and form route result of calculation in described route transmission process, and control the grouping route or transmit operation according to described result, described SMETT is the summation of the excitation expection transmission METT of all single-hops on the path, with following formulate:

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i$

Wherein, described METT is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}$

Wherein, S is the size of grouping, and D _kBe that link k sends data rate, ETX _kThe number of transmissions of expression link k expection, TIF _kBe the transmission infectant, be defined as respectively:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}$

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})$

Wherein, S (k)=p (k-1) * (1-p), p=1-(1-p _f) * (1-p _r), S (K) the expression grouping probability that success sends after k trial from x to y, p represents the unsuccessful probability of the transmitted in packets from x to y, p _fAnd p _rPacket loss probability on expression forward direction and the reverse link.

Be different from prior art with each node all as the monitoring agent node of network and the situation that consumes a large amount of Internet resources, the present invention has provided the Mesh wireless network monitoring agent allocation program, method based on the resident weights of node, this method can search out the minimum monitoring that covers crucial link path effectively and act on behalf of candidate collection, and select the optimum monitoring agent node of stability in the network according to the resident weights of node, have less time complexity, do not need each node in the network all as the monitoring agency.

Show that by analysis the present invention can seek for the Mesh wireless network effectively and distribute the monitoring agency, improves network monitor efficient, reduces resource consumption.

The present invention adopts new route criterion, compares with single-hop counting criterion and WCETT criterion, and average throughput improves more than 20% than single-hop counting criterion, improves more than 10% than WCETT, and whole losing probability also reduces.

In described monitoring wireless mesh network network, after the step of route transmission, can also comprise:

Step 104: send described network failure report to the fault management center when breaking down monitoring described route transmission.

In other embodiment of the invention, link covers maximum, the minimum monitoring of node and acts on behalf of in the step of candidate collection in the described acquisition network, the number of nodes that candidate collection is acted on behalf of in the monitoring of described acquisition account for node sum in the network 1/3rd in.

Describedly send in the step of described network failure report to the fault management center when breaking down monitoring described route transmission, the network failure that monitors can be: the network failure that node motion or physical link lost efficacy and cause.

Below describe step 101 in detail for an embodiment:

1, Mesh wireless network monitoring agent allocation

1.1 condition and constraint

List of references " TH Wu.Fiber Network Service Survivability Reading[M] .MA:Ar-tech House; 1992 " method used among the SONET, when a settled approximately fault takes place, may cause by certain node in the network or certain bar link fails, Trouble Report will be sent to upstream node and the descendant node by the network route of fault nidus, and is transmitted by these nodes.Describe for convenient, make the following assumptions:

1. network topology structure be designated as G (N, L);

2. have four routes in the network, they are respectively

α：a\b\c\e，

β：a\b\d\g，

γ: d c e h and

δ：c\e\g\f。

1.2 monitoring agent allocation

1.2.1 mapping matrix

(1) matrix M NRn * r describes the relation between routed path and the node, and n is the node number in the network, and r is the number of routes that exists in the network.If route j is through node i, then corresponding MNRn * r[i, j] value be 1, otherwise be 0.For example, MNRn * r[α, β] value be 1, representing route β through node alpha.

(2) matrix M RLr * l describes the relation that links between routed path and node, and r is the number of routes that exists in the network, and l is internodal link number.If route i is through path j, then corresponding MRLr * l[i, j] value be 1, otherwise be 0.For example, MRLr * l[β, 6] value be 1, representing route through link 6.

$\begin{array}{cc}\mathrm{\α\β\γ\δ}& \\ a& 1100\\ b& 1011\\ c& 1100\\ d& 0110\end{array}$

$M^{\mathrm{NR}}n\×r=\begin{array}{cc}e& 1011\\ f& 0001\\ g& 0101\\ h& 0010\end{array}$

$M^{\mathrm{RL}}r\×l^{=}=\begin{array}{cc}& 123456789101112\\ \mathrm{\α}& 101001000000\\ \mathrm{\β}& 100100010000\\ \mathrm{\γ}& 000011000100\\ \mathrm{\δ}& 000001001010\end{array}$

Matrix M NRn * r and matrix M RLr * l are multiplied each other, can obtain the relational matrix CNLn * l that links between the node that reflects as association by route in the network and node.

$C^{\mathrm{NL}}n\×l^{=}{M}^{\mathrm{NR}}n\×r^{\×}{M}^{\mathrm{RL}}r\×l^{=}\begin{array}{ccccccccccccc}a& 2& 0& 1& 1& 0& 1& 0& 1& 0& 0& 0& \\ b& 2& 0& 1& 1& 0& 1& 0& 1& 0& 0& 0& 0\\ c& 1& 0& 1& 0& 1& 3& 0& 0& 1& 1& 1& 0\\ d& 1& 0& 0& 1& 1& 1& 0& 1& 0& 1& 0& 0\\ e& 1& 1& 0& 1& 0& 1& 3& 0& 0& 1& 1& \\ f& 0& 0& 0& 0& 0& 1& 0& 0& 1& 0& 1& 0\\ g& 1& 0& 0& 1& 0& 1& 0& 1& 1& 0& 1& 0\\ h& 0& 0& 0& 0& 1& 0& 0& 0& 1& 0& 0& \end{array}$

1.2.2 agent allocation table

Construct the assignment agent table according to following rule:

(1) all column element values are 0 path among deletion Matrix C NLn * l, do not have route to pass through this path because all column elements are 0 explanation, thereby even this path is unusual, also can not influence the normal of network, so do not need to monitor; (2) Dui Ying CNLn * l[i, j] 〉=1, correspondence table T[i, j] value be X.For example:

CNLn * l[b, 1]=2 〉=1, so correspondence table T[b, 1]=X.

Below describe step 102 in detail for an embodiment:

According to node shown in the table T and the incidence relation between the path, the monitoring that can obtain the minimum node of maximum link covering is acted on behalf of candidate collection S={{a, c}, { b, c}, { d, c}, { a, e}, { b, e}, { d, e}, { c, g}, { e, g}}.

Because Mesh wireless network node residence time in network is uncertain, therefore residence time is the longest relatively in this network range need to find node as the agency, seeks the required expense of agent node again so that reduce owing to what the agent node deviated from network caused.Therefore, the present invention introduces resident factor Ti, Ti ∈ [0,1].Resident factor Ti is when node enters network, is distributed to the resident weights of node according to the node situation by network insertion control centre.The method that the calculating of these weights can list of references " A Abdul-Rahman, S Hailes.A Distributed TrustModel[C] .Proc.of New Security Paradigms Workshop, 1997.48-60 " mentions, computing formula is as follows:

Ti=Wi (r, l, t) (1) and wi (r, l, t) ∈ [0,1].In the formula, (t) determined by three parameters: r is role's parameter that node is born in network to wi for r, l; L is the location parameter of node in network; T is the residence time parameter that node and access control center are consulted.

Suppose that calculating the resident weights of resulting node by formula is respectively: Ta=0.9, Tb=0.5, Tc=0.8, Td=0.7, Te=0.6, Tf=0.8, Tg=0.3 and Th=0.7.According to acting on behalf of taking all factors into consideration of candidate collection and the resident weights of node, choose that { a, c} also promptly choose node a and node c as the monitoring of network agency, and this monitoring agent list have best stability as the monitoring agent list.

Can realize finding good stability, monitoring agency that cost is low for proof adopts method of the present invention, existing supposition exist network G (N, L, R), wherein N be node in the network to count L be number of links, R is a number of routes.Suppose that multiplication required time of computing is α, and computing one sub-addition required time is β, then according to the present invention, for network G (N, L, R) in monitoring agency's candidate collection seek and need the time spent altogether:

T＝N×[L×[R×\u945X+(R-1)×\u946X]]

By following formula as can be known, the time complexity o≤o (n3) that utilizes the present invention to handle, n=max (N, L, R).Therefore, the present invention can realize the monitoring of network in wireless mesh network simply, effectively.

In addition, the implementation method of wireless mesh network of the present invention can also adopt the Routing Protocol based on many network interface cards multichannel MESH net.The Wireless MESH net is different from traditional wireless multi-hop network, and router is fixed, and mobility is not a subject matter.Therefore pressing for a kind of new criterion adapts to this network.WMN uses many network interface cards and multichannel to improve network capacity.WCETT is the criterion for many network interface cards multi-channel wireless MESH network design, but essential bandwidth calculation is very complicated.The present invention proposes a kind of new route criterion SMETT for this reason, and avoiding complicated bandwidth calculation, and the transmission interference model that designs a kind of transmission infectant by name (TIF) makes the more approaching real transmission of ETT.The radio node that for this reason comprises two network interface cards in wireless mesh network system of the present invention is set up routing unit, be used for the expection transmission time SMETT of calculating path and form route result of calculation, and control the grouping route in described two wireless network cards or transmit operation according to described result.

Wireless MESH network (WMN) has become the focus of research in recent years.Because its some special application have caused commercial attention and huge interest.Though WMN is by Ad Hoc network development, it is a kind of brand-new topology, and the route of Ad Hoc no longer has been applicable to WMN.The traditional Ad Hoc route criterion of the overwhelming majority is the minimum hop count of selecting from the source node to the destination node.If WMN also uses the minimum hop count criterion, then in route, comprise long Radio Link easily, cause lower throughput, reach optimum performance thereby influence it.Therefore the route criterion can be selected path preferably according to the quality of Radio Link.The key of MESH routing issue just is to improve network capacity and improves on indivedual transmission performances.Can be by the method that a plurality of network interface cards improve the WMN capacity be installed on each node.Can make node can side by side transmit and receive data like this.Each node has two or more network interface cards simultaneously, also can provide one to realize multi channel strategy.

New route criterion provided by the invention is called SMETT (Sum of Motivated ExpectedTransmission Time), for many network interface cards multichannel environment designs.Different with WCETT is the bandwidth that it does not consider Radio Link.Because the bandwidth of Wi-Fi is not easy to calculate, this calculating of how avoiding bandwidth is a main subject under discussion.And under study for action,, also consider the interference of link when calculating ETT in the time of (transmission time of expection).In Wi-Fi, if they in interference range each other, the transmission on the Radio Link may interfere with each other.Therefore, further provide a kind of transmission infectant (TIF) to be used for our criterion SMETT.

In Wireless MESH network (WMN) architecture, each node has a plurality of network interface cards and many channels.Here how not consider channel distribution.Each routing node of supposing architecture all is relatively-stationary, and each point in the given area is covered by an AP at least.In order to cover a big zone, need a lot of AP.Generally, each AP is connected on the Ethernet, it is unpractical being connected to Internet more successively.Therefore have only some AP to repeatedly kick into wired infrastructure, as gateway work.Mobile phone users is directly from AP or from multi-hop AP access internet.

In cable network, because each node is independently, so any transmission on the link can not disturbed the transmission on other links.Yet, in wireless mesh network system of the present invention, if they in interference range each other, the transmission on Radio Link just might be disturbed other link.

Here adopt IEEE 802.11DCF subprogram, it utilizes a simple Carrier Sense Multiple Access (CSMA) algorithm.When a grouping was wanted to transmit, it took medium by the transmission grouping.If listen to medium is idle, and grouping will be transmitted so.Otherwise, optionally in current collision window size keep out of the way calculator work, and allow and keep out of the way calculator and begin countdown, up to the medium free time.When its perception medium is busy, the countdown window of node termination of computations device.This is called binary exponential backoff.

When comprising grouping of radio node transmission of two network interface cards in the wireless mesh network system of the present invention, it need exist in the buffer for the grouping that possible re-transmission will send.When grouping is identified when receiving, the grouping in the buffer just is removed.If any bust this is arranged, buffer can be for retransmitting the grouping that protection is lost.Will not increase when therefore buffer is empty.If because a grouping still exists in the buffer, the node medium of can trying to take, this can influence the transmission of the node in its interference range.

For this reason, the present invention further proposes to expect the transmission time and (ETT) before, describes the ETX criterion at first tout court.The ETX measurement criterion is used to measure the anticipated number of transmission, comprises re-transmission (need send a unicast packet on link).The derivation of ETX starts from the measurement of the packet loss probability of forward direction and reverse link, represents with pf and pr respectively, calculates expection transmission quantity then.

From calculating the unsuccessful probability of transmitted in packets, because 802.11 agreements needs is transmission success, so grouping must successfully be replied.Allow p represent the unsuccessful probability of transmitted in packets from x to y:

p＝1-(1-p _f)×(1-p _r) (1)

802.11MAC will retransmit the grouping of a unsuccessful transmission.Allow S (K) represent the grouping probability that success sends after k trial from x to y.

S(k)＝p(k-1)*(1-p)· (2)

At last, the essential expection transmission quantity that successfully transmits a grouping from x to y is represented with ETX:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}---\left(3\right)$

The ETX criterion is used for Route Selection.It will select the path of minimum accumulation ETX.But the ETX criterion differs and selects the path of high throughput surely for WMN.For example, it may select the 802.11b link, but does not select the lower 802.11a link of loss probability.Therefore, the present invention provides preferential a selection of the bad channel opposite sex, and a kind of new criterion is provided, and is called the expection transmission time (ETT).It is defined as " bandwidth correction ETX ".Allow S represent the size (for example 1024 bytes) of dividing into groups, B represents the bandwidth (original data rate) of link.ETT is expressed as so:

ETT＝ETX*S/B (4)

Calculate ETT according to equation (3) and (4), need know forward and the reverse bandwidth of loss late (pf and pr) and each link.There are two kinds of methods can obtain the bandwidth of each link.A kind of method is the fixed-bandwidth of each 802.11 network interface card set-point, but fixed rate can not be fit to actual transmissions.Another method is to allow network interface card automatically select bandwidth for each grouping, and this also is unpractical.

In front, set forth 802.11DCF and how to have worked, the buffer that radio node is described can influence the transmission on the link.If buffer is empty, as long as it is accepted, node can send grouping.It does not influence other transmission so.Yet,, just can not transmit the grouping of just having received if the radio node buffer is not empty for a long time.Therefore the not empty time of node buffer can influence on the link other transmission.

TIF not only explains initial traffic load on the link, and explains the load that increases because of the lost packets re-transmission.For example, the transmission time is 2 times of equation (4) ETT, if the loss late of link is 0, i.e. and ETX=1, TIF=0.5 so, because the buffer half the time of node is not empty, the transmission of node is had much to do.Yet if the loss late of link is 0.5, buffer can not be empty owing to retransmitting, so, and TIF=1.

Because ETT represents the loss probability of link, so TIF is relevant with it.Hypothesis link K-1 and link K are continuous links now, and their ETT is respectively ETX _K-1And ETX _KWork as ETX _K/ ETX _K-1Less than 1.0 o'clock, link K can have more free time, TIF so than link K-1 _KCan be expressed as TIF _K-1* ETX _K/ ETX _K-1When greater than 1.0 the time, mean that node K buffer is full of, some groupings may be dropped.Therefore, TIF _KCan be expressed as:

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})---\left(5\right)$

Here, the further excitation expection transmission time METT that proposes, METT has considered the transmission interference.It is a kind of " disturbing the ETT that adjusts ".At first, the source node of supposing the path is to be in noiseless perfect condition.Therefore, at first setting the TIF initial value is TIF1=1.Then, allow ETX _kThe number of transmissions of expression link k expection, S is the size (for example 1024 bytes) of grouping, and D _kBe that link k sends data rate.Therefore, the interference of link adjustment k is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}---\left(6\right)$

Because disturb, if buffer is not empty, all groupings will be competed and take medium.As TIF definition, if the real transmission time is 2 times of equation (4), TIF=0.5 so.Therefore TIF and METT are inverse ratios, and initial ETT is defined as (4), the necessary separately TIF of the excitation ETT (METT) of link _kBecause TIF can represent real transmission, be unnecessary so use B (bandwidth of link), therefore here change into and use D _k(transmission rate of link).

Calculate METT according to equation (3), (5) and (6), also need to understand forward and reverse loss probability (p _fAnd p _r), the transmission infectant (TIF) of transfer rate, each link.p _fAnd p _rValue can be by estimating with the broadcast packe technology, radio node (per second is once) is termly sent the broadcast probe grouping.Broadcast packe be can't help 802.11MAC and is transmitted.Radio node is followed the tracks of from each adjacent node detection packet count that receive (ten seconds) during sliding time window, comprises their detection information.Radio node can directly calculate p from the detection packet count that adjacent node is received in time window _r, can also use last that receive from adjacent node to survey relevant their information of grouping and calculate p _fCalculate ETX then.Equally, also can use equation (5) to calculate TIF.

By calculating, can obtain the METT of all links.Propose how to calculate METT all on source node below.The path criterion that the present invention proposes is called SMETT (summation of excitation ETT).It is the expection transmission time in path.Therefore can set the summation that SMETT is the METT of all single-hops on the path.

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i---\left(7\right)$

Simultaneously, SMETT need consider the influence of the bad channel opposite sex.Just increase METT and can not guarantee this characteristic, because can not distinguish the single-hop on different channels.In order to reflect this point, the path criterion definition addition Item X that the present invention proposes _i

X _jBe the transmission time summation that channel j goes up single-hop, total throughout is arranged by the bottleneck channel, and the bottleneck channel has maximum X _jIn addition, can introduce an adjustable parameter β and be used for calculating SMETT.

$\mathrm{SMETT}=(1-\mathrm{\β})*\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i+\mathrm{\β}*\underset{1\≤j\≤k}{\mathrm{Max}}\left(X_j\right)---\left(9\right)$

Above-mentioned new route criterion can be avoided the computing network bandwidth, and considers the interference of whole transmission bottleneck, so it is more suitable for the real world.

In the routing simulation that the inventor carries out, show that this new route criterion work gets fine: compare with single-hop counting criterion and WCETT criterion, average throughput improves more than 20% than single-hop counting criterion, improves more than 10% than WCETT, and whole losing probability also reduces.

Consult Fig. 3, the present invention also provides a kind of network in wireless mesh network node embodiment, comprising:

The node path acquiring unit is used for obtaining network and needs the node and the routing information of monitoring;

Selected cell is acted on behalf of in monitoring, be used for according to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, selects the bigger node set of the resident weights of node in the candidate collection described agency, acts on behalf of as monitoring;

The network node monitoring means adopts the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network;

Routing unit, be used for calculating the expection transmission time SMETT in described route transmission process path and forming route result of calculation, and the described result of foundation controls the grouping route or transmits operation, described SMETT is the summation of the excitation expection transmission METT of all single-hops on the path, with following formulate:

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i$

Wherein, described METT is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}$

Wherein, S is the size of grouping, and D _kBe that link k sends data rate, ETX _kThe number of transmissions of expression link k expection, TIF _kBe the transmission infectant, be defined as respectively:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}$

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})$

Wherein, S (k)=p (k-1) * (1-p), p=1-(1-p _f) * (1-p _r), S (K) the expression grouping probability that success sends after k trial from x to y, p represents the unsuccessful probability of the transmitted in packets from x to y, p _fAnd p _rPacket loss probability on expression forward direction and the reverse link.

Consult Fig. 4, in other embodiments, can also comprise:

Failure report sending is used for sending described network failure report to the fault management center when breaking down monitoring described route transmission.

Resident weights acquiring unit is used to obtain when node enters described network network insertion control centre and distributes to the resident weights of node according to the node situation, and adopts computing formula as follows:

Ti＝Wi(r，l，t)

And wi (r, l, t) ∈ [0,1]

In the formula, r is role's parameter that node is born in network, and l is the location parameter of node in network, and t is the residence time parameter that node and network insertion control centre are consulted.

Consult Fig. 5, in other embodiments, can also comprise:

The 802.11Wi-Fi radio frequency component of two cover standards and two cover mesh network architecture MEA mobile broadband radio frequency components, wherein a cover Wi-Fi and MEA radio frequency component are operated in 2.4GHz and exempt from licensed band, and another set of operating frequency is a 5.8GHz public safety licensed band;

The frequency range that described 2.4GHz frequency range is used is 2400MHz～2483.5MHz, and being divided into is 4 channels, comprises a Mesh channel, 1 802.11g channel, and 4 channel widths are 20MHz;

The employed frequency range of described 5.8GHz frequency range is 5725～5850MHz, and being divided into is 148 channels, and first channel is the Mesh channel, channel width is 20MHz, be control and this channel of data sharing, second begins the channel for 802.11a, and channel width is 10MHz.

Above-mentioned Mesh framework adopts many cover radio frequency components and a plurality of frequency range, so can provide private radio broadband inserting service independent of each other for public safety, municipal works and public access.Wherein the dual independent simultaneous interpretation of IAP connects the physical separation that realizes public network and other irrelevant return networks again, improves the fail safe of public safety user's communications.

Consult Fig. 6, in some embodiments of the invention, described network in wireless mesh network node is a terminal.The routing unit of terminal is by the wireless wifi network interface card of external two or more Min-PCI of DCR bus, and coverage is big.In addition, the present invention is particularly suitable for being applied in the wireless-communication-capable area that terminal equipment frequently is displaced into fixed line, in railway, highway, river transport system.

The above only is embodiments of the invention; be not so limit claim of the present invention; every equivalent structure or equivalent flow process conversion that utilizes specification of the present invention and accompanying drawing content to be done; or directly or indirectly be used in other relevant technical fields, all in like manner be included in the scope of patent protection of the present invention.

Claims (10)

1. the implementation method of a network in wireless mesh network is characterized in that:

To need in the network to obtain the node and the routing information of monitoring;

According to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, selects the bigger node set of the resident weights of node in the candidate collection described agency, acts on behalf of as monitoring;

Adopt the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network;

Wherein, the expection transmission time SMETT of calculating path and form route result of calculation in described route transmission process, and control the grouping route or transmit operation according to described result, described SMETT is the summation of the excitation expection transmission METT of all single-hops on the path, with following formulate:

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i$

Wherein, described METT is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}$

Wherein, S is the size of grouping, and D _kBe that link k sends data rate, ETX _kThe number of transmissions of expression link k expection, TIF _kBe the transmission infectant, be defined as respectively:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}$

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})$

Wherein, S (k)=p (k-1) * (1-p), p=1-(1-p _f) * (1-p _r), S (K) the expression grouping probability that success sends after k trial from x to y, p represents the unsuccessful probability of the transmitted in packets from x to y, p _fAnd p _rPacket loss probability on expression forward direction and the reverse link.

2. the implementation method of network in wireless mesh network according to claim 1 is characterized in that, after the step of route transmission, comprising in the described monitoring wireless mesh network network:

Send described network failure report to the fault management center when breaking down monitoring described route transmission.

3. the implementation method of network in wireless mesh network according to claim 2 is characterized in that, acts on behalf of in the step of selecting the bigger node set of the resident weights of node in the candidate collection described, and the resident weights of described node are:

Network insertion control centre distributes to the resident weights of node according to the node situation when node enters described network, and its computing formula is as follows:

Ti＝Wi(r，l，t)

And wi (r, l, t) ∈ [0,1]

In the formula, r is role's parameter that node is born in network, and l is the location parameter of node in network, and t is the residence time parameter that node and network insertion control centre are consulted.

4. according to the implementation method of each described network in wireless mesh network of claim 1 to 3, it is characterized in that, describedly send in the step of described network failure report to the fault management center when breaking down monitoring described route transmission, the network failure that monitors comprises:

The network failure that node motion or physical link lost efficacy and cause.

5. according to the implementation method of each described network in wireless mesh network of claim 1 to 3, it is characterized in that, need the step of the routing information of monitoring to comprise in the described acquisition network:

Obtain with route in the network and reflect the relational matrix that links between node and node as association;

Delete all column element values in the described relational matrix and be 0 path, needing to obtain the routing information of monitoring.

6. a network in wireless mesh network node is characterized in that, comprising:

The node path acquiring unit is used for obtaining network and needs the node and the routing information of monitoring;

Selected cell is acted on behalf of in monitoring, be used for according to the incidence relation between node described in the network and the path, link covers maximum in the acquisition network, candidate collection is acted on behalf of in the minimum monitoring of node, selects the bigger node set of the resident weights of node in the candidate collection described agency, acts on behalf of as monitoring;

The network node monitoring means adopts the monitoring of described selection to act on behalf of the route transmission of monitoring in the described network in wireless mesh network;

Routing unit, be used for calculating the expection transmission time SMETT in described route transmission process path and forming route result of calculation, and the described result of foundation controls the grouping route or transmits operation, described SMETT is the summation of the excitation expection transmission METT of all single-hops on the path, with following formulate:

$\mathrm{SMETT}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{METT}}_i$

Wherein, described METT is defined as:

${\mathrm{METT}}_k=\left(\frac{{\mathrm{ETX}}_k*S}{D_k}\right)/{\mathrm{TIF}}_k=\frac{{\mathrm{ETX}}_k*S}{D_k*{\mathrm{TIF}}_k}$

Wherein, S is the size of grouping, and D _kBe that link k sends data rate, ETX _kThe number of transmissions of expression link k expection, TIF _kBe the transmission infectant, be defined as respectively:

$\mathrm{ETX}=\underset{k=1}{\overset{\∞}{\mathrm{\Σ}}}k*S\left(k\right)=\frac{1}{1-p}$

${\mathrm{TIF}}_k=\mathrm{Min}(1,{\mathrm{TIF}}_{k-1}*\frac{{\mathrm{ETX}}_k}{{\mathrm{ETX}}_{k-1}})$

Wherein, S (k)=p (k-1) * (1-p), p=1-(1-p _f) * (1-p _r), S (K) the expression grouping probability that success sends after k trial from x to y, p represents the unsuccessful probability of the transmitted in packets from x to y, p _fAnd p _rPacket loss probability on expression forward direction and the reverse link.

7. network in wireless mesh network node according to claim 6 is characterized in that, comprising:

Resident weights acquiring unit is used to obtain when node enters described network network insertion control centre and distributes to the resident weights of node according to the node situation, and adopts computing formula as follows:

Ti＝Wi(r，l，t)

And wi (r, l, t) ∈ [0,1]

In the formula, r is role's parameter that node is born in network, and l is the location parameter of node in network, and t is the residence time parameter that node and network insertion control centre are consulted.

8. network in wireless mesh network node according to claim 6 is characterized in that, comprising:

The 802.11Wi-Fi radio frequency component of two cover standards and two cover mesh network architecture MEA mobile broadband radio frequency components, wherein a cover Wi-Fi and MEA radio frequency component are operated in 2.4GHz and exempt from licensed band, and another set of operating frequency is a 5.8GHz public safety licensed band;

The frequency range that described 2.4GHz frequency range is used is 2400MHz～2483.5MHz, and being divided into is 4 channels, comprises a Mesh channel, 1 802.11g channel, and 4 channel widths are 20MHz;

The employed frequency range of described 5.8GHz frequency range is 5725～5850MHz, and being divided into is 148 channels, and first channel is the Mesh channel, channel width is 20MHz, be control and this channel of data sharing, second begins the channel for 802.11a, and channel width is 10MHz.

9. network in wireless mesh network node according to claim 6 is characterized in that, described network in wireless mesh network node is a terminal.

10. network in wireless mesh network node according to claim 6 is characterized in that, comprises failure report sending, is used for sending described network failure report to the fault management center when breaking down monitoring described route transmission.

Images