CN101048012A - Method for deciding route at radio mesh network - Google Patents

Method for deciding route at radio mesh network Download PDF

Info

Publication number
CN101048012A
CN101048012A CNA2006100900354A CN200610090035A CN101048012A CN 101048012 A CN101048012 A CN 101048012A CN A2006100900354 A CNA2006100900354 A CN A2006100900354A CN 200610090035 A CN200610090035 A CN 200610090035A CN 101048012 A CN101048012 A CN 101048012A
Authority
CN
China
Prior art keywords
node
route
route requests
current
receives
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CNA2006100900354A
Other languages
Chinese (zh)
Inventor
方旭明
沈强
姚忠辉
张军平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Southwest Jiaotong University
Original Assignee
Huawei Technologies Co Ltd
Southwest Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd, Southwest Jiaotong University filed Critical Huawei Technologies Co Ltd
Priority to CNA2006100900354A priority Critical patent/CN101048012A/en
Publication of CN101048012A publication Critical patent/CN101048012A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method for route-identifying in a wireless mesh network, including: It set up different routing strategies for different types of business, and the source nodes receive multi-path routing response with routing information, then the source determines the related routing according to the strategy of the business and the routing information. The invention can ensure data transmission between the source node and the destination node, and greatly improves the network performance.

Description

A kind of method of in based on wireless mesh network, determining route
Technical field
The present invention relates to the network communications technology, relate to particularly that a kind of (WirelessMesh Network determines the method for route in WMN) at based on wireless mesh network.
Background technology
WMN is a kind of novel broadband wireless network structure, is the distributed wireless networks of a kind of high power capacity, two-forty.In the WMN network, employed parent Routing Protocol is mainly DSR (Dynamic Source Routing, DSR) agreement when carrying out business data transmission.
Fig. 1 is a flow chart of determining route between two nodes in the prior art.Referring to Fig. 1, at present in the WMN network, when a source node, such as source node A, need to determine arrive a destination node, during such as the route of destination node C, prior art utilizes the DSR agreement to determine that the process of route between source node A and the destination node C may further comprise the steps:
Step 101: source node A by broadcast mode send a route requests at destination node C (Route Request, RREQ).
Here, can comprise in the described route requests: the life cycle TTL of this broadcasting route requests (being generally the jumping figure restriction), the bag sequence number of this route requests, the address information of source node self and the address information of destination node etc.
Step 102: intermediate node B receives this route requests, judges whether to abandon the current route requests that receives, if, then finish current flow process, otherwise, execution in step 103.
Here, intermediate node B judges whether that the process that should abandon the current route requests that receives is: intermediate node B judges self whether to receive once that described source node A sent to the route requests of described destination node C, if do not receive, then not think and to abandon the current route requests that receives, if once received, the bag sequence number of then judging the described route requests once received whether more than or equal to the bag sequence number of the current route requests of receiving, if, then determine to abandon the current route requests that receives, otherwise not think and to abandon the current route requests that receives.
Step 103: intermediate node B is carried at the routing information of this node in the route requests that receives, and then current route requests is sent to destination node C.
Need to prove, because in step 101, source node A sends route requests by broadcast mode, so route requests can be transmitted by mulitpath, on each paths, the processing procedure of each intermediate node is as the processing procedure of intermediate node B in Fig. 1.Accordingly, the received route requests of destination node is many route requests of being sent by the different intermediate nodes on the different paths of carrying different routing informations.
When step 104: destination node C received each bar route requests, all the routing information that this section point is collected was carried in this route requests.
When step 105: destination node C receives each bar route requests, all routing informations in this route requests are carried in the route response and are sent to source node A.
Step 106: after source node A received each bar route response, according to all routing informations that carry in each bar route response, the path that the node jumping figure is minimum was defined as the route of this type of service.
Step 107: source node A is sent to destination node C by the minimum route of determined node jumping figure with this business datum.
By above-mentioned flow process shown in Figure 1 as can be seen, after receiving the route response of carrying various routing informations when source node, no matter which kind of type of service is this business be, the route that source node is determined all is the minimum paths of node jumping figure, in subsequent process, source node then transmits according to the minimum path of determined node jumping figure when sending the business datum of this type of service.
Yet, one of business characteristic of WMN has just provided the multimedia service service at present, that is to say, in the WMN network, can transmit the data of multiple business type, such as, the business datum of the business datum of sound-type, the business datum of video type, text type and the business datum of the type of doing one's best etc.For the data of different service types, its requirement to QoS is different.
This shows, prior art is not distinguished for different types of service, and adopt identical routing policy, promptly all minimum path according to the node jumping figure, determine the way of route, can't satisfy its different requirements at the data of different service types, can't utilize Internet resources fully, thereby greatly reduce the performance of network QoS.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method of determining route in WMN, so that determine to satisfy the optimal path of its operation quality requirement at different types of service.
In order to achieve the above object, technical scheme of the present invention is achieved in that
A kind of method of in based on wireless mesh network, determining route, this method comprises: at different types of service different routing decision strategies is set; After source node receives many route responses of carrying routing information,, determine this professional corresponding route according to the routing information that carries in the routing decision strategy of this type of service correspondence and each bar route response.
Before source node receives many route responses of carrying routing information, further comprise:
After A, each intermediate node received the route requests of source node by the broadcast mode transmission, the routing information of collecting according to this section point upgraded the routing information in the route requests respectively;
B, each intermediate node are sent to destination node with current route requests respectively;
After C, destination node received each bar route requests, the routing information of collecting according to this section point upgraded the routing information in the route requests respectively, the routing information that carries in each bar route requests is carried at respectively in each bar route response sends to source node then.
Further comprise between steps A and step B: each intermediate node judges whether once to receive the route requests that described source node sends to described destination node, if, judge then whether the bag sequence number of the described route requests that once received equals the bag sequence number of the current route requests that receives, if, then judge the path of the described the route requests whether path of the current route requests that receives is better than once receiving, if be better than, execution in step B then, if be not better than, then finish current flow process.
Described this type of service is voice;
The path of the described the route requests whether described path of judging the current route requests that receives is better than once receiving comprises: judge whether the node jumping figure from source node to described intermediate node is less than the node jumping figure from source node to described intermediate node the described route requests that once received in the current route requests that receives, if, then determine the path of the described route requests that the path of the current route requests that receives is better than once receiving, otherwise the path of determining the current route requests that receives is not better than the path of the described route requests that once received.
Described this type of service is a video;
In steps A, the step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to described intermediate node iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives described intermediate node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal
PDR = Π i = 1 i = N - 1 rd r i , i + 1 , And N is the node number from source node to described intermediate node in the path, Bw iBe the statistics remaining bandwidth from source node i node to the described intermediate node, pdr I, i+1For from source node to the described intermediate node i node to the delivery rate of i+1 node;
The path of the described the route requests whether described path of judging the current route requests that receives is better than once receiving comprises:
100, described intermediate node obtains the value of Min_Bw and the value of PDR respectively from current route requests that receives and the described route requests that once received, utilizes formula W respectively 1=α Min_Bw+ β PDR calculates the W at current route requests that receives and the described route requests that once received 1Value, wherein, α and β are weighted factor;
101, described intermediate node is judged the W at the current route requests that receives 1Whether value is greater than the W of the described route requests that once received 1Value is not if then determine the path of the described route requests that the path of the current route requests that receives is better than once receiving, otherwise the path of determining the current route requests that receives is better than the path of the described route requests that once received.
Described this type of service is for doing one's best;
In steps A, the step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to described intermediate node iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives described intermediate node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives, and with the information on load Load of described intermediate node iReceive after the original Max_Load that carries in the route requests gets maximum with current, use this maximum to upgrade the value of the Max_Load in the current route requests that receives, wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal PDR = Π i = 1 i = N - 1 pdr i , i + 1 , Max_Load=max (Load after the renewal 1, Load 2..., Load i..., Load N), and N is the node number from source node to described intermediate node in the path, Bw iBe the statistics remaining bandwidth from source node i node to the described intermediate node, pdr I, i+1For from source node to the described intermediate node i node to the delivery rate of i+1 node, Load iBe load from source node i node to the described intermediate node;
The path of the described the route requests whether described path of judging the current route requests that receives is better than once receiving comprises:
110, described intermediate node obtains Max_Load, Min_Bw and PDR respectively from current route requests that receives and the described route requests that once received, utilizes formula W 2=γ Max_Load+ λ Min_Bw+vPDR calculates the W at current route requests that receives and the described route requests that once received respectively 2Value, wherein, γ, λ and v are weighted factor;
111, described intermediate node is judged the W at the current route requests that receives 2Whether value is greater than the W at the described route requests that once received 2Value is not if then determine the path of the described route requests that the path of the current route requests that receives is better than once receiving, otherwise the path of determining the current route requests that receives is better than the path of the described route requests that once received.
After the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: each intermediate node judges respectively whether self current resource situation allows to transmit, if, execution in step B then, otherwise, finish current flow process.
After the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: each intermediate node judges that respectively whether the queue length of self is greater than predefined length threshold, if, then finish current flow process, otherwise execution in step B.
After the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: each intermediate node is respectively according to the life cycle of carrying in the current route requests that receives, judge whether the current route requests that receives expires, if, then finish current flow process, otherwise execution in step B.
After the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: described each intermediate node is searched the route-caching of self respectively, judge whether exist in the route-caching from self arriving the path of described destination node, if there is no, then direct execution in step B, if exist, then judge in the route-caching and whether to be better than the path of carrying the current route requests that receives from the path that self arrives destination node, if, each intermediate node sends to source node with being carried in each bar route response in the route-caching after the routing information that self arrives destination node and all routing informations the current route requests that receives are integrated, otherwise, direct execution in step B.
This method further comprises: the route criterion structure that is provided for depositing path performance information in the professional perception Routing Protocol TARP packet header of described route requests;
The described step that routing information is carried in the route requests comprises: be carried at after existing routing information is integrated in routing information that this section point is collected and the current route requests that receives in the route criterion structure in the current route requests TARP packet header that receives.
Describedly at different types of service different routing decision strategies is set and comprises:, corresponding routing decision strategy is set for selecting the minimum route of node jumping figure for the speech business type; For the video traffic type, corresponding routing decision strategy is set for selecting delivery rate and all excellent route of remaining bandwidth; For the Best-Effort service type, corresponding routing decision strategy is set for selecting node load less and have a route of big remaining bandwidth and preferable delivery rate.
Described this type of service is voice;
The step of the route of described definite this professional correspondence comprises: source node is according to the minimum route of these type of service voice pairing selection node jumping figure, and the node jumping figure information of carrying respectively in each bar route response, select the route response of corresponding minimum node jumping figure, and each address of node information of carrying in will this selected route response, be defined as this professional corresponding route.
Described this type of service is a video;
The step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to this node iReceive after original Min_Bw gets minimum value in the route requests with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives this node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal
PDR = Π i = 1 i = n - 1 pd r i , i + 1 , And n is the node number from source node to described node in the path, Bw iBe the statistics remaining bandwidth of i node from source node to described node, pdr I, i+1Be the delivery rate of i node from source node to described node to i+1 node;
The step of the route of described definite this professional correspondence comprises: source node is according to this type of service video pairing selection delivery rate and all excellent route of remaining bandwidth, and least residue bandwidth information Min_BW that carries respectively in each bar route response and delivery rate information PDR, select corresponding delivery rate and all excellent route response of least residue bandwidth, and each address of node information of carrying in will this selected route response, be defined as this professional corresponding route.
The step of the route response that corresponding delivery rate of described selection and least residue bandwidth are all excellent comprises: source node obtains path least residue bandwidth information Min_Bw and path delivery rate information PDR respectively from each bar route response, utilize formula W respectively 1=aMin_Bw+ β PDR calculates the W at each bar route response respectively 1Value, wherein, α and β are weighted factor, select maximum W 1Be worth pairing route response.
Described this type of service is for doing one's best;
The step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to this node iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives this node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives, and with the information on load Load of this node iReceive after the original Max_Load that carries in the route requests gets maximum with current, use this maximum to upgrade the value of the Max_Load in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal
PDR = Π i = 1 i = n - 1 pd r i , i + 1 , Max_Load=max (Load after the renewal 1, Load 2..., Load i..., Load n), and n is the node number from source node to described node in the path, Bw iBe the statistics remaining bandwidth of i node from source node to described node, pdr I, i+1Be the delivery rate of i node from source node to described node to i+1 node, Load iLoad for i node from source node to described node;
Describedly determine that the step of this professional corresponding route comprises: source node is less and have a route of big remaining bandwidth and preferable delivery rate according to this type of service pairing selection node load of doing one's best, and the least residue bandwidth information Min_Bw that carries respectively in each bar route response, the delivery rate information PDR in peak load information Max_Load and path, select the route response that the corresponding node load is less and have big remaining bandwidth and preferable delivery rate, and each address of node information of carrying in will this selected route response, be defined as this professional corresponding route.
Less and the step that have a route response of big remaining bandwidth and preferable delivery rate of described selection corresponding node load comprises: source node obtains the delivery rate information PDR in least residue bandwidth information Min_Bw, peak load information Max_Load and path respectively from each bar route response, utilize formula W 2=γ Max_Load+ λ Min_Bw+vPDR calculates the W at each bar route response respectively 2Value, wherein, γ, λ and v are weighted factor, select maximum W 2Be worth pairing route response.
This shows that the present invention has the following advantages:
1, the present invention adopts different routing policies to determine route for different types of service, therefore, can guarantee the transmission of each type of service data between source node and the destination node, all can satisfy its QoS requirement, and make full use of Internet resources, thereby improved the performance of network greatly.
2, in the present invention, for some specific types of service, such as, video traffic type and Best-Effort service type are because when determining its route, considered internodal delivery rate, therefore, if be in the traffic hotspots district between node, promptly internodal delivery rate is less, then can make determined route avoid this hot zone, thereby satisfy the requirement of WMN Network Load Balance.
3, in the present invention, for some specific types of service, such as, the Best-Effort service type is because when determining its route, considered the peak load of node, therefore, if when the load of node is big, then can make determined route avoid this node, make the bigger node of this load can guarantee the existing proper communication that connects, thereby provide service guarantees for the accessed user.
4, in the present invention, at the routing iinformation that obtains each type of service by route requests, such as delivery rate and peak load etc., be the mutual statistics of network intrinsic information to be obtained according to each node, and need not to obtain by other operation flow or signaling, therefore, saved network bandwidth resources.
5, in the present invention, owing to adopt different routing policies to determine route for different types of service, therefore, the data that can guarantee different service types between same source node and the destination node are transmitted by different paths, promptly realize the multipath transfer of data, therefore, made the present invention have the advantage of multipath transfer of data, such as, load balancing etc.
Description of drawings
Fig. 1 is a flow chart of determining route between two nodes in the prior art.
Fig. 2 is a flow chart of determining route between two nodes in embodiments of the present invention.
Fig. 3 is that intermediate node determines whether to abandon the flow chart of the current route requests that receives in embodiments of the present invention.
Embodiment
Core concept of the present invention is: at different types of service different routing decision strategies is set; After source node receives many route responses of carrying routing information,, determine this professional corresponding route according to the routing decision strategy of this type of service correspondence.
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with drawings and the specific embodiments.
Fig. 2 is a flow chart of determining route between two nodes in embodiments of the present invention.Referring to Fig. 2, when a source node,, need to determine arrive a destination node such as source node A, during such as the route of destination node C, the present invention realizes that the process of determining this route may further comprise the steps:
Step 201: at different types of service different routing decision strategies is set in advance.
Here, in order to satisfy of the different requirements of each type of service better to QoS, then different routing decision strategies must be set at different types of service, promptly different service types is determined its transmission route according to different routing decision strategies.
Specifically, be example with type of service as shown in table 1 below,
Type of service
Voice
Video
Do one's best
Table 1
Referring to table 1, for the business datum of sound-type, for the continuity that guarantees to converse, then requirement can realize minimum propagation delay time, that is to say, when determining route, should select minimum to the destination node jumping figure from source node is the shortest route in path; For the business datum of video type,, then require to seek delivery rate and all excellent path of remaining bandwidth for the definition that guarantees image and to the requirement of the network bandwidth; For the business datum of doing one's best, owing to there is not special operation quality requirement,, thereby make full use of Internet resources so it is less and have the path of big remaining bandwidth to seek node load.Therefore, for ease of describing, can use formula as shown in table 2 below to embody the routing decision strategy of each type of service in the table 1.
Type of service The routing policy formula
Voice W 0＝Hops
Video W 1＝α·Min_Bw+β·PDR
Do one's best W 2＝γ·Max_Load+λ·Min_Bw+v·PDR
Table 2
Referring to table 2, wherein, Hops is the node jumping figure; Min_Bw show the way in the footpath minimum bandwidth of link, i.e. path available bandwidth between all nodes; PDR is the delivery rate in path; Max_Load is a node maximum load in the path; α, β, γ, λ and v are the weighted factor of each several part.Preferably, | α |+| β | value be 1, | γ |+| λ |+| the value of v| is 1.In addition, the path minimum bandwidth, the expression formula of the maximum delivery rate in path peak load and path is as follows: Max_Load=max (Load 1, Load 2..., Load i..., Load n), Min_Bw=min (Bw 1, Bw 2... Bw i..., Bw N-1), PDR = Π i = 1 i = n - 1 pd r i , i + 1 , And n is the node number that source node arrives destination node in the path, Load iBe the load of i node, Bw iBe the statistics remaining bandwidth of i node, pdr I, i+1Be the delivery rate of i node to i+1 node.
Step 202: source node A sends the route requests at destination node C by broadcast mode.
Here, can comprise in the described route requests: bag sequence number, this professional type of service, the address information of source node self and the address information of destination node etc. of the life cycle TTL of this broadcasting route requests (being generally the jumping figure restriction), this route requests.And the present invention can (Traffic Aware Routing Protocol, TARP) packet header be provided with route criterion structure, is used to deposit the performance parameter in path at the professional perception Routing Protocol of described route requests.
Step 203: after intermediate node B received route requests, the routing information of collecting according to this section point upgraded the routing information in the route criterion structure of received route requests.
Here, the specific implementation process of this step comprises: after intermediate node B receives route requests, with the remaining bandwidth information Bw of a last hop node to this node B iGet minimum value with the current original Min_Bw that carries in the route requests that receives, use the Min_Bw value in the current route requests that receives of this minimum value renewal, and will go up the delivery rate information pdr of a hop node to this node B I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives, and with the information on load Load of this node B iReceive after the original Max_Load that carries in the route requests gets maximum with current, use this maximum to upgrade the value of the Max_Load in the current route requests that receives, wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal PDR = Π i = 1 i = N - 1 pd r i , i + 1 , Max_Load=max (Load after the renewal 1, Load 2..., Load i..., Load N), and N is the node number from source node to described intermediate node B in the path, Bw iBe the statistics remaining bandwidth from source node i node to the described intermediate node B, pdr I, i+1For from source node to the described intermediate node B i node to the delivery rate of i+1 node, Load iBe load from source node i node to the described intermediate node B;
Then, the address information of the value of the value of the Min_Bw value after upgrading, PDR, Max_Load and this node B is carried in the route criterion structure in the received route requests.
Step 204: intermediate node B receives route requests, judges whether to abandon the current route requests that receives, if, then finish current flow process, otherwise, execution in step 205.
Here, the specific implementation process of this step can may further comprise the steps referring to Fig. 3:
Step 301: described intermediate node B is according to source address information and destination address information in the current route requests that receives, judge self whether to receive once that described source node A sent to the route requests of described destination node C, if, then execution in step 302, otherwise, not think to abandon the current route requests that receives, directly execution in step 205.
Step 302: the magnitude relationship of the bag sequence number of the described route requests that intermediate node B judgement was once received and the bag sequence number of the current route requests of receiving, if the bag sequence number of the described route requests of once receiving is greater than the bag sequence number of the current route requests of receiving, then determine to abandon the current route requests that receives, finish current flow process, if the bag sequence number of the described route requests of once receiving is less than the bag sequence number of the current route requests of receiving, then execution in step 303, if the bag sequence number of the described route requests of once receiving equals the bag sequence number of the current route requests of receiving, then execution in step 304.
Here, if the bag sequence number of the described route requests of once receiving is greater than the bag sequence number of the current route requests of receiving, illustrate that then the current route requests that receives is out-of-date route requests, be not the route requests of source node A for determining that this professional route is sent, so should not take the process of follow-up definite route, promptly abandon the current route requests that receives, finish current flow process.
If the bag sequence number of the described route requests of once receiving is less than the bag sequence number of the current route requests of receiving, source node A the route requests for determine this professional route send of the current route requests that receives for receiving first then is described, so should directly carry out the process of follow-up definite route.
If the bag sequence number of the described route requests of once receiving equals the bag sequence number of the current route requests of receiving, then received by a kind of route before the explanation from source node A to this node B, such as route ADB, the route requests of sending for definite this professional route, receive again by another kind of route current from source node A to this node B, such as route AEB, the route requests of sending for definite this professional route, therefore, in order to realize the present invention is directed to the purpose that the optimum route of its performance index requirements is satisfied in the different service types selection, then must carry out and follow-up determine the process of optimum route according to this type of service, promptly execution in step 304.
Step 303: intermediate node B uses the bag sequence number of the current route requests that receives to upgrade the bag sequence number of the route requests from source node A to destination node C of self preserving, directly execution in step 205.
Step 304: intermediate node B judges the path of the described the route requests whether path of the current route requests that receives is better than once receiving, if, then direct execution in step 205, otherwise, determine to abandon the current route requests that receives, finish current flow process.
Here, described judgement specifically comprises: intermediate node B is according to this professional type of service of carrying in the current route requests that receives, and the different routing decision strategies of the different service types that sets in advance, determine the routing decision strategy of this type of service correspondence; Intermediate node B is according to the routing decision strategy of determined this type of service correspondence, and the routing information that carries respectively in the route criterion structure in current route requests that receives and the described route requests that once received, judges.
Referring to table 1 and table 2, such as, this professional type of service is the speech business type, is W corresponding to the formula of speech business type 0=Hops, its routing policy is for selecting W 0The shortest path of value minimum, the i.e. minimum path of node jumping figure of process, therefore, in this step, intermediate node B is according to the node jumping figure information in current route requests that receives and the described route requests that once received, determine the time from source node A to this node B, current route requests that receives and the described route requests that once received be the node jumping figure of process respectively, if the node jumping figure of the current route requests process that receives is less than the described route requests that once received, then think the routing information that carries in the described route requests that the routing information that carries in the current route requests that receives is better than once receiving.
For another example, this professional type of service is the video traffic type, is W corresponding to the formula of video traffic type 1=α Min_Bw+ β PDR, its routing policy is for selecting W 1The path that value is maximum, the path that i.e. selection can be satisfied smallest link bandwidth and maximum delivery rate best, therefore, in this step, intermediate node B utilizes formula W according to Min_Bw value after upgrading in the route criterion structure in current route requests that receives and the described route requests that once received and the value of PDR 1=α Min_Bw+ β PDR calculates respectively from source node A to this node B the time, current route requests that receives and the pairing W of described route requests that once received 1Value.If the W of the current route requests correspondence that receives 1Value is greater than the described route requests that once received, and then thinks the routing information that carries in the described route requests that the routing information that carries in the current route requests that receives is better than once receiving.
And for example, this professional type of service is for doing one's best, and is W corresponding to the formula of Best-Effort service type 2=γ Max_Load+ λ Min_Bw+vPDR, therefore, in this step, intermediate node B utilizes W according to Min_Bw value, the value of PDR and the value of Max_Load after upgrading in the route criterion structure in current route requests that receives and the described route requests that once received 2=γ Max_Load+ λ Min_Bw+vPDR calculates respectively from source node A to this node B the time, current route requests that receives and the pairing W of described route requests that once received 2Value.If the W of the current route requests correspondence that receives 2Value is greater than the described route requests that once received, and then thinks the routing information that carries in the described route requests that the routing information that carries in the current route requests that receives is better than once receiving.
So far, then realized judging whether to abandon the process of the current route requests that receives.
Step 205: intermediate node B judges whether self current resource situation allows to transmit, if then execution in step 206, otherwise, finish current flow process.
Here, described resource situation can comprise: remaining bandwidth and upstream node arrive the delivery rate of this node etc.
Step 206: whether intermediate node B judges the queue length of self greater than predefined length threshold, if, then finish current flow process, otherwise, execution in step 207.
Step 207: intermediate node B judges according to the life cycle TTL in the current route requests that receives whether the current route requests that receives expires, if, then finish current flow process, otherwise, execution in step 208.
Between above-mentioned steps 205, step 206 and the step 207 and the sequencing in the unfixed execution, just for convenience of description and the different step that splits.
In addition, the process of above-mentioned steps 205, step 206 and step 207 has limited and has transmitted the quantity of route requests, thereby has reduced the protocol overhead of network.
Step 208: intermediate node B searches the route-caching of self, judges whether to have the path that arrives destination node C from self in the route-caching, if then execution in step 209, otherwise, execution in step 211.
Step 209: intermediate node B judges in the route-caching from the routing information that self arrives destination node C whether be better than the routing information that carries the current route requests that receives, if then execution in step 210, otherwise, direct execution in step 211.
Here, the principle of the process of described judgement and the described process of step 304 is identical.
Step 210: intermediate node B utilizes all routing informations in the current route requests route criterion structure to upgrade the route-caching of self, be sent to source node A in the route response with being carried at from the routing information that self arrives destination node C and the routing information the current route requests route criterion structure that receives in the route-caching then, directly execution in step 214.
Step 211: intermediate node B utilizes all routing informations in the current route requests route criterion structure to upgrade the route-caching of self, then current route requests is sent to destination node C.
Need to prove, because in step 201, source node A sends route requests by broadcast mode, so route requests can be transmitted by mulitpath, on each paths, the processing procedure of each intermediate node is as the processing procedure of above-mentioned intermediate node B.Accordingly, the received route requests of destination node is many route requests of being sent by the intermediate node on the different paths of carrying different routing informations.
When step 212: destination node C receives each bar route requests, all the routing information of this node is carried in the route criterion structure in this route requests.
Here, the specific implementation process of this step comprises: will go up the remaining bandwidth information Bw of a hop node to this node C iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives this node C I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives, and with the information on load Load of this node C iReceive after the original Max_Load that carries in the route requests gets maximum with current, use this maximum to upgrade the value of the Max_Load in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal
PDR = Π i = 1 i = n - 1 pd r i , i + 1 , Max_Load=max (Load after the renewal 1, Load 2..., Load i..., Load n), and n is the node number from source node A to described destination node C in the path, Bw iBe the statistics remaining bandwidth of i node from source node A to described destination node C, pdr I, i+1Be the delivery rate of i node from source node A to described destination node C to i+1 node, Load iLoad for i node from source node A to described destination node C;
Then, the address information of the value of the value of the Min_Bw value of destination node C after with current renewal, PDR, Max_Load and this node C is carried in the route criterion structure in the received route requests.
When step 213: destination node C receives each bar route requests, all routing informations in the route criterion structure in this route requests are carried in the route response and are sent to source node A.
When here, destination node C is sent to source node A with route response the path of process opposite with the path of its corresponding route requests process that receives.And, route response is being sent in the process of source node A, when each intermediate node receives route response, can also further from this route response, obtain relevant routing information, and be saved in the route-caching of self.
Step 214: after source node A receives each bar route response,, determine optimum route corresponding to this type of service according to all routing informations that carry in each bar route response.
Here, owing to all carried all routing informations of its corresponding route requests process in each bar route response, comprising: the value of the Min_Bw value after the renewal, the value of PDR, Max_Load and each address of node information etc.Therefore, the specific implementation process of this step comprises: source node A determines the routing decision strategy of this type of service correspondence according to the different routing decision strategies of the different service types that sets in advance; Source node A is according to the routing decision strategy of determined this type of service correspondence, and the routing information that carries respectively in each bar route response, judges.
Referring to table 1 and table 2, such as, this professional type of service is the speech business type, is W corresponding to the formula of speech business type 0=Hops, its routing policy is for selecting W 0The shortest path of value minimum, the i.e. minimum path of node jumping figure of process, therefore, in this step, source node A is according to the routing information that carries respectively in each bar route response, determine the node jumping figure of each bar route response process, the route of the route response correspondence that the node jumping figure is minimum is defined as the optimum route of this speech business.
For another example, this professional type of service is the video traffic type, is W corresponding to the formula of video traffic type 1=aMin_Bw+ β PDR, its routing policy is for selecting W 1The path that value is maximum, i.e. the path that selection can be satisfied smallest link bandwidth and maximum delivery rate best, therefore, in this step, for each bar route response, obtain current Min_Bw value and the value of PDR in the routing information that source node A carries from this route response, and by calculating formula W j=α Min_Bw+ β PDR calculates the W corresponding to this route response 1Value, then, the W of each bar route response correspondence relatively 1The size of value is with W 1The route that is worth maximum route response correspondence is defined as the optimum route of this speech business.
For another example, this professional type of service is the Best-Effort service type, is W corresponding to the formula of Best-Effort service type 2γ Max_Load+ λ Min_Bw+vPDR, its routing policy is for selecting W 2The path that value is maximum, the path that i.e. selection can be satisfied smallest link bandwidth, maximum delivery rate and maximum load best, therefore, in this step, for each bar route response, obtain the value of current Min_Bw value, PDR and the value of Max_Load in the routing information that source node A carries from this route response, and by calculating formula W 2=γ Max_Load+ λ Min_Bw+vPDR calculates the W corresponding to this route response 2Value, then, the W of each bar route response correspondence relatively 2The size of value is with W 2The route that is worth maximum route response correspondence is defined as the optimum route of this speech business.
Step 215: source node A is sent to destination node C by determined optimum route with this business datum.
Need to prove, better be coupled that the present invention can be that link layer is realized at two layers in order to realize routing plan and link layer.Like this, two layers of routing plan of the present invention then can fully use the link layer state parameter, such as network performance parameters such as remaining bandwidth, delivery rate and network load required when the optimum route of determining corresponding to a kind of type of service, make the Routing Protocol of correspondence of the present invention responsive more, thereby make that also the present invention is easy to realize more network state.
In a word, the above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (19)

