CN101854697A - Multi-constraint quality-of-service control routing method and system for wireless mesh network - Google Patents

Abstract

The invention discloses a multi-constraint quality-of-service control routing method for a wireless mesh network. The method comprises that: an initial node sends routing request message to a destination node through an intermediate node, and establishes a reverse route during broadcasting the routing request message; aiming at the received routing request message transmitted by each routing path, the destination node returns link quality information of each routing path to the initial node through the reverse route; and the initial node calculates a routing path with lowest dissatisfaction as an optimal route, and transmits data by using the optimal route. The invention also discloses a multi-constraint quality-of-service control routing system for the wireless mesh network. The method and the system can realize multi-dimensional QoS routing, and can repair the routing path with higher time delay during routing maintenance.

Description

Multi-constraint quality-of-service control routing method and system in a kind of based on wireless mesh network

Technical field

The present invention relates to the method for routing in the cordless communication network, be meant multi-constraint quality-of-service control (QoS) method for routing and system in a kind of based on wireless mesh network especially.

Background technology

Based on wireless mesh network (wireless Mesh netword) is made up of static or semi-static radio node, these static nodes interconnect by Radio Link in (Ad-hoc) mode of self-organizing, wherein, have only limited several nodes to enter the Internet, these nodes are played the part of the role of gateway in wireless Mesh netword.Because Ad-hoc network and wireless Mesh netword have a lot of similar characteristics, the Routing Protocol of the many Ad-hoc of being used for networks also can be used for wireless Mesh netword.C.E.Perkins and E.M.Royer have proposed a kind of Ad-hoc of being applicable to network in 2000 wireless self-networking is plan range vector route (AODV) agreement as required.The AODV agreement only has data to send at source node, when still not leading to the routing iinformation of destination node, just goes to obtain route by the mode of active inquiry, and routing table is set up as required, and the grouping process of transmitting adopts the mode of forwarded hop-by-hop.Simultaneously, the AODV agreement only just can be implemented the route repair measure when the link fracture can't realize inter-node communication.This does not obviously satisfy the transmission demand of data flow, can increase transmission delay greatly.

Along with the wireless Mesh netword broad application, the user constantly increases the multimedia service demand in wireless network is used, and how to realize that multiple services service quality controls such as data, voice and image (QoS) are the important contents in the following radio communication research.The QoS route is the important ring in the QoS security system.

The QoS route is routing mechanism or a kind of dynamic routing protocol that comprises various qos parameters that the qos requirement of a kind of based on network available resources and Business Stream is selected the path.In brief, the QoS route is used for searching the path of satisfying qos requirement.Qos requirement can be the parameter of one dimension, also can be the parameter of multidimensional, and corresponding QoS route is called as one-dimensional or multidimensional QoS route.The constraints of weighing QoS is a lot, comprises time-delay, bandwidth, packet loss rate and network throughput etc.Seek the normally uncertain problems of multinomial complexity (np complete problem) of a routed path that satisfies a plurality of QoS constraintss, so the QoS index that realizes multidimensional difficulty comparatively.

Summary of the invention

In view of this, main purpose of the present invention is to provide multiple constraint QoS method for routing and system in a kind of based on wireless mesh network, can solve the relatively more difficult problem of QoS index that realizes multidimensional in route discovery.

For achieving the above object, technical scheme of the present invention is achieved in that

The invention provides multi-constraint quality-of-service control (QoS) method for routing in a kind of based on wireless mesh network, described method comprises:

The route request information that start node sends arrives destination node by intermediate node;

The route request information that destination node transmits at every the routed path that receives returns to start node by reverse route with the link quality information of every routed path;

Start node calculates the minimum routed path of dissatisfaction as optimum route, and utilizes optimum route transmission data.

Wherein, after the described transmission data, also comprise: destination node is monitored the actual time delay on the whole routed path, after time-delay surpasses threshold value, sends early warning information is initiated route requests to needs start node; Start node restarts to initiate route requests and seeks optimum route, and utilizes optimum route transmission data.

Wherein, described start node comprises: the source node or the bottleneck node that send data.

Wherein, described mode by intermediate node arrival destination node specifically is that intermediate node sends route request information to adjacent node by the mode of broadcasting, through the forwarding arrival destination node of one or more nodes.

Wherein, described intermediate node sends before the route request information by the mode of broadcasting, and also comprises: two internodal link quality information in the last process of transmitting are recorded in the route request information.

