CN101854697B - 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 wireless mesh network

Technical field

The present invention relates to the method for routing in cordless communication network, refer to that in a kind of wireless mesh network, multi-constraint quality-of-service controls (QoS) method for routing and system especially.

Background technology

Wireless mesh network (wireless Mesh netword) is made up of static or semi-static radio node, these static nodes are interconnected by wireless link in (Ad-hoc) mode of self-organizing, wherein, only have limited several nodes to enter the Internet, these nodes play the part of the role of gateway in wireless Mesh netword.Because Ad-hoc network and wireless Mesh netword have a lot of similar characteristic, many Routing Protocols for Ad-hoc network also may be used for wireless Mesh netword.C.E.Perkins and E.M.Royer proposed a kind of wireless self-networking plan range vector route (AODV) agreement being as required applicable to Ad-hoc network in 2000.AODV agreement only has data to send at source node, but when not leading to the routing iinformation of destination node, just go to obtain route by the mode of active inquiry, routing table is set up as required, and grouping process of transmitting adopts the mode of forwarded hop-by-hop.Meanwhile, AODV agreement only just can implement route repair measure when link breakdown cannot realize inter-node communication.This does not obviously meet the transmission demand of data flow, greatly can increase transmission delay.

Along with the extensive use of Wireless Mesh network technology, user constantly increases multimedia service demand in wireless network application, and how realizing the multiple services service quality such as data, voice and image, to control (QoS) be important content in future wireless system research.QoS route is the important ring in QoS security system.

QoS route is that the qos requirement of a kind of network available resources and Business Stream comes the routing mechanism of selecting paths or a kind of dynamic routing protocol comprising various qos parameter.In brief, QoS route is used for searching the path meeting qos requirement.Qos requirement can be the parameter of one dimension, and also can be the parameter of multidimensional, corresponding QoS route be called as one-dimensional or multi-QoS route.The constraints weighing QoS is a lot, comprises time delay, bandwidth, packet loss rate and network throughput etc.Find the uncertain problems (np complete problem) of a routed path meeting multiple QoS constraints normally multinomial complexity, so the QoS index realizing multidimensional is comparatively difficult.

Summary of the invention

In view of this, main purpose of the present invention is to provide Multi-constraint QoS paths method and system in a kind of wireless mesh network, can solve the problem that the QoS index that realizes multidimensional is more difficult 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 in a kind of wireless mesh network and control (QoS) method for routing, 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 for the every bar routed path received, returns to start node by reverse route by the link quality information of every bar routed path;

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

Wherein, after described transmission data, also comprise: destination node monitors the actual time delay on whole routed path, after time delay exceedes threshold value, send early warning information to the start node needing to initiate route requests; Start node restarts to initiate route requests and finds optimum route, and utilizes optimum route transmission data.

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

Wherein, the described mode by intermediate node arrival destination node specifically intermediate node sends route request information to adjacent node by the mode of broadcast, and the forwarding through one or more node arrives destination node.

Wherein, described intermediate node also comprises: two internodal link quality information in last process of transmitting be recorded in route request information before sending route request information by the mode of broadcast.

Wherein, described in calculate the minimum routed path of dissatisfaction, comprising:

Combine the QoS constrained parameters that are transmitted data according to the link quality information of every bar routed path and be transmitted the susceptibility of data to time delay, bandwidth, packet loss and calculate the minimum routed path of dissatisfaction;

Wherein, link quality information comprises: every two internodal time delays, bandwidth sum packet loss in whole routed path; The QoS constrained parameters being 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.

Present invention also offers multi-constraint quality-of-service in a kind of wireless mesh network and control route system, described system comprises: start node, intermediate node and destination node, wherein,

Described start node, destination node is arrived by intermediate node for initiating route requests, calculate the minimum routed path of dissatisfaction after receiving the link quality information of every bar routed path that destination node returns as optimum route, and utilize optimum route transmission data;

Described intermediate node, for forwarding route request information to destination node, and the link quality information forwarding every bar routed path that destination node returns is to start node;

Described destination node, for the route request information transmitted for the every bar routed path received, returns to start node by reverse route by the link quality information of every bar routed path.

Wherein, described destination node, also for monitoring the actual time delay on whole routed path, after time delay exceedes threshold value, sends early warning information to the start node needing to initiate route requests; Start node restarts to initiate route requests and finds optimum route, and utilizes optimum route to start to transmit data.

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