1, a kind of method of determining route in based on wireless mesh network is characterized in that this method comprises: at different types of service different routing decision strategies is set; After source node receives many route responses of carrying routing information,, determine this professional corresponding route according to the routing information that carries in the routing decision strategy of this type of service correspondence and each bar route response.
2, method according to claim 1 is characterized in that, before source node receives many route responses of carrying routing information, further comprises:
After A, each intermediate node received the route requests of source node by the broadcast mode transmission, the routing information of collecting according to this section point upgraded the routing information in the route requests respectively;
B, each intermediate node are sent to destination node with current route requests respectively;
After C, destination node received each bar route requests, the routing information of collecting according to this section point upgraded the routing information in the route requests respectively, the routing information that carries in each bar route requests is carried at respectively in each bar route response sends to source node then.
3, method according to claim 2, it is characterized in that, further comprise between steps A and step B: each intermediate node judges whether once to receive the route requests that described source node sends to described destination node, if, judge then whether the bag sequence number of the described route requests that once received equals the bag sequence number of the current route requests that receives, if, then judge the path of the described the route requests whether path of the current route requests that receives is better than once receiving, if be better than, execution in step B then, if be not better than, then finish current flow process.
4, method according to claim 3 is characterized in that, described this type of service is voice;
The path of the described the route requests whether described path of judging the current route requests that receives is better than once receiving comprises: judge whether the node jumping figure from source node to described intermediate node is less than the node jumping figure from source node to described intermediate node the described route requests that once received in the current route requests that receives, if, then determine the path of the described route requests that the path of the current route requests that receives is better than once receiving, otherwise the path of determining the current route requests that receives is not better than the path of the described route requests that once received.
5, method according to claim 3 is characterized in that, described this type of service is a video;
In steps A, the step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to described intermediate node iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives described intermediate node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal PDR = Π i = 1 i = N - 1 pdr i , i + 1 , And N is the node number from source node to described intermediate node in the path, Bw iBe the statistics remaining bandwidth from source node i node to the described intermediate node, pdr I, i+1For from source node to the described intermediate node i node to the delivery rate of i+1 node;
The path of the described the route requests whether described path of judging the current route requests that receives is better than once receiving comprises:
100, described intermediate node obtains the value of Min_Bw and the value of PDR respectively from current route requests that receives and the described route requests that once received, utilizes formula W respectively 1=α Min_Bw+ β PDR calculates the W at current route requests that receives and the described route requests that once received 1Value, wherein, α and β are weighted factor;
101, described intermediate node is judged the W at the current route requests that receives 1Whether value is greater than the W of the described route requests that once received 1Value is not if then determine the path of the described route requests that the path of the current route requests that receives is better than once receiving, otherwise the path of determining the current route requests that receives is better than the path of the described route requests that once received.
6, method according to claim 3 is characterized in that, described this type of service is for doing one's best;
In steps A, the step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to described intermediate node iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives described intermediate node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives, and with the information on load Load of described intermediate node iReceive after the original Max_Load that carries in the route requests gets maximum with current, use this maximum to upgrade the value of the Max_Load in the current route requests that receives, wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal PDR = Π i = 1 i = N - 1 pdr i , i + 1 , Max_Load=max (Load after the renewal 1, Load 2..., Load i..., Load N), and N is the node number from source node to described intermediate node in the path, Bw iBe the statistics remaining bandwidth from source node i node to the described intermediate node, pdr I, i+1For from source node to the described intermediate node i node to the delivery rate of i+1 node, Load iBe load from source node i node to the described intermediate node;
The path of the described the route requests whether described path of judging the current route requests that receives is better than once receiving comprises:
110, described intermediate node obtains Max_Load, Min_Bw and PDR respectively from current route requests that receives and the described route requests that once received, utilizes formula W 2=γ Max_Load+ λ Min_Bw+ ν PDR calculates the W at current route requests that receives and the described route requests that once received respectively 2Value, wherein, γ, λ and ν are weighted factor;
111, described intermediate node is judged the W at the current route requests that receives 2Whether value is greater than the W at the described route requests that once received 2Value is not if then determine the path of the described route requests that the path of the current route requests that receives is better than once receiving, otherwise the path of determining the current route requests that receives is better than the path of the described route requests that once received.
7, method according to claim 3, it is characterized in that, after the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: each intermediate node judges respectively whether self current resource situation allows to transmit, if, execution in step B then, otherwise, finish current flow process.
8, method according to claim 3, it is characterized in that, after the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: each intermediate node judges that respectively whether the queue length of self is greater than predefined length threshold, if, then finish current flow process, otherwise execution in step B.
9, method according to claim 3, it is characterized in that, after the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: each intermediate node judges respectively according to the life cycle of carrying in the current route requests that receives whether the current route requests that receives expires, if, then finish current flow process, otherwise execution in step B.
10, method according to claim 3, it is characterized in that, after the path of the described route requests that is better than once receiving in the path that described each intermediate node is judged the current route requests that receives, and before execution in step B, further comprise: described each intermediate node is searched the route-caching of self respectively, judge whether exist in the route-caching from self arriving the path of described destination node, if there is no, then direct execution in step B, if exist, then judge in the route-caching and whether to be better than the path of carrying the current route requests that receives from the path that self arrives destination node, if, each intermediate node sends to source node with being carried in each bar route response in the route-caching after the routing information that self arrives destination node and all routing informations the current route requests that receives are integrated, otherwise, direct execution in step B.
11, method according to claim 2 is characterized in that, this method further comprises: the route criterion structure that is provided for depositing path performance information in the professional perception Routing Protocol TARP packet header of described route requests;
The described step that routing information is carried in the route requests comprises: be carried at after existing routing information is integrated in routing information that this section point is collected and the current route requests that receives in the route criterion structure in the current route requests TARP packet header that receives.
12, according to any described method in the claim 2 to 11, it is characterized in that, describedly at different types of service different routing decision strategies is set and comprises:, corresponding routing decision strategy is set for selecting the minimum route of node jumping figure for the speech business type; For the video traffic type, corresponding routing decision strategy is set for selecting delivery rate and all excellent route of remaining bandwidth; For the Best-Effort service type, corresponding routing decision strategy is set for selecting node load less and have a route of big remaining bandwidth and preferable delivery rate.
13, method according to claim 12 is characterized in that, described this type of service is voice;
The step of the route of described definite this professional correspondence comprises: source node is according to the minimum route of these type of service voice pairing selection node jumping figure, and the node jumping figure information of carrying respectively in each bar route response, select the route response of corresponding minimum node jumping figure, and each address of node information of carrying in will this selected route response, be defined as this professional corresponding route.
14, method according to claim 12 is characterized in that, described this type of service is a video;
The step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to this node iReceive after original Min_Bw gets minimum value in the route requests with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives this node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal PDR = Π i = 1 i = n - 1 pdr i , i + 1 , And n is the node number from source node to described node in the path, Bw iBe the statistics remaining bandwidth of i node from source node to described node, pdr I, i+1Be the delivery rate of i node from source node to described node to i+1 node;
The step of the route of described definite this professional correspondence comprises: source node is according to this type of service video pairing selection delivery rate and all excellent route of remaining bandwidth, and least residue bandwidth information Min_BW that carries respectively in each bar route response and delivery rate information PDR, select corresponding delivery rate and all excellent route response of least residue bandwidth, and each address of node information of carrying in will this selected route response, be defined as this professional corresponding route.
15, method according to claim 14, it is characterized in that, the step of the route response that corresponding delivery rate of described selection and least residue bandwidth are all excellent comprises: source node obtains path least residue bandwidth information Min_Bw and path delivery rate information PDR respectively from each bar route response, utilize formula W respectively 1=α Min_Bw+ β PDR calculates the W at each bar route response respectively 1Value, wherein, α and β are weighted factor, select maximum W 1Be worth pairing route response.
16, method according to claim 12 is characterized in that, described this type of service is for doing one's best;
The step that the described routing information of collecting according to this section point upgrades the routing information in the route requests comprises: will go up the remaining bandwidth information Bw of a hop node to this node iReceive after the original Min_Bw that carries in the route requests gets minimum value with current, use this minimum value to upgrade Min_Bw value in the current route requests that receives, and will go up the delivery rate information pdr that a hop node arrives this node I, i+1Receive after the original PDR that carries in the route requests multiplies each other with current, use the back gained result that multiplies each other to upgrade the value of the PDR in the current route requests that receives, and with the information on load Load of this node iReceive after the original Max_Load that carries in the route requests gets maximum with current, use this maximum to upgrade the value of the Max_Load in the current route requests that receives,
Wherein, the Min_Bw=min (Bw after the renewal 1, Bw 2... Bw i... Bw N-1), after the renewal PDR = Π i = 1 i = n - 1 pdr i , i + 1 , Max_Load=max (Load after the renewal 1, Load 2..., Load i..., Load n), and n is the node number from source node to described node in the path, Bw iBe the statistics remaining bandwidth of i node from source node to described node, pdr I, i+1Be the delivery rate of i node from source node to described node to i+1 node, Load iLoad for i node from source node to described node;
Describedly determine that the step of this professional corresponding route comprises: source node is less and have a route of big remaining bandwidth and preferable delivery rate according to this type of service pairing selection node load of doing one's best, and the least residue bandwidth information Min_Bw that carries respectively in each bar route response, the delivery rate information PDR in peak load information Max_Load and path, select the route response that the corresponding node load is less and have big remaining bandwidth and preferable delivery rate, and each address of node information of carrying in will this selected route response, be defined as this professional corresponding route.
17, method according to claim 16, it is characterized in that, less and the step that have a route response of big remaining bandwidth and preferable delivery rate of described selection corresponding node load comprises: source node obtains the delivery rate information PDR in least residue bandwidth information Min_Bw, peak load information Max_Load and path respectively from each bar route response, utilize formula W 2=γ Max_Load+ λ Min_Bw+ ν PDR calculates the W at each bar route response respectively 2Value, wherein, γ, λ and ν are weighted factor, select maximum W 2Be worth pairing route response.
CNA2006100900354A 2006-06-22 2006-06-22 Method for deciding route at radio mesh network Pending CN101048012A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2006100900354A CN101048012A (en) 2006-06-22 2006-06-22 Method for deciding route at radio mesh network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2006100900354A CN101048012A (en) 2006-06-22 2006-06-22 Method for deciding route at radio mesh network