Wherein, the described minimum routed path of dissatisfaction that calculates comprises:

According to the link quality information of every routed path in conjunction with the QoS constrained parameters that are transmitted data be transmitted data the susceptibility of time-delay, bandwidth, packet loss is calculated the minimum routed path of dissatisfaction;

Wherein, link quality information comprises: per two internodal time-delays, bandwidth and packet loss in the whole routed path; The QoS constrained parameters that are transmitted data comprise: the maximum packet loss that the maximum delay that data flow allows, the minimum bandwidth requirement of data flow, data flow allow.

The present invention also provides multi-constraint quality-of-service control route system in a kind of based on wireless mesh network, and described system comprises: start node, intermediate node and destination node, wherein,

Described start node, be used to initiate route requests and arrive destination node by intermediate node, calculate the minimum routed path of dissatisfaction as optimum route after receiving the link quality information of every routed path that destination node returns, and utilize optimum route transmission data;

Described intermediate node is used to transmit route request information and gives destination node, and the link quality information of transmitting every routed path that destination node returns is given start node;

Described destination node is used for the route request information that transmits at every the routed path that receives, by reverse route the link quality information of every routed path is returned to start node.

Wherein, described destination node also is used to monitor the actual time delay on the whole routed path, after time-delay surpasses threshold value, sends early warning information is initiated route requests to needs start node; Start node restarts to initiate route requests and seeks optimum route, and utilizes optimum route to begin to transmit data.

Wherein, described start node comprises: the source node or the bottleneck node that send data.

Multiple constraint QoS method for routing and system in the based on wireless mesh network provided by the present invention, the route request information that is sent by start node arrives destination node by intermediate node, then, the route request information that destination node transmits at every the routed path that receives, by reverse route the link quality information of every routed path is returned to start node, at last, start node calculates the minimum routed path of dissatisfaction as optimum route, and utilizes optimum route transmission data.Can realize multidimensional QoS route like this, promptly search out a best routed path that satisfies a plurality of QoS constraintss.Compare with existing AODV agreement, can improve the average throughput and the packet arrival rate of network, and increased the shared ratio of packet that satisfies time delay condition in the QoS constrained parameters.

Description of drawings

Fig. 1 is a multiple constraint QoS method for routing schematic flow sheet in the embodiment of the invention based on wireless mesh network;

Fig. 2 is the process of transmitting schematic diagram of route requests in the embodiment of the invention based on wireless mesh network;

Fig. 3 is the process schematic diagram of return link quality information in the embodiment of the invention based on wireless mesh network;

Fig. 4 is a multiple constraint QoS route system structural representation in the embodiment of the invention based on wireless mesh network;

Fig. 5 be in the emulation experiment network average throughput with CBR data package transmission velocity variation diagram;

Fig. 6 satisfies D in the emulation experiment _qPacket account for the variation diagram of the ratio of the total data bag that receives with the CBR data package transmission velocity;

Fig. 7 be in the emulation experiment packet arrival rate in the network with the variation diagram of CBR data package transmission velocity.

Embodiment

The technical solution of the present invention is further elaborated below in conjunction with the drawings and specific embodiments.

Fig. 1 is a multiple constraint QoS method for routing schematic flow sheet in the embodiment of the invention based on wireless mesh network, and as shown in Figure 1, described multiple constraint QoS method for routing is applied to wireless Mesh netword usually, and based on the AODV agreement, described method specifically may further comprise the steps:

Step 101, start node is initiated route requests, and the route request information of transmission arrives destination node by intermediate node;

Concrete, described start node comprises: need to send when application layer has data, and source node is when leading to the route of destination node, source node is initiated route requests as described start node; Or in the data transmission procedure, bottleneck node also can be used as described start node and initiates route requests.The route request information of described transmission arrives destination node by intermediate node, specifically is meant: the broadcast transmission route request information is given adjacent node, through the forwarding arrival destination node of one or more intermediate nodes.Wherein, comprise in the route request information: the QoS constrained parameters of application layer transmission data, for example: time-delay, bandwidth, packet loss.Receive the link quality information that the intermediate node of route request information also can will go up once in the route request information process of transmitting simultaneously and be recorded in the route request information before forwarding, specifically comprise: two internodal time-delays, bandwidth and packet loss.

