CN108449267B - Reliable routing algorithm based on link quality estimation - Google Patents
Reliable routing algorithm based on link quality estimation Download PDFInfo
- Publication number
- CN108449267B CN108449267B CN201810211815.2A CN201810211815A CN108449267B CN 108449267 B CN108449267 B CN 108449267B CN 201810211815 A CN201810211815 A CN 201810211815A CN 108449267 B CN108449267 B CN 108449267B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- depth
- routing information
- gateway
- 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
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/14—Routing performance; Theoretical aspects
-
- 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/70—Routing based on monitoring results
Abstract
The invention relates to a reliable routing algorithm based on link quality estimation, which comprises that a gateway initiates topology discovery to ensure that nodes in a network know the depth of neighbor nodes around the nodes and relative gateways; obtaining the delivery rate relative to each neighbor node according to the total number of the sent detection packets and the number of the neighbor nodes receiving the detection packets; the gateway constructs a routing information packet and initializes the routing information in the routing information packet; the gateway sends a routing information packet, the neighbor node receiving the routing information packet calculates, if the new solution is superior to the original optimal solution, the routing information is updated, and the updated routing information packet is sent to the neighbor node; and obtaining an optimal path according to the success rate of transmitting the packet to the gateway and the depth of the opposite gateway by the node in the routing information. The routing algorithm of the present invention achieves higher reliability with a small amount of extra cost. The algorithm is mainly characterized by being fast and effective; the possibility of misjudgment is reduced.
Description
Technical Field
The invention belongs to the field of wireless communication, and particularly relates to a reliable routing algorithm based on link quality estimation.
Background
Some existing classical routing protocols, such as the Flooding protocol, in which a node broadcasts its own generated or received packet to all neighbors, and the neighbors that receive the packet then broadcast to their own neighbors, can reach all nodes in the network, and the gossip protocol, do not require any algorithm or routing maintenance. But the "implosion" that occurs when there are a large number of copies of a packet sent to the same node consumes a large amount of resources. While in the gossip protocol implosion is avoided, but delay of data passing through the nodes is caused, and energy waste is caused by random transmission. The SPIN protocol solves the problems of the Flooding protocol and the gossip protocol, but its advertisement mechanism cannot guarantee that data will be delivered certainly, and if nodes far away from the source node are interested in the data but nodes between the nodes and the source node are not interested in the data, the data cannot be delivered to the destination.
Disclosure of Invention
In order to solve the above technical problems, an object of the present invention is to provide a reliable routing algorithm based on link quality estimation, so as to improve the transmission reliability of network nodes in an industrial environment.
The invention provides a reliable routing algorithm based on link quality estimation, which is characterized by comprising the following steps:
step 1: the gateway initiates topology discovery to enable the nodes in the network to acquire the depths of the neighboring nodes and the relative gateways;
step 2: acquiring the delivery rate of each neighbor node according to the total number of the transmitted detection packets and the number of the detection packets received by the neighbor node in a detection packet transmitting mode;
and step 3: the gateway constructs a routing information packet and initializes the routing information in the routing information packet;
and 4, step 4: starting to send a routing information packet from a gateway, calculating by a neighbor node receiving the routing information packet according to the received new routing information and the original routing information, updating the routing information if the new solution is superior to the original optimal solution, sending the updated routing information packet to the neighbor node, and not updating the routing information if the new solution is not superior to the original optimal solution;
and 5: after all nodes in the network obtain the routing information packet, an optimal path is obtained according to the success rate of transmitting the packet to the gateway and the depth of the relative gateway by the nodes in the routing information.
In the reliable routing algorithm based on link quality estimation of the present invention, the step 1 includes:
step 1.1: setting the depth value of the gateway node to be 0, and setting the depth values of other nodes to be a maximum value which can be expected;
step 1.2: the gateway generates a deep detection packet for acquiring the deep information and broadcasts the deep detection packet, and the node receiving the deep detection packet is a neighbor node;
step 1.3: adding one to the depth value in the depth detection packet, and comparing the added depth value with the current depth value of each neighbor node, if the added depth value is smaller than the current depth value, updating the depth information of the neighbor node according to the depth information of the depth detection packet, regenerating a new depth detection packet and broadcasting the updated depth information, otherwise, not taking any action; the depth value in the depth detection packet is the depth of a source node sending the message;
step 1.4: when the deep detection packet is flooded to the whole network, all nodes can obtain the depth of the node relative to the gateway and the depth information of the neighbor nodes of one hop around the node.
In the reliable routing algorithm based on link quality estimation of the present invention, the step 2 includes:
step 2.1: each node in the network generates a link quality detection packet and sends the link quality detection packet to a neighbor node;
step 2.2: the neighbor node calculates the delivery rate of the corresponding node according to the total number of the detection packets sent and the number of the detection packets actually received, which are recorded in the link quality detection packet;
step 2.3: and the neighbor nodes broadcast the delivery rate to the corresponding nodes which send the link quality detection packets, so that all nodes in the network obtain the delivery rate of the neighbor nodes.
In the reliable routing algorithm based on link quality estimation of the present invention, the routing information in step 3 includes: the address of the packet-sending node, the address of the next hop of the packet-sending node, the success rate of the packet-sending to the gateway by the node, the depth of the relative gateway, the number of neighbors recorded by the node, the addresses of the neighbor nodes, the delivery rate to different neighbor nodes and whether the route recovery process is performed.
In the reliable routing algorithm based on link quality estimation of the present invention, the step 4 includes:
step 4.1: receiving a routing information packet sent by a neighbor node;
step 4.2: calculating the success rate of transmitting the packet to the gateway, the depth of the opposite gateway and the failure threshold value according to the routing information packet;
step 4.3: comparing the new solution obtained by calculation with the original optimal solution, assigning the value of the original optimal solution to a suboptimal solution if the new solution is superior to the original optimal solution, and assigning the value of the calculation result to the optimal solution;
step 4.4: judging whether the neighbor node fails or not;
step 4.5: and sending the updated routing information packet to the non-failed neighbor node.
In the reliable routing algorithm based on link quality estimation of the present invention, the success rate of the node delivering packets to the gateway is calculated in step 4.2 according to the following formula:
suc＝[1-(1-PRR[i])maxtrans]×suc_ratio[i]
wherein, PRR [ i ] is the packet receiving rate of the neighbor node i, maxratio is the maximum retransmission time, and suc _ ratio [ i ] is the success rate of the neighbor node to transmit the packet to the gateway.
In the reliable routing algorithm based on link quality estimation of the present invention, if any condition is satisfied in step 4.3, the optimal solution is updated:
1) the path depth in the new routing information is lower than that of the existing optimal solution, and the success rate is not lower than that of the existing solution;
2) the path depth in the new routing information is equal to the path depth of the existing optimal solution, the success rate is higher than the existing optimal solution by a certain value, and the value is set to be 0.01;
3) the path depth in the new routing information is higher than that of the existing optimal solution, whether updating is carried out or not is selected according to the increase of the path depth and the improvement degree of the end-to-end delivery rate, and the delivery rate is increased by 2% when the success rate is 90%.
In the reliable routing algorithm based on link quality estimation of the present invention, the unutilized rate of the neighbor node is calculated in step 4.4 according to the following formula:
Pfail(n)＝((1-p)max)n
wherein, P is the delivery rate between the node A and the node B, max is the maximum transmission times, Pfail (n) is the probability that the node B fails when the node continuously sends n data packets by the maximum transmission times but does not receive the acknowledgement packet sent by the node B, and the node B fails if the following formula is satisfied
Pfail(n)＜M
The reliable routing method for link quality estimation is initiated by a gateway, each node selects an optimal solution through a solution of a next node on a path and a delivery rate of the node by the node, and delivers the solution to neighboring nodes for routing calculation, wherein the delivery rate between the nodes is influenced by a retransmission mechanism due to the unreliability, and the influence of an upper limit of the transmission times and a receiving rate on the delivery rate between the nodes under the retransmission mechanism is analyzed, so that the conclusion that the upper limit of the transmission times and the receiving rate both have the influence on the delivery rate between the nodes under the retransmission mechanism is reached.
Drawings
Fig. 1 is a flow chart of a reliable routing algorithm based on link quality estimation of the present invention.
Detailed Description
The invention carries out topology discovery and link quality information collection by sending the detection packet, and then records and processes corresponding information. And reconstructing the self result and the collected link quality information into a routing information packet and sending the routing information packet to the neighbor node. Until all nodes in the network obtain the routing information, a link with better link quality can be selected from the obtained information.
As shown in fig. 1, a reliable routing algorithm based on link quality estimation of the present invention includes the following steps:
step 1: initiating topology discovery by a gateway to enable a node in a network to know the depth of neighbor nodes around the node and the relative gateway thereof, wherein the step 1 specifically comprises the following steps:
step 1.1: setting the depth value of the gateway node to be 0, and setting the depth values of other nodes to be a maximum value which can be expected;
step 1.2: the gateway generates a deep detection packet for acquiring the deep information and broadcasts the deep detection packet, and the node receiving the deep detection packet is a neighbor node;
step 1.3: adding one to the depth value in the depth detection packet, and comparing the added depth value with the current depth value of each neighbor node, if the added depth value is smaller than the current depth value, updating the depth information of the neighbor node according to the depth information of the depth detection packet, regenerating a new depth detection packet and broadcasting the updated depth information, otherwise, not taking any action;
step 1.4: when the deep detection packet is flooded to the whole network, all nodes can obtain the depth of the node relative to the gateway and the depth information of the neighbor nodes of one hop around the node.
Table 1 deep probe packet format
Step 2: obtaining the delivery rate of each neighbor node according to the total number of the transmitted detection packets and the number of the detection packets received by the neighbor node in a form of transmitting the detection packets, wherein the step 2 specifically comprises:
step 2.1: each node in the network generates a link quality detection packet and sends the link quality detection packet to a neighbor node;
step 2.2: the neighbor node calculates the delivery rate of the corresponding node according to the total number of the detection packets sent and the number of the detection packets actually received, which are recorded in the link quality detection packet;
step 2.3: and the neighbor nodes broadcast the delivery rate to the corresponding nodes which send the link quality detection packets, so that all nodes in the network obtain the delivery rate of the neighbor nodes.
Table 2 link quality probe packet format
And step 3: the gateway constructs a routing information packet and initializes the routing information in the routing information packet; the routing information includes: the address of the originating node, the address of the next hop of the originating node, the success rate of the node delivering the packet to the gateway, the depth of the opposite gateway, the number of neighbors the node records, the neighbor node address, the delivery rate to different neighbor nodes and the field used to mark whether or not it is a route recovery procedure.
Table 3 format of routing packet
Here, the gateway constructs a routing information packet first, where success _ ratio is 1 and path _ length is 0, and when link quality is collected in step 2, the number neighbor _ num of the gateway, the address _ info [ ] of each neighbor and the delivery rate PRR [ ] of each neighbor can be obtained, and the other nodes construct the routing information packet according to the existing information of the gateway and the routing information sent by the neighbors.
And 4, step 4: starting to send a routing information packet from a gateway, calculating a neighbor node receiving the routing information packet according to the received new routing information and the original routing information, updating the routing information if the new solution sum is superior to the original optimal solution, sending the updated routing information packet to the neighbor node, and otherwise, not updating the routing information, wherein the step 4 specifically comprises the following steps:
step 4.1: receiving a routing information packet sent by a neighbor node;
step 4.2: calculating the success rate of transmitting the packet to the gateway, the depth of the relative gateway and the failure threshold value according to the routing information packet, and specifically calculating the success rate of transmitting the packet to the gateway according to the following formula:
suc＝[1-(1-PRR[i])maxtrans]×suc_ratio[i]
wherein, PRR [ i ] is the packet receiving rate of the neighbor node i, maxratio is the maximum retransmission time, and suc _ ratio [ i ] is the success rate of the neighbor node to transmit the packet to the gateway.
Step 4.3: comparing the new solution obtained by calculation with the original optimal solution, assigning the value of the original optimal solution to a suboptimal solution if the new solution is superior to the original optimal solution, and assigning the value of the calculation result to the optimal solution;
when the method is implemented specifically, if any condition is met, the routing information is updated:
1) the path depth in the new routing information is lower than that of the existing optimal solution, and the success rate is not lower than that of the existing solution;
2) the path depth in the new routing information is equal to the path depth of the existing optimal solution, the success rate is higher than the existing optimal solution by a certain value, and the value is set to be 0.01;
3) the path depth in the new routing information is higher than that of the existing optimal solution, whether updating is carried out or not is selected according to the increase of the path depth and the improvement degree of the end-to-end delivery rate, and the delivery rate is increased by 2% when the success rate is 90%.
And recording the suboptimal solution while calculating the optimal solution of the route, and taking the previous optimal solution as the suboptimal solution after the optimal solution is updated until the path calculation is completed, wherein the suboptimal solution is the standby path. After confirming the next hop node failure, the node is switched to the standby path first, and then the node is informed of the link failure along the downlink and the node on the link is allowed to recalculate the route. For the nodes along the uplink of the failed node, the existing calculation results are still available and do not need to be rerouted, since their path for sending the data packets is not affected. If the node is recovered after failure, the neighbor node sends the routing control packet again according to the previous routing algorithm after sending the routing request.
Step 4.4: judging whether the neighbor node fails or not;
in specific implementation, the failure rate of the neighbor node is calculated according to the following formula:
Pfail(n)＝((1-p)max)n
where P is the delivery rate between node A and node B, max is the maximum number of transmissions, Pfail(n) is the probability that the node has continuously sent n data packets with the maximum transmission times but has not received the confirmation packet sent by the node B, and the node B has not failed, if the following formula is satisfied, the node B fails
Pfail(n)＜M
Where M is a very small number such as 0.0001 and n is the failure threshold.
Step 4.5: and sending the updated routing information packet to the non-failed neighbor node.
And 5: after all nodes in the network obtain the routing information packet, an optimal path is obtained according to the success rate of transmitting the packet to the gateway and the depth of the relative gateway by the nodes in the routing information.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the scope of the present invention, which is defined by the appended claims.
Claims (5)
1. A reliable routing algorithm based on link quality estimation, comprising the steps of:
step 1: initiating topology discovery by a gateway to enable a node in a network to acquire the depths of neighboring nodes around the node and the relative gateway, wherein the step 1 comprises the following steps:
step 1.1: setting the depth value of the gateway node to be 0, and setting the depth values of other nodes to be a maximum value which can be expected;
step 1.2: the gateway generates a deep detection packet for acquiring the deep information and broadcasts the deep detection packet, and the node receiving the deep detection packet is a neighbor node;
step 1.3: adding one to the depth value in the depth detection packet, and comparing the added depth value with the current depth value of each neighbor node, if the added depth value is smaller than the current depth value, updating the depth information of the neighbor node according to the depth information of the depth detection packet, regenerating a new depth detection packet and broadcasting the updated depth information, otherwise, not taking any action; the depth value in the depth detection packet is the depth of a source node sending the message;
step 1.4: when the depth detection packet is flooded to the whole network, all nodes can obtain the depth of the node relative to the gateway and the depth information of one-hop neighbor nodes around the node;
step 2: obtaining the delivery rate of each neighbor node according to the total number of the transmitted detection packets and the number of the detection packets received by the neighbor node by the form of transmitting the detection packets, wherein the step 2 comprises the following steps:
step 2.1: each node in the network generates a link quality detection packet and sends the link quality detection packet to a neighbor node;
step 2.2: the neighbor node calculates the delivery rate of the corresponding node according to the total number of the detection packets sent and the number of the detection packets actually received, which are recorded in the link quality detection packet;
step 2.3: the neighbor nodes broadcast the delivery rate to the corresponding nodes which send the link quality detection packets, so that all nodes in the network obtain the delivery rate of the neighbor nodes;
and step 3: the gateway constructs a routing information packet and initializes the routing information in the routing information packet;
and 4, step 4: starting to send a routing information packet from a gateway, calculating a neighbor node receiving the routing information packet according to the received new routing information and the original routing information, updating the routing information if the new solution is superior to the original optimal solution, sending the updated routing information packet to the neighbor node, and otherwise, not updating the routing information, wherein the step 4 comprises the following steps:
step 4.1: receiving a routing information packet sent by a neighbor node;
step 4.2: calculating the success rate of transmitting the packet to the gateway, the depth of the opposite gateway and the failure threshold value according to the routing information packet;
step 4.3: comparing the new solution obtained by calculation with the original optimal solution, assigning the value of the original optimal solution to a suboptimal solution if the new solution is superior to the original optimal solution, and assigning the value of the calculation result to the optimal solution;
step 4.4: judging whether the neighbor node fails or not;
step 4.5: sending the updated routing information packet to the non-failed neighbor node;
and 5: after all nodes in the network obtain the routing information packet, an optimal path is obtained according to the success rate of transmitting the packet to the gateway and the depth of the relative gateway by the nodes in the routing information.
2. The reliable routing algorithm based on link quality estimation according to claim 1, wherein the routing information in step 3 comprises: the address of the packet-sending node, the address of the next hop of the packet-sending node, the success rate of the packet-sending to the gateway by the node, the depth of the relative gateway, the number of neighbors recorded by the node, the addresses of the neighbor nodes, the delivery rate to different neighbor nodes and whether the route recovery process is performed.
3. The reliable routing algorithm based on link quality estimation according to claim 1, characterized in that the success rate of the node to deliver packets to the gateway is calculated in step 4.2 according to the following formula:
suc＝[1-(1-PRR[i])maxtrans]×suc_ratio[i]
wherein, PRR [ i ] is the packet receiving rate of the neighbor node i, maxratio is the maximum retransmission time, and suc _ ratio [ i ] is the success rate of the neighbor node to transmit the packet to the gateway.
4. The reliable routing algorithm based on link quality estimation according to claim 1, characterized in that if any condition is satisfied in step 4.3, the optimal solution is updated:
1) the path depth in the new routing information is lower than that of the existing optimal solution, and the success rate is not lower than that of the existing solution;
2) the path depth in the new routing information is equal to the path depth of the existing optimal solution, the success rate is higher than the existing optimal solution by a certain value, and the value is set to be 0.01;
3) the path depth in the new routing information is higher than that of the existing optimal solution, whether updating is carried out or not is selected according to the increase of the path depth and the improvement degree of the end-to-end delivery rate, and the delivery rate is increased by 2% when the success rate is 90%.
5. The reliable routing algorithm based on link quality estimation according to claim 1, characterized in that the unjust rate of the neighbor node is calculated in step 4.4 according to the following formula:
Pfail(n)＝((1-p)max)n
wherein, P is the delivery rate between the node A and the node B, max is the maximum transmission times, Pfail (n) is the probability that the node B fails when the node continuously sends n data packets by the maximum transmission times but does not receive the acknowledgement packet sent by the node B, and the node B fails if the following formula is satisfied
Pfail(n)＜M
Where M is a very small number such as 0.0001 and n is the failure threshold.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810211815.2A CN108449267B (en) | 2018-03-15 | 2018-03-15 | Reliable routing algorithm based on link quality estimation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810211815.2A CN108449267B (en) | 2018-03-15 | 2018-03-15 | Reliable routing algorithm based on link quality estimation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108449267A CN108449267A (en) | 2018-08-24 |
| CN108449267B true CN108449267B (en) | 2020-08-07 |
Family
ID=63195233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810211815.2A Active CN108449267B (en) | 2018-03-15 | 2018-03-15 | Reliable routing algorithm based on link quality estimation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108449267B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112866043A (en) * | 2019-11-12 | 2021-05-28 | 中兴通讯股份有限公司 | Network quality detection method, device, server and computer readable medium |
| CN112672300B (en) * | 2020-12-16 | 2022-08-05 | 杭州电力设备制造有限公司 | Power consumption data vine type transmission optimization method for medium and low voltage switch cabinet |
| CN112737638B (en) * | 2020-12-25 | 2023-01-31 | 深圳供电局有限公司 | Incremental routing method and system for reliability of power line communication |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123044A (en) * | 2011-01-14 | 2011-07-13 | 北京邮电大学 | Detection device and method of network topology consistency based on topology discovery technology |
| CN106792912A (en) * | 2017-01-13 | 2017-05-31 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
| CN106878165A (en) * | 2017-01-22 | 2017-06-20 | 新华三技术有限公司 | Data transmission method and device |
| CN107343303A (en) * | 2017-07-10 | 2017-11-10 | 东北大学 | Routing optimization method based on Duality Decomposition in wireless Mesh netword |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7706340B2 (en) * | 2006-04-13 | 2010-04-27 | The Mitre Corporation | Reliable neighbor node discovery |
-
2018
- 2018-03-15 CN CN201810211815.2A patent/CN108449267B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123044A (en) * | 2011-01-14 | 2011-07-13 | 北京邮电大学 | Detection device and method of network topology consistency based on topology discovery technology |
| CN106792912A (en) * | 2017-01-13 | 2017-05-31 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
| CN106878165A (en) * | 2017-01-22 | 2017-06-20 | 新华三技术有限公司 | Data transmission method and device |
| CN107343303A (en) * | 2017-07-10 | 2017-11-10 | 东北大学 | Routing optimization method based on Duality Decomposition in wireless Mesh netword |
Non-Patent Citations (2)
| Title |
|---|
| Link quality estimation in static wireless networks with high traffic load;Anh Tai Tran等;《Journal of Communications and Networks》;20150914;全文 * |
| 一种支持QoS与信任值的启发式重路由机制;薛惠中等;《小型微型计算机系统》;20171115;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108449267A (en) | 2018-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10375597B2 (en) | System and method for multicast over highly mobile mesh networks | |
| Belding-Royer et al. | Evolution and future directions of the ad hoc on-demand distance-vector routing protocol | |
| US8509109B2 (en) | Method for discovering and maintaining routes in smart meter networks | |
| KR101267300B1 (en) | Method for backhaul interference management with access terminal router | |
| JP2008547311A (en) | Method for finding a route in a wireless communication network | |
| CN108449267B (en) | Reliable routing algorithm based on link quality estimation | |
| US7310761B2 (en) | Apparatus and method for retransmitting data packets in mobile ad hoc network environment | |
| JP2006270535A (en) | Multi-hop radio communication equipment and route table generation method therefor | |
| CN108476579B (en) | Method for operating a communication device and communication device | |
| CN101527645A (en) | Method, system and relevant device for collecting network topology information | |
| KR102078770B1 (en) | System and Method for Supporting Improved Mobility for Downward Traffic in RPL | |
| JP5673840B2 (en) | Node device and communication method | |
| Kalpana et al. | Reliable broadcasting using efficient forward node selection for mobile ad-hoc networks. | |
| Razazian et al. | Enhanced 6LoWPAN ad hoc routing for G3-PLC | |
| CN110661550A (en) | Method, device, storage medium and electronic equipment for forwarding message in HPLC communication link | |
| US9226219B2 (en) | System and method for route learning and auto-configuration | |
| CN107801196B (en) | Method and system for detecting off-line node | |
| Chandia et al. | Loyalty pair neighbors selection based adaptive retransmission reduction routing in MANET | |
| Bae et al. | Efficient layer-2 multicasting for IEEE 802.11 s based wireless mesh networks | |
| Villa et al. | On-demand updates after a node failure in a wireless network | |
| CN117156514A (en) | Method for recovering link interruption of wireless ad hoc network based on OLSR | |
| You et al. | Effective traffic control for military tactical wireless mobile ad-hoc network | |
| Wong et al. | A localized broadcast scheme for minimizing power consumption in wireless mobile ad hoc networks. | |
| Kim | Performance comparison of MISP-based MANET strong DAD protocol | |
| KR20090063502A (en) | System, method and apparatus for multicast routing in hybrid ad-hoc 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 |