Publications (1)

Publication Number Publication Date
CN101048012A true CN101048012A (en) 2007-10-03

Family

ID=38772122

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2006100900354A Pending CN101048012A (en) 2006-06-22 2006-06-22 Method for deciding route at radio mesh network

Country Status (1)

Country Link
CN (1) CN101048012A (en)

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101483674A (en) * 2009-02-12 2009-07-15 迈普（四川）通信技术有限公司 Data cross-domain searching method
CN101867995A (en) * 2010-06-24 2010-10-20 四川平安都市通讯科技有限公司 Wireless netlike network routing method
CN101217497B (en) * 2008-01-18 2011-04-13 北京邮电大学 A path selecting method of wireless mesh network
CN102571856A (en) * 2010-12-17 2012-07-11 中国移动通信集团公司 Method, device and system for selecting transition node
CN101754427B (en) * 2008-12-18 2012-11-21 华为技术有限公司 Message transmission method, device and system in wireless mesh network
CN102907136A (en) * 2010-05-21 2013-01-30 日本电气株式会社 Wireless communication network system
CN103200641A (en) * 2013-03-29 2013-07-10 南京邮电大学 Routing method of multi-radiofrequency multi-channel wireless mesh network
CN103401802A (en) * 2013-08-26 2013-11-20 盛科网络（苏州）有限公司 Transmission protocol based message load balancing method and device
CN103476083A (en) * 2012-06-06 2013-12-25 华为技术有限公司 Route selection method and node equipment
CN103685054A (en) * 2013-12-18 2014-03-26 武汉烽火网络有限责任公司 Multipath load balancing method based on service awareness
CN103874159A (en) * 2014-03-26 2014-06-18 江苏博悦物联网技术有限公司 Wireless sensor network
CN104618232A (en) * 2015-01-28 2015-05-13 杭州华三通信技术有限公司 Wide area network link selecting method and wide area network link selecting device
WO2015085862A1 (en) * 2013-12-13 2015-06-18 乐视致新电子科技（天津）有限公司 Method and apparatus for playing 3d film sources in smart tv
CN106131619A (en) * 2016-07-28 2016-11-16 王晓光 Method of reseptance and the system of video ads is adjusted according to path jumping figure
CN106302215A (en) * 2016-08-30 2017-01-04 华为技术有限公司 A kind of method and device E-Packeted
CN106304168A (en) * 2016-10-16 2017-01-04 高道华 A kind of method for optimizing route of wireless mesh network
CN107171955A (en) * 2017-05-24 2017-09-15 深圳市乃斯网络科技有限公司 The system of selection of data link and system in network
CN104618232B (en) * 2015-01-28 2018-02-09 新华三技术有限公司 Wan business link selecting method and device
CN107733796A (en) * 2017-02-07 2018-02-23 深圳臻云技术股份有限公司 A kind of preferentially path calculation method and system
WO2018214059A1 (en) * 2017-05-24 2018-11-29 深圳市乃斯网络科技有限公司 Method and system for selecting data link in network
CN109413712A (en) * 2019-01-11 2019-03-01 湖南大学 Quick route constructing method based on DSR agreement
WO2019196939A1 (en) * 2018-04-13 2019-10-17 华为技术有限公司 Method and apparatus for service transmission
WO2020103654A1 (en) * 2018-11-23 2020-05-28 腾讯科技（深圳）有限公司 Route selection policy acquisition method and apparatus, route selection policy rule execution method and apparatus, and device and computer-readable storage medium
CN111510384A (en) * 2019-01-31 2020-08-07 伊姆西Ip控股有限责任公司 Method, electronic device and computer-readable medium for processing data generated by a service
CN112423253A (en) * 2020-10-13 2021-02-26 北京云联慧通科技有限公司 Narrow-band ad hoc network communication protocol applied to wireless electronic thermometer
CN113727409A (en) * 2021-08-26 2021-11-30 北京珞安科技有限责任公司 Message transmission method, node and LORA ad hoc network