Further, intermediate node judges whether oneself had received this route request information, if then directly abandon described route request information, otherwise write down the link quality information in the last repeating process.After intermediate node receives route request information, also need to judge according to the QoS constrained parameters of data flow whether last forwarding meets the standard of constrained parameters, if meet, then writes down the link quality information in the last repeating process, and continue to transmit; If do not meet, then directly abandon described route request information.Described judgement is specially: whether contrast the last bandwidth of transmitting greater than the bandwidth requirement in the QoS constrained parameters, if greater than, then write down the link quality information in the last repeating process, and continue to transmit, otherwise, route request information directly abandoned.Make an explanation below in conjunction with the example of Fig. 2 process of transmitting to the route request:

Fig. 2 is the process of transmitting schematic diagram of route requests in the embodiment of the invention based on wireless mesh network, as shown in Figure 2, supposes that node 1 need search out the route of gateway node 5 as start node, and the arrow that sends from node among the figure is represented the RREQ message of this node broadcasting.Node 1 can be broadcasted the RREQ message earlier and be given its a hop neighbor node, after node 2 receives the RREQ message of node 1 broadcasting, can first comparison node 1 to the bandwidth between the node 2 whether greater than the bandwidth in the QoS constrained parameters of RREQ message, if less than would directly abandon this RREQ message; If greater than would note node 1 time-delay, bandwidth and packet loss to node 2 this section links, broadcast this RREQ message then.The RREQ message of node 2 broadcasting can be received by node 1 once more, and at this moment because this RREQ message has just sent to node 2 by node 1, so node 1 directly abandons this RREQ message.Node 3 and node 6 also can receive this RREQ message, they are to receive this RREQ message for the first time, processing method with node 2 is the same, compare this section link bandwidth and data flow demand bandwidth earlier, if satisfy time-delay, bandwidth and the packet loss of minute book section link again, and continue this RREQ message of broadcasting.Node 6 is through the broadcasting of node 7, and this RREQ message arrives destination node 5.Simultaneously, node 3 is through the broadcasting of node 4, and described RREQ message also arrives destination node 5.The pass-through mode of node 4 and node 7 is identical with node 2,3,6.At this moment, the process of route requests obtains two routed paths, is respectively: start node 1 arrives destination node 5 through intermediate node 2, intermediate node 3, intermediate node 4; Start node 1 is through intermediate node 2, intermediate node 6, intermediate node 7, arrival destination node 5.

Step 102, the route request information that destination node transmits at every the routed path that receives returns to start node by reverse route with the link quality information of every routed path;

Concrete, described reverse route be meant that intermediate node sets up in the process of broadcasting route requests message by the route of this node to the source node of transmission route requests.Fig. 3 is the process schematic diagram of return link quality information in the embodiment of the invention based on wireless mesh network, wherein, destination node 5 returns to start node 1 by two reverse routes with the link quality information of two routed paths respectively, is respectively: destination node 5 arrives start nodes 1 through intermediate nodes 4, intermediate node 3, intermediate node 2; Destination node 5 arrives start node 1 through intermediate node 7, intermediate node 6, intermediate node 2.

Step 103, the link quality information that start node returns according to every route calculate the minimum routed path of dissatisfaction as optimum route, and utilize optimum route to begin to transmit data.