Multi-constraint QoS paths method and system in wireless mesh network provided by the present invention, the route request information sent by start node arrives destination node by intermediate node, then, the route request information that destination node transmits for the every bar routed path received, by reverse route, the link quality information of every bar routed path is returned to start node, finally, start node calculates the minimum routed path of dissatisfaction as optimum route, and utilizes optimum route transmission data.Multi-QoS route can be realized like this, namely search out a best routed path meeting multiple QoS constraints.Compared with existing AODV agreement, average throughput and the packet arrival rate of network can be improved, and increase the ratio shared by the packet meeting time delay condition in QoS constrained parameters.

Accompanying drawing explanation

Fig. 1 is Multi-constraint QoS paths method flow schematic diagram in embodiment of the present invention wireless mesh network;

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

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

Fig. 4 is Multi-constraint QoS paths system configuration schematic diagram in embodiment of the present invention wireless mesh network;

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

Fig. 6 meets D in emulation experiment _qpacket account for the variation diagram of ratio with CBR data package transmission velocity of the total data bag received;

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

Embodiment

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

Fig. 1 is Multi-constraint QoS paths method flow schematic diagram in embodiment of the present invention wireless mesh network, and as shown in Figure 1, described Multi-constraint QoS paths method is applied to wireless Mesh netword usually, and based on AODV agreement, described method specifically comprises the following steps:

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

Concrete, described start node comprises: when application layer has data to need to send, and when source node does not lead to the route of destination node, source node initiates route requests as described start node; Or in data transmission procedure, bottleneck node also can initiate route requests as described start node.The route request information of described transmission arrives destination node by intermediate node, specifically refers to: broadcast transmission route request information is to adjacent node, and the forwarding through one or more intermediate node arrives destination node.Wherein, route request information comprises: the QoS constrained parameters of application layer transmission data, such as: time delay, bandwidth, packet loss.Link quality information in last route request information process of transmitting also can be recorded in route request information by intermediate node before forwarding that simultaneously receive route request information, specifically comprises: two internodal time delays, bandwidth sum packet loss.

Further, intermediate node judges that whether oneself had received this route request information, if so, then directly abandoned described route request information, otherwise recorded the link quality information in last repeating process.After intermediate node receives route request information, also need to judge whether last forwarding meets the standard of constrained parameters, if met, then records the link quality information in last repeating process according to the QoS constrained parameters of data flow, and continue to forward; If do not met, then directly abandon described route request information.Described judgement is specially: whether the last bandwidth forwarded of contrast is greater than the bandwidth requirement in QoS constrained parameters, if be greater than, then records the link quality information in last repeating process, and continues to forward, otherwise, directly abandon route request information.The process of transmitting of example to route requests below in conjunction with Fig. 2 makes an explanation:

Fig. 2 is the process of transmitting schematic diagram of route requests in embodiment of the present invention wireless mesh network, and as shown in Figure 2, suppose that node 1 needs to search out the route of gateway node 5 as start node, the arrow sent from node in figure represents the RREQ message of this node broadcasts.Node 1 can first broadcast RREQ message to its a hop neighbor node, after node 2 receives the RREQ message of node 1 broadcast, whether the bandwidth between meeting first comparison node 1 to node 2 is greater than the bandwidth in the QoS constrained parameters of RREQ message, if be less than, directly abandons this RREQ message; If be greater than, recorded node 1 to the time delay of node 2 this section of link, bandwidth and packet loss, then broadcast this RREQ message.The RREQ message that node 2 is broadcasted can be received by node 1 again, and at this moment because this RREQ message has just sent to node 2 by node 1, therefore node 1 directly abandons this RREQ message.Node 3 and node 6 also can receive this RREQ message, they receive this RREQ message at first time, processing method with node 2 is the same, first relatively this section of link bandwidth and data flow requirements bandwidth, if meet again the time delay of minute book section link, bandwidth and packet loss, and continue this RREQ message of broadcast.Node 6 is through the broadcast of node 7, and this RREQ message arrives destination node 5.Meanwhile, node 3 is through the broadcast of node 4, and described RREQ message also arrives destination node 5.The pass-through mode of node 4 and node 7 and node 2,3,6 identical.Now, the process of route requests obtains two routed paths, 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 for the every bar routed path received, returns to start node by reverse route by the link quality information of every bar routed path;