Cited By (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101217497B (en) * 2008-01-18 2011-04-13 北京邮电大学 A path selecting method of wireless mesh network
CN101754427B (en) * 2008-12-18 2012-11-21 华为技术有限公司 Message transmission method, device and system in wireless mesh network
CN101483674A (en) * 2009-02-12 2009-07-15 迈普（四川）通信技术有限公司 Data cross-domain searching method
CN101483674B (en) * 2009-02-12 2013-01-09 迈普通信技术股份有限公司 Data cross-domain searching method
US8923332B2 (en) 2010-05-21 2014-12-30 Nec Corporation Wireless communication network system
CN102907136A (en) * 2010-05-21 2013-01-30 日本电气株式会社 Wireless communication network system
CN102907136B (en) * 2010-05-21 2015-08-19 日本电气株式会社 Wireless communication network system
CN101867995A (en) * 2010-06-24 2010-10-20 四川平安都市通讯科技有限公司 Wireless netlike network routing method
CN102571856A (en) * 2010-12-17 2012-07-11 中国移动通信集团公司 Method, device and system for selecting transition node
CN103476083A (en) * 2012-06-06 2013-12-25 华为技术有限公司 Route selection method and node equipment
CN103476083B (en) * 2012-06-06 2016-11-02 华为技术有限公司 Route selection method and node device
CN103200641A (en) * 2013-03-29 2013-07-10 南京邮电大学 Routing method of multi-radiofrequency multi-channel wireless mesh network
CN103200641B (en) * 2013-03-29 2015-08-05 南京邮电大学 Many radio frequencies multi-Channel Wireless Mesh Network route selection method
CN103401802A (en) * 2013-08-26 2013-11-20 盛科网络（苏州）有限公司 Transmission protocol based message load balancing method and device
WO2015085862A1 (en) * 2013-12-13 2015-06-18 乐视致新电子科技（天津）有限公司 Method and apparatus for playing 3d film sources in smart tv
CN103685054A (en) * 2013-12-18 2014-03-26 武汉烽火网络有限责任公司 Multipath load balancing method based on service awareness
CN103685054B (en) * 2013-12-18 2017-02-01 武汉烽火网络有限责任公司 Multipath load balancing method based on service awareness
CN103874159A (en) * 2014-03-26 2014-06-18 江苏博悦物联网技术有限公司 Wireless sensor network
CN104618232B (en) * 2015-01-28 2018-02-09 新华三技术有限公司 Wan business link selecting method and device
CN104618232A (en) * 2015-01-28 2015-05-13 杭州华三通信技术有限公司 Wide area network link selecting method and wide area network link selecting device
CN106131619A (en) * 2016-07-28 2016-11-16 王晓光 Method of reseptance and the system of video ads is adjusted according to path jumping figure
CN106302215A (en) * 2016-08-30 2017-01-04 华为技术有限公司 A kind of method and device E-Packeted
CN106304168A (en) * 2016-10-16 2017-01-04 高道华 A kind of method for optimizing route of wireless mesh network
CN107733796A (en) * 2017-02-07 2018-02-23 深圳臻云技术股份有限公司 A kind of preferentially path calculation method and system
CN107733796B (en) * 2017-02-07 2021-01-26 深圳臻云技术股份有限公司 Method and system for calculating preferred path
CN107171955A (en) * 2017-05-24 2017-09-15 深圳市乃斯网络科技有限公司 The system of selection of data link and system in network
WO2018214059A1 (en) * 2017-05-24 2018-11-29 深圳市乃斯网络科技有限公司 Method and system for selecting data link in network
WO2019196939A1 (en) * 2018-04-13 2019-10-17 华为技术有限公司 Method and apparatus for service transmission
WO2020103654A1 (en) * 2018-11-23 2020-05-28 腾讯科技（深圳）有限公司 Route selection policy acquisition method and apparatus, route selection policy rule execution method and apparatus, and device and computer-readable storage medium
US11469994B2 (en) 2018-11-23 2022-10-11 Tencent Technologv (Shenzhen) Company Limited Method for obtaining route selection policy, method for performing route selection policy rule, apparatus, device, and computer-readable storage medium
CN109413712A (en) * 2019-01-11 2019-03-01 湖南大学 Quick route constructing method based on DSR agreement
CN111510384A (en) * 2019-01-31 2020-08-07 伊姆西Ip控股有限责任公司 Method, electronic device and computer-readable medium for processing data generated by a service
CN111510384B (en) * 2019-01-31 2023-03-10 伊姆西Ip控股有限责任公司 Method, electronic device and computer-readable medium for processing data generated by a service
CN112423253A (en) * 2020-10-13 2021-02-26 北京云联慧通科技有限公司 Narrow-band ad hoc network communication protocol applied to wireless electronic thermometer
CN113727409A (en) * 2021-08-26 2021-11-30 北京珞安科技有限责任公司 Message transmission method, node and LORA ad hoc network

Similar Documents

Publication Publication Date Title
CN101048012A (en) Method for deciding route at radio mesh network
CN1171420C (en) Method and system for communication of data via optimum data path in network
CN1185835C (en) Network system and network constituting method
CN1905748A (en) Method of identifying a radio link
CN1592483A (en) Packet-priority control apparatus and method thereof
CN1929688A (en) Method of setting a network path and wireless station
CN1585366A (en) Wireless base station, network system, communication method, and base station control program
CN1859445A (en) Mobile terminal IP address distributing method
CN101064899A (en) Method for measuring adjacent cell and user terminal
CN1859791A (en) Method and system for realizing switching in radio communication network and its base station
CN101076176A (en) Method for allocating user apparatus service resource in mobile telecommunication system
CN1618248A (en) Station apparatus, method for resource allocation in station apparatus and mobile communication system
CN1503474A (en) Wireless insertion network system, method, and control equipment
CN101047586A (en) Service QoS ensuring method and device for radio mesh network
CN1700668A (en) Process for generating and updating a hierarchical tree in a manet multicast routing protocol ad hoc network
CN1518302A (en) Communication system, communication method and terminal
CN1595912A (en) Communication system, communication terminal, routing control method, and router
CN1805558A (en) Multi-carrier EV-DO reverse link management method and access terminal
CN101051986A (en) Method and device for realizing quick switch
CN1852256A (en) Method and system for data transmission in wireless net-like network
CN1905746A (en) Band width distributing method, system and wireless network controller
CN1802013A (en) Method and apparatus for realizing network service provider discovery
CN101032125A (en) Network array, forwarder device and method of operating a forwarder device
CN1180639C (en) Radio channel configuration selecting method in multicast service
CN1756228A (en) User apparatus and method for carrying out resource scheduling in wireless network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20071003