Concrete, describedly calculate the minimum routed path of dissatisfaction according to link quality information, specifically comprise: suppose that a wireless Mesh netword comprises n _rIndividual Mesh router is expressed as V _R={ V _r| r=1,2 ..., n _r, and n _gIndividual Mesh gateway node is expressed as V _G={ v _g| g=1,2 ... .., n _gForm.The Mesh router, the WMR that promptly mentions later (Wireless Mesh Router) can also comprise mobile terminal node.Mesh router and Mesh gateway node all belong to the node in the Mesh network.Each mobile terminal node produces data flow independently, and each data flow q will satisfy specific QoS demand, and promptly aforesaid QoS constrained parameters comprise: the maximum delay D that data flow allows _q, the minimum bandwidth requirement B of data flow _q, the maximum packet loss E that data flow allows _qSupposing the source node of a routed path, is that a WMR represents with s, and destination node is that the Mesh gateway node is represented with d, and then the paths of this from s to d is expressed as Ω _SdPath Ω _SdBe made up of to the link of node j one or more node i, every link can be expressed as { (v _i, v _j), v wherein _i, v _j∈ V _R∪ V _GSuppose that there is the m bar in the path from node s to node d, then arbitrary paths wherein can be expressed as

${\mathrm{\Ω}}_{\mathrm{sd}}^k=\left\{(v_i,v_j)\right|\∀v_i,v_j\∈V_R\∪V_G,k=\mathrm{1,2},...,m\}---\left(1\right)$

Studies show that in document " Quality of Service Routing for Supporting MultimediaApplications " such as Zheng Wang, seek one satisfy two or more independently the routing problem of QoS constraints belong to np complete problem.Multi-QoS constraint routing algorithm in the embodiment of the invention is considered to satisfy the requirement of data flow to bandwidth, time-delay, packet loss, simultaneously parameter separate more than two is claimed, and belongs to np complete problem.In order to dissolve this difficult problem, introduce new ideas: " dissatisfaction ", represent with R.Dissatisfaction is to be used for weighing the degree that every paths satisfies the current QoS demand.The dissatisfaction of every kind of QoS constrained parameters is as follows:

1) start node is to the dissatisfaction of destination node time-delay

For a path from start node s to destination node d

, its dissatisfaction is: the actual transmissions time-delay The maximum delay D that allows with data flow in the QoS constrained parameters _qRatio.

$R_k^D\left(q\right)=\frac{{\mathrm{\Σ}}_{(i,j)\∈{\mathrm{\Ω}}_{\mathrm{sd}}^k}{D}_{\mathrm{ij}}}{(1-{\mathrm{\β}}_D)D_q}---\left(2\right)$

2) dissatisfaction of bandwidth

Same, for the path

, its bandwidth dissatisfaction is: the minimum bandwidth requirement B of data flow in the QoS constrained parameters _qWith the path In the ratio of minimum bandwidth of all links.

$R_k^B\left(q\right)=\frac{(1+{\mathrm{\β}}_B)B_q}{{\min }_{(i,j)\∈{\mathrm{\Ω}}_{\mathrm{sd}}^k}{B}_{\mathrm{ij}}}---\left(3\right)$

3) dissatisfaction of packet loss

For the path

The dissatisfaction of its packet loss is: the maximum packet loss E that the data flow in packet loss on the entire path and the QoS constrained parameters allows _qRatio.

$R_k^E\left(q\right)=\frac{1-{\mathrm{\Π}}_{(i,j)\∈{\mathrm{\Ω}}_{\mathrm{sd}}^k}(1-E_{\mathrm{ij}})}{(1-{\mathrm{\β}}_E)E_q}---\left(4\right)$

Wherein, the β in (2), (3), (4) _D, β _B, β _ERepresentative time-delay respectively, bandwidth, the resource reservation factor of packet loss.Resource reservation is for the QoS demand that guarantees data flow is met, and prevents owing to the judgement of problems such as the time variation of resource measurement being assessed inaccurate or network and concealed nodes to dissatisfaction exerts an influence.

One paths

Satisfy the QoS demand of data flow q, meet as long as then satisfy the dissatisfaction of this paths

Consider that specific application layer traffic-the is insensitive for some parameter, for example: VoIP uses for time-delay responsive, but insensitive to packet loss, uses I _pWhether the expression data flow is responsive for time-delay, bandwidth, packet loss.For example: certain application is expressed as for some parameter is insensitive:

K paths from node s to node d, every paths

Can calculate a value U _k:

$U_k=\max [I_D{R}_k^D\left(q\right),I_E{R}_k^E\left(q\right),I_B{R}_k^B\left(q\right)]---\left(5\right)$

Select U _kMinimum path is as optimum route, and that paths of promptly selecting the dissatisfaction minimum is as optimum route.Be expressed as follows:

$S={\min }_{\∀{\mathrm{\Ω}}_{\mathrm{sd}}^k\∈{\mathrm{\Ω}}_{\mathrm{sd}}}\left(U_k\right)---\left(6\right)$

Further, in the data transmission procedure after step 103, destination node is monitored the actual time delay of packet on the whole routed path, and after time-delay surpassed a threshold value, destination node sent early warning information is initiated route requests to needs start node; Start node restarts to initiate route requests and seeks optimum route, and utilizes optimum route to begin to transmit data.