Concrete, described reverse route refer to that intermediate node sets up in the process of broadcast route request message by the route of this node to the source node of transmission route requests.Fig. 3 is the process schematic of return link quality information in embodiment of the present invention wireless mesh network, wherein, the link quality information of two routed paths is returned to start node 1 respectively by two reverse routes by destination node 5, respectively: destination node 5 arrives start node 1 through intermediate node 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, start node calculates the minimum routed path of dissatisfaction as optimum route according to the link quality information that every bar route returns, and utilizes optimum route to start 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 _gcomposition.Mesh router, the WMR namely mentioned below (Wireless Mesh Router), can also comprise mobile terminal node.Mesh router and Mesh gateway node all belong to the node in Mesh network.Each mobile terminal node produces data flow independently, and each data flow q will meet specific QoS demand, i.e. aforesaid QoS constrained parameters, comprising: 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 _q.Suppose the source node of a routed path, be that a WMR represents with s, destination node is that Mesh gateway node represents with d, then this paths from s to d is expressed as Ω _sd.Path Ω _sdbe made up of the link of one or more node i to node j, every bar link can be expressed as { (v _i, v _j), wherein v _i, v _j∈ V _r∪ V _g.Suppose there is m bar from node s to the path of 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)$

The research in document " Quality of Service Routing for Supporting MultimediaApplications " such as Zheng Wang shows, finds a routing problem meeting two or more independently QoS constraintss and belongs to np complete problem.Routing algorithm with multiple QoS in the embodiment of the present invention, consider to meet the requirement of data flow to bandwidth, time delay, packet loss, simultaneously separate to two or more parameter claims, and belongs to np complete problem.In order to dissolve this difficult problem, introduce new ideas: " dissatisfaction ", represents with R.Dissatisfaction is used to weigh the degree that every paths meets current QoS demand.The dissatisfaction of often 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: actual transmissions time delay the maximum delay D allowed with the data flow in 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 path , its bandwidth dissatisfaction is: the minimum bandwidth requirement B of data flow in QoS constrained parameters _qwith 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 path the dissatisfaction of its packet loss is: the maximum packet loss E that the data flow in the packet loss on whole path and 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, β _erepresent time delay respectively, bandwidth, the resource reservation factor of packet loss.Resource reservation is to ensure that the QoS demand of data flow is met, and prevents the judgements of problem to dissatisfaction such as the time variation owing to assessing inaccurate or network to resource measurement and concealed nodes from having an impact.

One paths meet the QoS demand of data flow q, as long as the dissatisfaction then meeting this paths meets consider that specific application layer traffic-the is insensitive for some parameter, such as: VoIP applies for latency sensitive, but insensitive to packet loss, uses I _prepresent that whether data flow is responsive for time delay, bandwidth, packet loss.Such as: certain application is expressed as some parameter is insensitive:

In the k paths from node s to node d, every paths a value U can be calculated _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 namely selecting 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 monitors the actual time delay of packet on whole routed path, and after time delay is more than a threshold value, destination node sends early warning information to the start node needing to initiate route requests; Start node restarts to initiate route requests and finds optimum route, and utilizes optimum route to start to transmit data.

Concrete, described threshold value is multiplied by certain percentage (parameter θ) especially by the maximum permission time delay of data flow in QoS constrained parameters and obtains, wherein: 0 < θ≤1.Work as D _act> θ * D _qtime, represent that actual time delay is greater than described threshold value, need to send early warning information.Wherein, D _actthat destination node monitors the transmission delay of packet on the whole routed path of reality obtained; D _qit is the maximum permission time delay of data flow in QoS constrained parameters.Selection for θ is very important, because if θ value is too small, what destination node can be too early sends unnecessary early warning information, and when latency requirement is strict, is difficult to find satisfactory better path, causes the route requests failure again initiated; If θ value is excessive, then early warning information may send too late, before new path is found, just do not meet the needs of QoS.Different θ values has been attempted, the best results when θ is 0.85 in l-G simulation test.

Described transmission early warning information is to needing the start node of initiating route requests, and described start node comprises: the source node sending data, or bottleneck node.Distinguish two kinds of start nodes and comprise following two kinds of situations:

1) D is worked as _act> θ * D _qtime, destination node checks the time delay of every section of link in path.If the time delay of every section of link is more or less the same (with D _act/ h compares, D _actfor the actual time delay on path, h is the total jumping figure in path), then destination node sends early warning information to the source node sending data, after source node receives early warning information, again initiates route requests.

2) D is worked as _act> θ * D _qtime, destination node checks the time delay of every section of link in path.If the time delay of certain section of link is greater than 3*D _act/ h, then think that this section of link is the bottleneck of whole piece routed path, and the upstream node of this link is bottleneck node.Now, send early warning information to bottleneck node, initiate route requests by bottleneck node, find the routed path leading to destination node meeting QoS constrained parameters.

It should be noted that, find in the process of new route at source node or bottleneck node, the transmission of data flow still adopts original route, because original route does not run counter to the QoS demand of data flow.Finding new route is situation in order to avoid there is running counter to data flow QoS demand.Distinguish two kinds of situations above, when being to there is bottleneck node in the paths, only from bottleneck node, initiating route requests, the efficiency finding new route can be improved like this.

