CN106685836B - HWMP on-demand routing broadcast packet suppression method - Google Patents
HWMP on-demand routing broadcast packet suppression method Download PDFInfo
- Publication number
- CN106685836B CN106685836B CN201710177937.XA CN201710177937A CN106685836B CN 106685836 B CN106685836 B CN 106685836B CN 201710177937 A CN201710177937 A CN 201710177937A CN 106685836 B CN106685836 B CN 106685836B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- cost value
- rann
- path cost
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 230000001629 suppression Effects 0.000 title claims description 7
- 238000004364 calculation method Methods 0.000 claims description 4
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 238000009792 diffusion process Methods 0.000 abstract description 3
- 230000002401 inhibitory effect Effects 0.000 abstract description 3
- 230000005540 biological transmission Effects 0.000 description 4
- 239000000284 extract Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- ODCKICSDIPVTRM-UHFFFAOYSA-N [4-[2-hydroxy-3-(propan-2-ylazaniumyl)propoxy]naphthalen-1-yl] sulfate Chemical compound C1=CC=C2C(OCC(O)CNC(C)C)=CC=C(OS(O)(=O)=O)C2=C1 ODCKICSDIPVTRM-UHFFFAOYSA-N 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for inhibiting HWMP on-demand routing broadcast packets, which comprises a priori routing tree establishing process and an optimal path searching process from a source node to a destination node, wherein the optimal path searching process comprises the following steps: the process of establishing the prior-type routing tree is to establish a prior-type optimal path tree from a root node to other nodes before data service occurs, and the process of searching the optimal path from a source node to a destination node is to find the optimal path from the source node to the destination node. The invention fully utilizes the prior optimal path tree generated in the prior routing tree establishment process, and the diffusion of the broadcast packet is limited in the range smaller than the path cost value of the prior path in the process of searching the optimal path between the source node and the destination node, thereby greatly reducing the cost in the process of searching the optimal path and improving the searching efficiency.
Description
Technical Field
The invention relates to the field of wireless network communication, in particular to a method for suppressing a HWMP on-demand routing broadcast packet.
Background
Because the basic characteristic of the wireless self-organizing network topology is multi-hop transmission, the wireless routing technology is one of the key technologies in the wireless self-organizing network, and is the guarantee for realizing whether the data packet transmission in the network can be carried out smoothly. The task of a routing protocol is to give an optimal path from a source node to a destination node. The selection process of a route needs to be efficient and reliable with minimal overhead.
HWMP is a wireless Mesh network default unicast routing protocol proposed in IEEE 802.11s standard, proposing a hybrid routing model. Firstly, a node in a network generates an optimal path tree according to a prior routing protocol, when a service occurs, a data frame can be forwarded through the path tree firstly, then the node initiates an on-demand routing mode to generate an optimal path from a source node to a destination node, and after the path is generated, a subsequent data packet is forwarded according to the optimal path, so that the problem of high delay caused by on-demand routing can be solved. However, this routing scheme has a problem: in the optimal path algorithm initiated in the on-demand routing mode, the PREQ message does not utilize the existing path tree information, and still needs to be broadcasted in the whole Mesh network, which increases the network overhead, and when the node topology change in the network is accelerated, the routing update and convergence are subject to severe examination.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to provide a HWMP on-demand routing broadcast packet suppression method capable of limiting the diffusion of broadcast packets within a limited range.
The technical scheme is as follows: the method for inhibiting the HWMP on-demand routing broadcast packet comprises a priori routing tree establishing process and an optimal path searching process from a source node to a destination node, wherein:
the process of establishing the prior-checking type routing tree comprises the following steps: establishing a prior optimal path tree from a root node to other nodes before a data service occurs;
the optimal path searching process from the source node to the destination node comprises the following steps: firstly, a root node calculates a default path cost value, wherein the default path cost value is the sum of a priori path cost value from a source node to the root node and a priori path cost value from the root node to a destination node, and then the root node informs the source node of the default path cost value through an RANN broadcast message; then the source node searches a target node by sending a broadcast message PREQ, other nodes selectively forward the broadcast message PREQ, the path cost value between the source node and the target node is compared with the default path cost value, if the path cost value between the source node and the target node is smaller than the default path cost value, the source node is judged to find the path established by the target node as the optimal path by sending the broadcast message PREQ, otherwise, the prior path between the source node and the target node is judged as the optimal path.
Further, the process of searching the optimal path from the source node to the destination node comprises the following steps:
s1: when a source node needs to send data, firstly, carrying out route query, and if finding that the route to a destination node does not exist, sending a data packet to be sent to a root node through an established prior type path;
s2: after receiving the data packet, the root node extracts the path cost value from the root node to the destination node, adds the path cost value from the root node to the destination node and the path cost value from the root node to the source node to obtain a default path cost value, and then encapsulates and broadcasts the RANN message;
s3: after receiving the RANN message, other nodes judge whether the default path cost value is not 0: if not, judging whether the default path cost value belongs to the node, if so, judging that the node is a source node and sending a broadcast message PREQ in an on-demand routing RM-AODV mode, then continuously broadcasting the RANN message, and if not, continuously broadcasting the RANN message; if not, continuing to broadcast the RANN message;
s4: when other nodes receive the broadcast message PREQ, the path cost value between the node and a father node from which the broadcast message PREQ comes is subtracted from the default path cost value in the broadcast message PREQ, the calculation result is used as an update value of the default path cost value, and then whether the update value of the default path cost value is larger than 0 is judged: if so, go to step S5; otherwise, discarding the broadcast message PREQ, and not forwarding again, and then performing step S6;
s5: judging whether the node is a destination node: if yes, replying a routing response message PREP to the source node, establishing a reverse route from the node to the source node, and then performing step S6; otherwise, continuing to forward the broadcast message PREQ, and then returning to step S4;
s6: judging whether the source node receives a routing response message PREP within a preset time: if the source node receives the routing response message PREP within the preset time, taking the path between the source node and the destination node established in the optimal path searching process as the optimal path between the source node and the destination node; otherwise, the prior path is used as the optimal path between the source node and the destination node.
Further, in step S3, after receiving the RANN message, the other nodes also return the routing return message PREP to the root node, and after receiving the routing return message PREP, the root node learns the path to the other nodes through the information in the routing return message PREP.
Further, the path cost value between the source node and the destination node and the default path cost value are determined by the following method:
s1.1: judging whether the hop count of the path from the source node to the destination node is the same as the hop count of the prior path: if the paths are different, judging that the paths with less hops have smaller path cost values; otherwise, continuing to perform the step S2.1;
s2.1: judging whether the channel quality of a path from a source node to a destination node is the same as the channel quality of a prior path: if the channel quality is different, judging that the path with good channel quality has smaller path cost value; otherwise, continuing to step S3.1;
s3.1: judging whether the path from the source node to the destination node is the same as the residual flow resource of the prior path or not: if the paths are different, judging that the paths with more residual flow resources have smaller path cost values; otherwise, the path cost value between the source node and the destination node is judged to be the same as the default path cost value.
Further, the preemptive routing tree establishing process comprises the following steps:
s1.2: a root node periodically sends RANN broadcast messages, wherein the RANN broadcast messages carry initialized serial numbers and path cost values;
s2.2: after receiving the RANN broadcast message, other nodes judge whether the sequence number in the RANN broadcast message is not less than the sequence number in the routing table of the node: if yes, go to step S3.2; otherwise, discarding the RANN broadcast message;
s3.2: taking the last hop of the RANN broadcast message received by the node as a father node of the node, taking the path cost value between the father node and the path cost value in the RANN broadcast message as an updated value of the path cost value in the RANN broadcast message, and then judging whether the updated path cost value in the RANN broadcast message is smaller than the path cost value in a routing table of the node: if yes, replacing the path cost value in the node routing table with the updated path cost value in the RANN broadcast message, and broadcasting the RANN broadcast message; otherwise, the RANN broadcast message is directly broadcast.
Has the advantages that: the invention discloses a method for inhibiting HWMP on-demand routing broadcast packets, which fully utilizes a prior optimal path tree generated in the prior routing tree establishment process, and in the process of searching an optimal path between a source node and a destination node, the diffusion of the broadcast packets is limited within the range smaller than the path cost value of the prior path, thereby greatly reducing the cost in the process of searching the optimal path and improving the searching efficiency.
Drawings
FIG. 1 is a Mesh topology diagram according to an embodiment of the present invention;
fig. 2 is a flowchart of RANN broadcast packet transmission processing according to an embodiment of the present invention;
fig. 3 is a flowchart of RANN broadcast packet reception processing according to an embodiment of the present invention;
fig. 4 is a flow chart of a PREQ broadcast packet transmission process according to an embodiment of the present invention.
Detailed Description
The technical scheme of the invention is further described in the following by combining the attached drawings and the detailed description.
The specific embodiment discloses a method for suppressing HWMP on-demand routing broadcast packets, which comprises a priori routing tree establishing process and an optimal path searching process from a source node to a destination node, wherein:
the process of establishing the prior-checking type routing tree comprises the following steps: establishing a prior optimal path tree from a root node to other nodes before a data service occurs;
the optimal path searching process from the source node to the destination node comprises the following steps: firstly, a root node calculates a default path cost value, wherein the default path cost value is the sum of a priori path cost value from a source node to the root node and a priori path cost value from the root node to a destination node, and then the root node informs the source node of the default path cost value through an RANN broadcast message; then the source node searches a target node by sending a broadcast message PREQ, other nodes selectively forward the broadcast message PREQ, the path cost value between the source node and the target node is compared with the default path cost value, if the path cost value between the source node and the target node is smaller than the default path cost value, the source node is judged to find the path established by the target node as the optimal path by sending the broadcast message PREQ, otherwise, the prior path between the source node and the target node is judged as the optimal path.
The process of establishing the prior-check type routing tree comprises the following steps:
s1.2: a root node periodically sends RANN broadcast messages, wherein the RANN broadcast messages carry initialized serial numbers and path cost values;
s2.2: after receiving the RANN broadcast message, other nodes judge whether the sequence number in the RANN broadcast message is not less than the sequence number in the routing table of the node: if yes, go to step S3.2; otherwise, discarding the RANN broadcast message;
s3.2: taking the last hop of the RANN broadcast message received by the node as a father node of the node, taking the path cost value between the father node and the path cost value in the RANN broadcast message as an updated value of the path cost value in the RANN broadcast message, and then judging whether the updated path cost value in the RANN broadcast message is smaller than the path cost value in a routing table of the node: if yes, replacing the path cost value in the node routing table with the updated path cost value in the RANN broadcast message, and broadcasting the RANN broadcast message; otherwise, the RANN broadcast message is directly broadcast.
In this way, an experiential path can be established between the root node and other nodes before data traffic occurs through the experiential routing tree establishment process.
The optimal path searching process from the source node to the destination node comprises the following steps:
s1: when a source node needs to send data, firstly, carrying out route query, and if finding that the route to a destination node does not exist, sending a data packet to be sent to a root node through an established prior type path;
s2: after receiving the data packet, the root node extracts the path cost value from the root node to the destination node, adds the path cost value from the root node to the destination node and the path cost value from the root node to the source node to obtain a default path cost value, and then encapsulates and broadcasts the RANN message;
s3: after receiving the RANN message, other nodes judge whether the default path cost value is not 0: if not, judging whether the default path cost value belongs to the node, if so, judging that the node is a source node and sending a broadcast message PREQ in an on-demand routing RM-AODV mode, then continuously broadcasting the RANN message, and if not, continuously broadcasting the RANN message; if not, continuing to broadcast the RANN message;
s4: when other nodes receive the broadcast message PREQ, the path cost value between the node and a father node from which the broadcast message PREQ comes is subtracted from the default path cost value in the broadcast message PREQ, the calculation result is used as an update value of the default path cost value, and then whether the update value of the default path cost value is larger than 0 is judged: if so, go to step S5; otherwise, discarding the broadcast message PREQ, and not forwarding again, and then performing step S6;
s5: judging whether the node is a destination node: if yes, replying a routing response message PREP to the source node, establishing a reverse route from the node to the source node, and then performing step S6; otherwise, continuing to forward the broadcast message PREQ, and then returning to step S4;
s6: judging whether the source node receives a routing response message PREP within a preset time: if the source node receives the routing response message PREP within the preset time, taking the path between the source node and the destination node established in the optimal path searching process as the optimal path between the source node and the destination node; otherwise, the prior path is used as the optimal path between the source node and the destination node.
In step S3, after receiving the RANN message, the other nodes also return the routing return message PREP to the root node, and after receiving the routing return message PREP, the root node learns the path to the other nodes through the information in the routing return message PREP.
The path cost value between the source node and the destination node and the default path cost value are judged by the following method:
s1.1: judging whether the hop count of the path from the source node to the destination node is the same as the hop count of the prior path: if the paths are different, judging that the paths with less hops have smaller path cost values; otherwise, continuing to perform the step S2.1;
s2.1: judging whether the channel quality of a path from a source node to a destination node is the same as the channel quality of a prior path: if the channel quality is different, judging that the path with good channel quality has smaller path cost value; otherwise, continuing to step S3.1;
s3.1: judging whether the path from the source node to the destination node is the same as the residual flow resource of the prior path or not: if the paths are different, judging that the paths with more residual flow resources have smaller path cost values; otherwise, the path cost value between the source node and the destination node is judged to be the same as the default path cost value.
The following takes the network topology shown in fig. 1 as an example to further describe the present embodiment.
s1.3: the node 1 periodically sends RANN broadcast messages, wherein the RANN broadcast messages carry initialized sequence numbers and path cost values Metric;
s2.3: after receiving the RANN broadcast message, other nodes judge whether the sequence number in the RANN broadcast message is not less than the sequence number in the routing table of the node: if yes, go to step S3.3; otherwise, discarding the RANN broadcast message;
s3.3: taking the last hop of the RANN broadcast message received by the node as a father node of the node, taking the path cost value between the father node and the path cost value in the RANN broadcast message as an updated value of the path cost value in the RANN broadcast message, and then judging whether the updated path cost value in the RANN broadcast message is smaller than the path cost value in a routing table of the node: if yes, replacing the path cost value in the node routing table with the updated path cost value in the RANN broadcast message, and broadcasting the RANN broadcast message; otherwise, the RANN broadcast message is directly broadcast.
This establishes a priori paths between node 1 and other nodes.
When the node 4 needs to send a service to the node 6, starting an optimal path searching process from the node 4 to the node 6, comprising the following steps:
s11: when the node 4 needs to send data, firstly, carrying out route query, and if finding that the route to the node 6 does not exist, sending a data packet to be sent to the node 1 through an established prior formula path;
s21: as shown in fig. 2, after receiving a data packet, the node 1 extracts the path cost values from the node 1 to the node 6, adds the path cost value Metric D from the node 1 to the node 6 and the path cost value Metric S from the node 1 to the node 4 to obtain a default path cost value DEF Metric, encapsulates and broadcasts a RANN message, wherein the RANN message carries the default path cost value DEF Metric, bitmap information corresponding to the node 4, and bitmap information corresponding to the node 6;
s31: as shown in fig. 3, after receiving the RANN message, the other nodes determine whether the default path cost value DEF Metric is not 0: if not, judging whether the default path cost value DEF Metric belongs to the node, if so, judging that the node is a source node and sending a broadcast message PREQ in an on-demand routing RM-AODV mode, then continuously broadcasting the RANN message, and if not, continuously broadcasting the RANN message; if not, continuing to broadcast the RANN information;
s41: as shown in fig. 4, when the other node receives the broadcast message PREQ, the default path cost value DEF Metric in the broadcast message PREQ is subtracted by the path cost value between the node and the parent node from which the broadcast message PREQ comes, the calculation result is used as the Update value Update DEF Metric of the default path cost value, and then it is determined whether the Update value Update DEF Metric of the default path cost value is greater than 0: if so, go to step S51; otherwise, discarding the broadcast message PREQ, and not forwarding again, and then performing step S61;
s51: judging whether the node is a destination node: if yes, replying a routing response message PREP to the node 4, establishing a reverse route from the node to the node 4, and then performing step S61; otherwise, continuing to forward the broadcast message PREQ, and then returning to step S41;
s61: judging whether the node 4 receives the routing response information PREP within the preset time: if the node 4 receives the routing response message PREP within the preset time, taking the path between the node 4 and the node 6 established in the optimal path searching process as the optimal path between the node 4 and the node 6; otherwise, the prior path is used as the optimal path between the node 4 and the node 6.
It can be seen that before node 4 finds no optimal path, the data packet it sends reaches node 6 along the path from node 4 to node 2 to node 1 to node 3 to node 6. After finding the optimal path, the data packet reaches the node 6 along the path from the node 4 to the node 5 to the node 6, and the broadcast message PREQ is limited within the range of 4 hops, which greatly reduces the load of the control channel.
Claims (5)
- The method for suppressing the HWMP on-demand routing broadcast packet is characterized by comprising the following steps: the method comprises a process of establishing an empirical routing tree and a process of searching an optimal path from a source node to a destination node, wherein:the process of establishing the prior-checking type routing tree comprises the following steps: establishing a prior optimal path tree from a root node to other nodes before a data service occurs;the optimal path searching process from the source node to the destination node comprises the following steps:(1) firstly, a root node calculates a default path cost value, wherein the default path cost value is the sum of a priori path cost value from a source node to the root node and a priori path cost value from the root node to a destination node, and then the root node broadcasts the default path cost value through an RANN broadcast message;(2) after receiving the RANN message, other nodes judge whether the default path cost value is not 0: if not, judging whether the default path cost value belongs to the node, if so, judging that the node is a source node and sending a broadcast message PREQ in an on-demand routing RM-AODV mode, then continuously broadcasting the RANN message, and if not, continuously broadcasting the RANN message; if not, continuing to broadcast the RANN message;(3) when other nodes receive the broadcast message PREQ, the path cost value between the node and a father node from which the broadcast message PREQ comes is subtracted from the default path cost value in the broadcast message PREQ, the calculation result is used as an update value of the default path cost value, and then whether the update value of the default path cost value is larger than 0 is judged: if yes, performing the step (4); otherwise, discarding the broadcast message PREQ, not forwarding, and then performing step (5);(4) judging whether the node is a destination node: if yes, replying a routing response message PREP to the source node, establishing a reverse route from the node to the source node, and then performing the step (5); if not, continuing to forward the broadcast message PREQ, and then returning to the step (3);(5) judging whether the source node receives a routing response message PREP within a preset time: if the source node receives the routing response message PREP within the preset time, taking the path between the source node and the destination node established in the optimal path searching process as the optimal path between the source node and the destination node; otherwise, the prior path is used as the optimal path between the source node and the destination node.
- 2. The HWMP on-demand routing broadcast packet suppression method of claim 1, wherein: the optimal path searching process from the source node to the destination node further comprises the following steps executed before the step (1):s1: when a source node needs to send data, route inquiry is firstly carried out, and if the route to a destination node does not exist, a data packet to be sent is sent to a root node through an established prior type path.
- 3. The HWMP on-demand routing broadcast packet suppression method of claim 2, wherein: in the step (2), the other nodes also return the routing return message PREP to the root node after receiving the RANN message, and the root node learns the path to the other nodes through the information in the routing return message PREP after receiving the routing return message PREP.
- 4. The HWMP on-demand routing broadcast packet suppression method of claim 1, wherein: the path cost value between the source node and the destination node and the default path cost value are judged by the following method:s1.1: judging whether the hop count of the path from the source node to the destination node is the same as the hop count of the prior path: if the paths are different, judging that the paths with less hops have smaller path cost values; otherwise, continuing to perform the step S2.1;s2.1: judging whether the channel quality of a path from a source node to a destination node is the same as the channel quality of a prior path: if the channel quality is different, judging that the path with good channel quality has smaller path cost value; otherwise, continuing to step S3.1;s3.1: judging whether the path from the source node to the destination node is the same as the residual flow resource of the prior path or not: if the paths are different, judging that the paths with more residual flow resources have smaller path cost values; otherwise, the path cost value between the source node and the destination node is judged to be the same as the default path cost value.
- 5. The HWMP on-demand routing broadcast packet suppression method of claim 1, wherein: the process of establishing the prior-check routing tree comprises the following steps:s1.2: a root node periodically sends RANN broadcast messages, wherein the RANN broadcast messages carry initialized serial numbers and path cost values;s2.2: after receiving the RANN broadcast message, other nodes judge whether the sequence number in the RANN broadcast message is not less than the sequence number in the routing table of the node: if yes, go to step S3.2; otherwise, discarding the RANN broadcast message;s3.2: taking the last hop of the RANN broadcast message received by the node as a father node of the node, taking the path cost value between the father node and the path cost value in the RANN broadcast message as an updated value of the path cost value in the RANN broadcast message, and then judging whether the updated path cost value in the RANN broadcast message is smaller than the path cost value in a routing table of the node: if yes, replacing the path cost value in the node routing table with the updated path cost value in the RANN broadcast message, and broadcasting the RANN broadcast message; otherwise, the RANN broadcast message is directly broadcast.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710177937.XA CN106685836B (en) | 2017-03-23 | 2017-03-23 | HWMP on-demand routing broadcast packet suppression method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710177937.XA CN106685836B (en) | 2017-03-23 | 2017-03-23 | HWMP on-demand routing broadcast packet suppression method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106685836A CN106685836A (en) | 2017-05-17 |
| CN106685836B true CN106685836B (en) | 2020-01-14 |
Family
ID=58829264
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710177937.XA Active CN106685836B (en) | 2017-03-23 | 2017-03-23 | HWMP on-demand routing broadcast packet suppression method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106685836B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114158108B (en) * | 2022-02-10 | 2022-05-06 | 天津七一二通信广播股份有限公司 | Method for realizing HWMP-based hybrid routing protocol |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101056240A (en) * | 2007-05-22 | 2007-10-17 | 杭州华三通信技术有限公司 | A route maintenance method and device between the MESH points |
| CN101540714A (en) * | 2008-03-21 | 2009-09-23 | 华为技术有限公司 | Method for establishing network path and transmitting data and network nodes |
| CN101616061A (en) * | 2008-06-26 | 2009-12-30 | 华为技术有限公司 | The path determines that method, path determine device and network system |
| CN102186221A (en) * | 2011-04-25 | 2011-09-14 | 北京星网锐捷网络技术有限公司 | Method and device for updating routing table item |
| CN104185242A (en) * | 2014-09-11 | 2014-12-03 | 电子科技大学 | Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference |
| CN104320334A (en) * | 2014-11-03 | 2015-01-28 | 电子科技大学 | Centralized routing algorithm in wireless Mesh network |
| WO2015052248A1 (en) * | 2013-10-09 | 2015-04-16 | Terranet Ab | Improved path finding in a mesh network |
| WO2015052247A1 (en) * | 2013-10-09 | 2015-04-16 | Terranet Ab | Improved path finding in a mesh network |
| CN104994556A (en) * | 2015-05-20 | 2015-10-21 | 杭州华三通信技术有限公司 | Method and device for establishing route based on hybrid wireless netted network protocol |
| CN105763443A (en) * | 2016-04-28 | 2016-07-13 | 西安电子科技大学 | HWMP-based double route cooperation method |
| CN106130905A (en) * | 2016-06-03 | 2016-11-16 | 西安电子科技大学 | The link restoring method of HWMP priori tree route pattern |
| WO2016206709A1 (en) * | 2015-06-22 | 2016-12-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Path selection in wireless mesh networks |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10123249B2 (en) * | 2013-08-27 | 2018-11-06 | Sony Corporation | Information processing device and information processing method |
-
2017
- 2017-03-23 CN CN201710177937.XA patent/CN106685836B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101056240A (en) * | 2007-05-22 | 2007-10-17 | 杭州华三通信技术有限公司 | A route maintenance method and device between the MESH points |
| CN101540714A (en) * | 2008-03-21 | 2009-09-23 | 华为技术有限公司 | Method for establishing network path and transmitting data and network nodes |
| CN101616061A (en) * | 2008-06-26 | 2009-12-30 | 华为技术有限公司 | The path determines that method, path determine device and network system |
| CN102186221A (en) * | 2011-04-25 | 2011-09-14 | 北京星网锐捷网络技术有限公司 | Method and device for updating routing table item |
| WO2015052248A1 (en) * | 2013-10-09 | 2015-04-16 | Terranet Ab | Improved path finding in a mesh network |
| WO2015052247A1 (en) * | 2013-10-09 | 2015-04-16 | Terranet Ab | Improved path finding in a mesh network |
| CN104185242A (en) * | 2014-09-11 | 2014-12-03 | 电子科技大学 | Wireless Mesh network channel allocation and routing joint optimization system and method capable of reducing interference |
| CN104320334A (en) * | 2014-11-03 | 2015-01-28 | 电子科技大学 | Centralized routing algorithm in wireless Mesh network |
| CN104994556A (en) * | 2015-05-20 | 2015-10-21 | 杭州华三通信技术有限公司 | Method and device for establishing route based on hybrid wireless netted network protocol |
| WO2016206709A1 (en) * | 2015-06-22 | 2016-12-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Path selection in wireless mesh networks |
| CN105763443A (en) * | 2016-04-28 | 2016-07-13 | 西安电子科技大学 | HWMP-based double route cooperation method |
| CN106130905A (en) * | 2016-06-03 | 2016-11-16 | 西安电子科技大学 | The link restoring method of HWMP priori tree route pattern |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106685836A (en) | 2017-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7894378B2 (en) | Method for updating a multicast state of a multicast group | |
| US20020145978A1 (en) | Mrp-based hybrid routing for mobile ad hoc networks | |
| US8331262B2 (en) | Apparatus and method for setup of optimum route using tree-topology | |
| CN106686659B (en) | AOMDV-based energy perception node disjoint multipath routing algorithm | |
| CN109257789B (en) | Vehicle-mounted network data communication method based on multi-hop cluster | |
| Clausen et al. | Comparative study of RPL-enabled optimized broadcast in wireless sensor networks | |
| CN110691379A (en) | Active routing communication method suitable for wireless ad hoc network | |
| CN106993321B (en) | Network data communication method based on cluster | |
| EP3200404B1 (en) | Content-centric network on-demand distance vector route method | |
| CN105763443A (en) | HWMP-based double route cooperation method | |
| CN106130905A (en) | The link restoring method of HWMP priori tree route pattern | |
| JP2009260720A (en) | Route control method, communication system and communication apparatus | |
| CN106685836B (en) | HWMP on-demand routing broadcast packet suppression method | |
| Liu et al. | A novel ant colony based QoS-aware routing algorithm for MANETs | |
| CN110661550B (en) | Method, device, storage medium and electronic equipment for forwarding message in HPLC communication link | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| KR101762696B1 (en) | Route Maintenance Protocol Using Destination-initiated Flooding in Mobile Ad Hoc Networks | |
| Khan et al. | M-AODV: Modified Ad Hoc On-demand distance vector routing scheme | |
| US8982908B1 (en) | Extension of path reply message to encode multiple route information in a mesh network | |
| Yamazaki et al. | Ant-inspired backoff-based opportunistic routing for ad hoc networks | |
| Raghavendra et al. | Congestion adaptive routing in ad hoc networks | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| US11190979B2 (en) | Methods and apparatus for forwarding packets between child nodes and parent nodes | |
| CN108965138B (en) | Method for implementing new generation multimedia sensor network | |
| CN109309606B (en) | Communication method for household appliance network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20230905 Granted publication date: 20200114 |
|
| PP01 | Preservation of patent right | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20240119 Granted publication date: 20200114 |
|
| PD01 | Discharge of preservation of patent |