Concrete, described threshold value specifically multiply by certain percentage (parameter θ) by the maximum permission time-delay of data flow in the QoS constrained parameters and obtains, wherein: 0＜θ≤1.Work as D _Act＞θ * D _qThe time, the expression actual time delay needs to send early warning information greater than described threshold value.Wherein, D _ActBe the transmission delay of packet on the whole routed path of reality that the destination node monitoring obtains; D _qThe maximum that is data flow in the QoS constrained parameters allows time-delay.Selection for θ is very important, because if the θ value is too small, destination node is understood the too early unnecessary early warning information that sends, and under the situation of time-delay demand strictness, is difficult to find satisfactory better path, causes the route requests failure of initiating again; If the θ value is excessive, then early warning information may send too late, has not just satisfied the needs of QoS before new path is found.Attempted different θ values, best results when θ is 0.85 through in the l-G simulation test.

The start node that described transmission early warning information is initiated route requests to needs, described start node comprises: send the source node of data, or bottleneck node.Distinguish two kinds of start nodes and comprise following two kinds of situations:

1) works as D _Act＞θ * D _qThe time, destination node is checked the time-delay of every section link in the path.If the time-delay of every section link is more or less the same (with D _Act/ h compares, D _ActBe the actual time delay on the path, h is the total jumping figure in path), then destination node sends early warning information to the source node that sends data, after source node is received early warning information, initiates route requests again.

2) work as D _Act＞θ * D _qThe time, destination node is checked the time-delay of every section link in the path.If the time-delay of certain section link is greater than 3*D _Act/ h thinks that then this section link is the bottleneck of whole piece routed path, and the upstream node of this link is a bottleneck node.At this moment, send early warning information, initiate route requests, seek the routed path that leads to destination node of accord with Q oS constrained parameters by bottleneck node to bottleneck node.

Need to prove that seek in the process of new route at source node or bottleneck node, original route is still adopted in the transmission of data flow, because original route is not run counter to the QoS demand of data flow.Seeking new route is for fear of the situation that data flow QoS demand occurs running counter to.Distinguishing top two kinds of situations, is when having bottleneck node in the path, only begins to initiate route requests from bottleneck node, can improve the efficient of seeking new route like this.

Fig. 4 is a multiple constraint QoS route system structural representation in the embodiment of the invention based on wireless mesh network, and as shown in Figure 4, the system of described multiple constraint QoS method for routing comprises: start node 41, intermediate node 42 and destination node 43, wherein,

Described start node 41, be used to initiate route requests, the route request information that sends arrives destination node 43 by intermediate node 42, calculate the minimum routed path of dissatisfaction as optimum route after receiving the link quality information of every routed path that destination node 43 returns, and utilize optimum route to begin to transmit data;

Concrete, described start node 41 comprises: need to send when application layer has data, and source node is when leading to the route of destination node, source node is initiated route requests as described start node; Or in the data transmission procedure, bottleneck node also can be used as described start node and initiates route requests.The route requests of described transmission arrives destination node 43 by intermediate node 42, specifically is meant: the broadcast transmission route request information is given adjacent node, through the forwarding arrival destination node of one or more intermediate nodes.Wherein, comprise in the route request information: the QoS constrained parameters of application layer transmission data, for example: time-delay, bandwidth, packet loss.

The described minimum routed path of dissatisfaction that calculates comprises: according to the link quality information of every routed path in conjunction with the QoS constrained parameters that are transmitted data be transmitted data the susceptibility of time-delay, bandwidth or packet loss is calculated the minimum routed path of dissatisfaction.Wherein, link quality information comprises: the accumulative total packet loss in the transmission delay in the whole routed path, the smallest link bandwidth in the path and the path; The QoS constrained parameters that are transmitted data comprise: the maximum packet loss that the maximum delay that data flow allows, the minimum bandwidth requirement of data flow, data flow allow.

Described intermediate node 42 is used to transmit route request information and gives destination node 43, and the link quality information of transmitting every routed path that destination node 43 returns is given start node 41;

Concrete, described intermediate node 42 can be one or more.After described intermediate node 42 received route request information, also the link quality information that can will go up before forwarding once in the route request information process of transmitting was recorded in the route request information, specifically comprises: two internodal time-delays, bandwidth and packet loss.

Further, intermediate node 42 judges whether oneself had received this route request information, if then directly abandon described route request information, otherwise write down the link quality information in the last repeating process.After intermediate node 42 receives route request information, can also judge whether last forwarding meets the standard of constrained parameters, if meet, then writes down the link quality information in the last repeating process according to the QoS constrained parameters, and continue to transmit; If do not meet, then directly abandon described route request information.Described judgement is specially: whether contrast the last bandwidth of transmitting greater than the bandwidth requirement in the QoS constrained parameters, if greater than, then write down the link quality information in the last repeating process, and continue to transmit, otherwise, route request information directly abandoned.