Fig. 4 is Multi-constraint QoS paths system configuration schematic diagram in embodiment of the present invention wireless mesh network, and as shown in Figure 4, the system of described Multi-constraint QoS paths method comprises: start node 41, intermediate node 42 and destination node 43, wherein,

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

Concrete, described start node 41 comprises: when application layer has data to need to send, and when source node does not lead to the route of destination node, source node initiates route requests as described start node; Or in data transmission procedure, bottleneck node also can initiate route requests as described start node.The route requests of described transmission arrives destination node 43 by intermediate node 42, specifically refers to: broadcast transmission route request information is to adjacent node, and the forwarding through one or more intermediate node arrives destination node.Wherein, route request information comprises: the QoS constrained parameters of application layer transmission data, such as: time delay, bandwidth, packet loss.

Describedly calculate the minimum routed path of dissatisfaction, comprising: combine according to the link quality information of every bar routed path the QoS constrained parameters that are transmitted data and be transmitted the susceptibility of data to time delay, bandwidth or packet loss and calculate the minimum routed path of dissatisfaction.Wherein, link quality information comprises: the accumulative packet loss in the transmission delay in whole routed path, smallest link bandwidth sum path in path; The QoS constrained parameters being 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, for forwarding route request information to destination node 43, and the link quality information forwarding every bar routed path that destination node 43 returns is to start node 41;

Concrete, described intermediate node 42 can be one or more.After described intermediate node 42 receives route request information, also can before forwarding the link quality information in last route request information process of transmitting be recorded in route request information, specifically comprise: two internodal time delays, bandwidth sum packet loss.

Further, intermediate node 42 judges that whether oneself had received this route request information, if so, then directly abandoned described route request information, otherwise recorded the link quality information in last repeating process.After intermediate node 42 receives route request information, can also judge whether last forwarding meets the standard of constrained parameters, if met, then records the link quality information in last repeating process according to QoS constrained parameters, and continue to forward; If do not met, then directly abandon described route request information.Described judgement is specially: whether the last bandwidth forwarded of contrast is greater than the bandwidth requirement in QoS constrained parameters, if be greater than, then records the link quality information in last repeating process, and continues to forward, otherwise, directly abandon route request information.

Described destination node 43, for the route request information transmitted for the every bar routed path received, returns to start node 41 by reverse route by the link quality information of every bar routed path.

Concrete, described reverse route refer to that intermediate node sets up in the process of broadcast route request message by the route of this node to the source node of transmission route requests.

Further, described destination node 43, also for monitoring the actual time delay on whole routed path, after time delay is more than a threshold value, sends early warning information to the start node 41 needing to initiate route requests; Start node 41 restarts to initiate route requests and finds optimum route, and utilizes optimum route to start to transmit data.

Concrete, described threshold value is multiplied by certain percentage (parameter θ) especially by the maximum delay that data flow in QoS constrained parameters allows and obtains, wherein: 0 < θ≤1.Work as D _act> θ * D _qtime, represent that actual time delay is greater than described threshold value, need to send early warning information.Wherein, D _actit is the time delay that destination node 43 monitors on the whole routed path of reality that obtains; D _qit is the maximum delay that in QoS constrained parameters, data flow allows.Selection for θ is very important, because if θ value is too small, what destination node can be too early sends unnecessary early warning information, and when latency requirement is strict, is difficult to find satisfactory better path, causes the route requests failure again initiated; If θ value is excessive, then early warning information may send too late, before new path is found, just do not meet the needs of QoS.Different θ values has been attempted, the best results when θ is 0.85 in l-G simulation test.

Described transmission early warning information is to needing the start node 41 of initiating route requests, and described start node 41 comprises: the source node sending data, or bottleneck node.Distinguish two kinds of start nodes and comprise following two kinds of situations:

1) D is worked as _act> θ * D _qtime, destination node checks the time delay of every section of link in path.If the time delay of every section of link is more or less the same (with D _act/ h compares, D _actfor the actual time delay on path, h is the total jumping figure in path), then destination node sends early warning information to the source node sending data, after source node receives early warning information, again initiates route requests.

2) D is worked as _act> θ * D _qtime, destination node checks the time delay of every section of link in path.If the time delay of certain section of link is greater than 3*D _act/ h, then think that this section of link is the bottleneck of whole piece routed path, and the upstream node of this link is bottleneck node.Now, send early warning information to bottleneck node, initiate route requests by bottleneck node, find the routed path leading to destination node meeting QoS constrained parameters.