Described destination node 43 is used for the route request information that transmits at every the routed path that receives, by reverse route the link quality information of every routed path is returned to start node 41.

Concrete, described reverse route be meant that intermediate node sets up in the process of broadcasting route requests message by the route of this node to the source node of transmission route requests.

Further, described destination node 43 also is used to monitor the actual time delay on the whole routed path, after time-delay surpasses a threshold value, sends early warning information is initiated route requests to needs start node 41; Start node 41 restarts to initiate route requests and seeks optimum route, and utilizes optimum route to begin to transmit data.

Concrete, the maximum delay that described threshold value specifically allows by data flow in the QoS constrained parameters multiply by certain percentage (parameter θ) and obtains, wherein: 0＜θ≤1.Work as D _Act＞θ * D _qThe time, the expression actual time delay needs to send early warning information greater than described threshold value.Wherein, D _ActIt is the time-delay that destination node 43 is monitored on the actual whole routed path that obtains; D _qIt is the maximum delay that data flow allows in the QoS constrained parameters.Selection for θ is very important, because if the θ value is too small, destination node is understood the too early unnecessary early warning information that sends, and under the situation of time-delay demand strictness, is difficult to find satisfactory better path, causes the route requests failure of initiating again; If the θ value is excessive, then early warning information may send too late, has not just satisfied the needs of QoS before new path is found.Attempted different θ values, best results when θ is 0.85 through in the l-G simulation test.

The start node 41 that described transmission early warning information is initiated route requests to needs, described start node 41 comprises: send the source node of data, or bottleneck node.Distinguish two kinds of start nodes and comprise following two kinds of situations:

1) works as D _Act＞θ * D _qThe time, destination node is checked the time-delay of every section link in the path.If the time-delay of every section link is more or less the same (with D _Act/ h compares, D _ActBe the actual time delay on the path, h is the total jumping figure in path), then destination node sends early warning information to the source node that sends data, after source node is received early warning information, initiates route requests again.

2) work as D _Act＞θ * D _qThe time, destination node is checked the time-delay of every section link in the path.If the time-delay of certain section link is greater than 3*D _Act/ h thinks that then this section link is the bottleneck of whole piece routed path, and the upstream node of this link is a bottleneck node.At this moment, send early warning information, initiate route requests, seek the routed path that leads to destination node of accord with Q oS constrained parameters by bottleneck node to bottleneck node.

Fig. 5 to Fig. 7 carries out emulation for utilizing network simulation software NS-2 (Network Simulator Version 2), and contrasts the result who obtains with the AODV agreement.Some parameters of mentioning in this method are provided with situation: the resource reservation factor-beta _D, β _E, β _BUnification is made as 0.2; Parameter θ value in the delay threshold is made as 0.85.Fig. 5 to Fig. 7 has reflected the increase along with constant bit rate in the emulation (CBR) data package transmission velocity, the variation that network average throughput, start node arrive destination node average delay, network packet loss rate.Simulation result shows that the multiple constraint QoS routing algorithm that this method proposes can be good at satisfying time-delay, the packet loss requirement of data flow, has improved the throughput of network simultaneously.Fig. 5 is that the network average throughput is with CBR data package transmission velocity variation diagram in the emulation experiment, and as shown in Figure 5, abscissa is CBR data package transmission velocity (packets/second); Ordinate is network average throughput (kbps); Having foursquare lines is to utilize the method for the embodiment of the invention or the effect that system realizes; The lines that have cross spider are effects of utilizing existing AODV agreement to realize.Compare the AODV agreement, the network average throughput of this QoS routing algorithm has improved about 10%, and this is because this algorithm has been considered link bandwidth in the process of route discovery, can select the bigger path of those bandwidth, has utilized network bandwidth resources fully.Fig. 6 satisfies D in the emulation experiment _qPacket account for the variation diagram of the ratio of the total data bag that receives with the CBR data package transmission velocity, as shown in Figure 6, abscissa is CBR data package transmission velocity (packets/second); Ordinate is for satisfying D _qPacket account for the ratio (%) of the total data bag that receives; Having foursquare lines is to utilize the method for the embodiment of the invention or the effect that system realizes; The lines that have cross spider are effects of utilizing existing AODV agreement to realize.Fig. 6 reflects, use this QoS routing algorithm after, satisfy the maximum delay D that data flow allows _qThe packet ratio increased about 25%, reason is that this algorithm has been considered the delay performance of link when selecting route, and in time repairs the bigger path of time-delay in route maintenance procedure.Fig. 7 is that the packet arrival rate in the network is with the variation diagram of CBR data package transmission velocity in the emulation experiment, and as shown in Figure 7, abscissa is CBR data package transmission velocity (packets/second); Ordinate is the packet arrival rate (%) of data in the network; Having foursquare lines is to utilize the method for the embodiment of the invention or the effect that system realizes; The lines that have cross spider are effects of utilizing existing AODV agreement to realize.Fig. 7 reflects that this QoS routing algorithm is compared with existing AODV agreement, and the grouping of network arrival rate has improved about 15%.