Fig. 5 to Fig. 7 emulates for utilizing Network Simulation Software NS-2 (Network Simulator Version 2), and contrasts with AODV agreement the result obtained.Some optimum configurations situations mentioned in this method: resource reservation factor-beta _d, β _e, β _bunification is set to 0.2; Parameter θ value in delay threshold is set to 0.85.Fig. 5 to Fig. 7 reflects the increase along with constant bit rate (CBR) data package transmission velocity in emulation, and network average throughput, start node are to the change of destination node average delay, network packet loss rate.Simulation result shows, the QoS routing algorithm that this method proposes can be good at the time delay, the packet loss requirement that meet data flow, improves the throughput of network simultaneously.Fig. 5 is that in emulation experiment, network average throughput is with CBR data package transmission velocity variation diagram, and as shown in Figure 5, abscissa is CBR data package transmission velocity (packets/second); Ordinate is network average throughput (kbps); The effects utilizing the method for the embodiment of the present invention or system to realize with foursquare lines; The effects utilizing existing AODV protocol realization with retiform lines.Compare AODV agreement, the network average throughput of this QoS routing algorithm improves about 10%, and this is because this algorithm take into account link bandwidth in the process of route discovery, can select the path that those bandwidth are larger, make use of network bandwidth resources fully.Fig. 6 meets D in emulation experiment _qpacket account for the variation diagram of ratio with CBR data package transmission velocity of the total data bag received, as shown in Figure 6, abscissa is CBR data package transmission velocity (packets/second); Ordinate is for meeting D _qpacket account for the ratio (%) of the total data bag received; The effects utilizing the method for the embodiment of the present invention or system to realize with foursquare lines; The effects utilizing existing AODV protocol realization with retiform lines.Fig. 6 reflects, after using this QoS routing algorithm, meets the maximum delay D that data flow allows _qpacket ratio add about 25%, consider the delay performance of link when reason is this algorithms selection route, and repair in time the larger path of time delay in route maintenance procedure.Fig. 7 is the variation diagram of the packet arrival rate in emulation experiment in network with CBR data package transmission velocity, and as shown in Figure 7, abscissa is CBR data package transmission velocity (packets/second); Ordinate is the packet arrival rate (%) of data in network; The effects utilizing the method for the embodiment of the present invention or system to realize with foursquare lines; The effects utilizing existing AODV protocol realization with retiform lines.Fig. 7 reflects, this QoS routing algorithm is compared with existing AODV agreement, and the packet arrival rate of network improves about 15%.

The above, be only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention, and all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.

Claims (10)

1. in wireless mesh network, multi-constraint quality-of-service controls (QoS) method for routing, and it 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 for the every bar routed path received, returns to start node by reverse route by the link quality information of every bar routed path;

Start node combines the QoS constrained parameters that are transmitted data according to the link quality information of every bar routed path and is transmitted the susceptibility of data to time delay, bandwidth, packet loss and 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 described transmission data, also comprises: destination node monitors the actual time delay on whole routed path, after time delay exceedes threshold value, sends early warning information to the start node needing to initiate route requests; Start node restarts to initiate route requests and finds optimum route, and utilizes optimum route transmission data.

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

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

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

6. method according to claim 1 and 2, is characterized in that, described link quality information comprises: every two internodal time delays, bandwidth sum packet loss in whole routed path; The QoS constrained parameters being 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. in wireless mesh network, multi-constraint quality-of-service controls a route system, and it is characterized in that, described system comprises: start node, intermediate node and destination node, wherein,

Described start node, destination node is arrived by intermediate node for initiating route requests, after receiving the link quality information of every bar routed path that destination node returns, combine the QoS constrained parameters that are transmitted data according to the link quality information of every bar routed path and be transmitted the susceptibility of data to time delay, bandwidth, packet loss and calculate the minimum routed path of dissatisfaction as optimum route, and utilize optimum route transmission data;

Described intermediate node, for forwarding route request information to destination node, and the link quality information forwarding every bar routed path that destination node returns is to start node;

Described destination node, for the route request information transmitted for the every bar routed path received, returns to start node by reverse route by the link quality information of every bar routed path.

8. system according to claim 7, is characterized in that, described destination node, also for monitoring the actual time delay on whole routed path, after time delay exceedes threshold value, sends early warning information to the start node needing to initiate route requests; Start node restarts to initiate route requests and finds optimum route, and utilizes optimum route to start to transmit data.

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

10. the system according to claim 7 or 8, is characterized in that, described link quality information comprises: every two internodal time delays, bandwidth sum packet loss in whole routed path; The QoS constrained parameters being 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.