The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.

Claims (10)

1. multi-constraint quality-of-service control (QoS) method for routing in the based on wireless mesh network is characterized in that described method comprises:

The route request information that start node sends arrives destination node by intermediate node;

The route request information that destination node transmits at every the routed path that receives returns to start node by reverse route with the link quality information of every routed path;

Start node calculates the minimum routed path of dissatisfaction as optimum route, and utilizes optimum route transmission data.

2. method according to claim 1 is characterized in that, after the described transmission data, also comprise: destination node is monitored the actual time delay on the whole routed path, after time-delay surpasses threshold value, sends early warning information is initiated route requests to needs start node; Start node restarts to initiate route requests and seeks optimum route, and utilizes optimum route transmission data.

3. method according to claim 1 and 2 is characterized in that, described start node comprises: the source node or the bottleneck node that send data.

4. method according to claim 1 and 2, it is characterized in that, described mode by intermediate node arrival destination node specifically is that intermediate node sends route request information to adjacent node by the mode of broadcasting, through the forwarding arrival destination node of one or more nodes.

5. method according to claim 4 is characterized in that, described intermediate node sends before the route request information by the mode of broadcasting, and also comprises: two internodal link quality information in the last process of transmitting are recorded in the route request information.

6. method according to claim 1 and 2 is characterized in that, the described minimum routed path of dissatisfaction that calculates comprises:

According to the link quality information of every routed path in conjunction with the QoS constrained parameters that are transmitted data be transmitted data the susceptibility of time-delay, bandwidth, packet loss is calculated the minimum routed path of dissatisfaction;

Wherein, link quality information comprises: per two internodal time-delays, bandwidth and packet loss in the whole routed path; The QoS constrained parameters that are transmitted data comprise: the maximum packet loss that the maximum delay that data flow allows, the minimum bandwidth requirement of data flow, data flow allow.

7. multi-constraint quality-of-service control route system in the based on wireless mesh network is characterized in that described system comprises: start node, intermediate node and destination node, wherein,

Described start node, be used to initiate route requests and arrive destination node by intermediate node, calculate the minimum routed path of dissatisfaction as optimum route after receiving the link quality information of every routed path that destination node returns, and utilize optimum route transmission data;

Described intermediate node is used to transmit route request information and gives destination node, and the link quality information of transmitting every routed path that destination node returns is given start node;

Described destination node is used for the route request information that transmits at every the routed path that receives, by reverse route the link quality information of every routed path is returned to start node.

8. system according to claim 7 is characterized in that, described destination node also is used to monitor the actual time delay on the whole routed path, after time-delay surpasses threshold value, sends early warning information is initiated route requests to needs start node; Start node restarts to initiate route requests and seeks optimum route, and utilizes optimum route to begin to transmit data.

9. according to claim 7 or 8 described systems, it is characterized in that described start node comprises: the source node or the bottleneck node that send data.

10. according to claim 7 or 8 described systems, it is characterized in that described start node calculates the minimum routed path of dissatisfaction, comprising:

According to the link quality information of every routed path in conjunction with the QoS constrained parameters that are transmitted data be transmitted data the susceptibility of time-delay, bandwidth or packet loss is calculated the minimum routed path of dissatisfaction;

Wherein, link quality information comprises: per two internodal time-delays, bandwidth and packet loss in the whole routed path; The QoS constrained parameters that are transmitted data comprise: the maximum packet loss that the maximum delay that data flow allows, the minimum bandwidth requirement of data flow, data flow allow.

Images