CN104023349A - AODV-based link interruption prediction and restoration method - Google Patents
AODV-based link interruption prediction and restoration method Download PDFInfo
- Publication number
- CN104023349A CN104023349A CN201410211695.8A CN201410211695A CN104023349A CN 104023349 A CN104023349 A CN 104023349A CN 201410211695 A CN201410211695 A CN 201410211695A CN 104023349 A CN104023349 A CN 104023349A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- depth
- packet
- information
- 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.)
- Granted
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an AODV-based link interruption prediction and restoration method. It is required that a node recognizes and detects a received data packet and source node information, destination node information and sender route depth information of a route channel where the data packet is located are maintained in a customized data structure; and through comparison of information in the data structure, when to carry out route repairing is determined. By the method provided by the invention, a source node is avoided from initiating the route establishment process again. Meanwhile, by selecting the shortest repair path, link communication efficiency is effectively raised, link stability is enhanced, and control packet cost is minimized.
Description
Technical field
What the present invention relates to is that a kind of Ad Hoc link in network interrupts prediction and route repair mechanism, especially the prediction of the link down based on AODV is repaired algorithm with shortest path, the present invention does not have strict restriction for the scale of network, the Ad Hoc network that is particularly useful for topological frequent variations, can effectively reduce the data volume of communicating by letter in network, guarantee the reliability and stability of link.
Background technology
Routing Protocol is one of important content of Ad Hoc network research in recent years.Routing Protocol is responsible for foundation and the maintenance work of route, is part very important in whole network.Routing Protocol must be able to adapt to this characteristic of dynamic change of Ad Hoc network, for node provides routing iinformation accurately, ensures the communication between node, and the performance that the expense of wrapping improves whole network is controlled in maximum minimizing simultaneously.
AODV (Ad hoc On-Demand Distance Vector Routing, Ad Hoc demand distance vector) be typical on-demand routing protocol in Ad Hoc network, it is data in maintaining routing list dynamically as required, the routing iinformation of own required destination node is only set up and safeguarded to each node, rather than the route of every other node in the whole network.Although Route establishment process causes certain time delay to occur, the resource that can save whole network, and can solve the situation of the route changing that node dynamic mobile causes.In Ad Hoc network, due to the mobility of node and the complexity of environment of living in, the node in network may can face the situation of link down at any time.
The way that traditional AODV is used source node to recover when finding that route opens circuit, when RERR transfers back to source node while informing that route is disconnected, source node re-starts route discovery, although the method is reliable, but time delay is very large, so proposed local reparation thought, owing to causing the node that opens circuit may be still nearby, thereby the upstream node of chain rupture place can be used the smaller RREQ of life span (TTL) to broadcast to repair route.Zheng Xiangquan is in " improvement that in MANET AODV Routing Protocol, chain rupture is repaired " of < < Journal of UEST of China > >, proposed to use local reverse rerouting method, by broadcasting a link repair message, completed the task of route querying and Route establishment simultaneously, can save the time delay of introducing when rebuilding route, and reduce to a certain extent the overhead of rerouting.But in this case, interruption has occurred link, for the transmission of data, caused considerable influence.So for fear of the interruption of link, we adopt link down forecasting mechanism, this mechanism can be predicted the imminent interruption of link.Position and the mobile message of node in Crisostomo and the Sargento article " Improving AODV with preemptive local route repair " on " In IEEE International Workshop on Wireless Ad-Hoc Networks ", have been proposed to use, predict the link of easy interruption and the backup node of being potential, need to realize such function with other supplementary modules such as GPS.Although the mass data packet generation that this mode has avoided AODV route discovery to cause, need to use new module, hardware cost rises, and needs the information exchanging also to increase accordingly between each node, and network overhead is still very large.
Summary of the invention
For defect of the prior art, in invention, we have proposed a kind of a kind of link down prediction and restorative procedure based on AODV of novelty, the method can predict the situation of link before link down, carry out rapidly the reparation of link, repair process is calculated and is selected shortest path by route simultaneously.The mass data stream of so both having avoided AODV route discovery to cause, can shorten to improve by dynamic route the efficiency of network again simultaneously.
According to a kind of link down prediction and restorative procedure based on AODV provided by the invention, require node that the packet of receiving is identified and detected, and the source node information of the route path at packet place, destination node information, sender's route depth information are maintained in a self-defining data structure; By to information comparison in data structure, decide and when carry out route repair, specifically comprise the following steps:
Step 1: when certain node x receives a packet, first whether decision signal intensity has reached threshold value;
If surpass threshold value, extract the node number of source node in packet, destination node, sending node and sender's route depth D epth information;
If lower than threshold value, judge whether this packet is the data of issuing this node x; If so, broadcast a Help packet; If belong to cross-talk packet, be judged as and be not, abandon;
Step 2: with <SID, DID> retrieves as entrance information in the route degree of depth neighbor table DNT of node, and wherein, SID is the source node number in routed path, and DID is the destination node number in routed path; If received same source node information and the information of destination node before, original <SID in the information this packet being extracted and route depth information table DNT, DID> item is compared, and upgrades MND, MXD, MNID, MXID, wherein, MND is Minimal routing depth value in energy range, MXD is maximum route depth value, and MNID is corresponding node number, and MXID is corresponding node number; If there is no corresponding <SID, DID>, the information that this packet extracts will be as new information record in route degree of depth neighbor table DNT;
Step 3: in certain specific moment, if downstream node has been received the data of upstream node, detect discovery signals strength ratio threshold value low, this downstream node will be broadcasted a Help packet, and Help packet is used for notifying neighbor node to help its upstream node to set up a new route;
Step 4: certain node has been received Help packet, compares the MXD, the MND that in self route depth information table DNT, store and the route depth D epth in Help packet; Once meet the requirements, carry out route repair; Like this, link down prediction and route repair have just completed one action, guarantee that link was repaired before fracture.
Preferably, described step 4 comprises following route repair mechanism step:
Step 4.1: after certain node is received Help packet, same <SID in retrieval route depth information table DNT, MND in DID> and MXD value, make this MND and MXD value compare with the route depth D epth carrying in Help packet;
Step 4.2: if MND ﹤ Depth ﹤ is MXD, illustrate in this node energy range, on the route path from SID to DID, the upstream and downstream node of the node of the transmission Help packet of can communicating by letter; While carrying out link repair, direct and upstream and downstream node is set up new route;
Step 4.3: if Depth≤MND, or Depth≤MXD, the node that Help packet is sent in explanation is in this node energy range boundary or outside border; Upgrade related data in route depth information table DNT, do not carry out route repair;
Step 4.4: in the situation that can carrying out route repair, the next-hop node of this node updates oneself is MNID, it is this node that notice upstream node MXID upgrades its next-hop node.
Preferably, described node-routing degree of depth neighbor table DNT, particularly, the route degree of depth neighbor table DNT of each node comprises:
Source node SID in-routed path;
Destination node DID in-routed path;
Minimal routing depth value MND in-energy range;
The node number MNID of-Minimal routing pathdepth node;
Maximum route depth value MXD in-energy range;
The node number MXID of-maximum routed path degree of depth node.
Preferably, described Help packet comprises: the route depth D epth of sending node self, the source node of route path number, destination node number.
Preferably, described route depth D epth and MND, MXD relatively after, if do not meet the requirement of route repair mechanism, can upgrade in route depth information table DNT corresponding route depth information.
Preferably, in the situation that having many repair paths to select, select the shortest repair path.
Compared with prior art, the present invention has following beneficial effect:
Method provided by the invention has been avoided again initiating Route establishment process by source node, selects the shortest repair path simultaneously, has effectively improved the communication efficiency of link, has promoted the stability of link, has reduced the expense of control packet.
Accompanying drawing explanation
By reading the detailed description of non-limiting example being done with reference to the following drawings, it is more obvious that other features, objects and advantages of the present invention will become:
Fig. 1 is system flow block diagram of the present invention;
Fig. 2 is the schematic diagram of DNT in the present invention;
Fig. 3 is process schematic diagram in the present invention.
Embodiment
Below in conjunction with specific embodiment, the present invention is described in detail.Following examples will contribute to those skilled in the art further to understand the present invention, but not limit in any form the present invention.It should be pointed out that to those skilled in the art, without departing from the inventive concept of the premise, can also make some distortion and improvement.These all belong to protection scope of the present invention.
In order to reach the above object, in the present invention, need node that the data of receiving are extracted relevant information and preserved, the information extracting in repair process is foundation.The method comprises:
First route degree of depth concept has been proposed.In AODV Routing Protocol, the route degree of depth is preserved in the mobile node of activated path.In order to reduce the expense of control packet, in our agreement, the route degree of depth is defined as certain node jumping figure to source node in link, and the Depth of source node is set to 0, and these are different from traditional AODV.
Preferably, when packet sends from source node, its jumping figure is set to 0.And every through an intermediate node, can increase by 1.For fear of confusion, we represent the route degree of depth with Depth.The link down prediction of AODV is a kind of routing mechanism that can effectively make a prediction before link down and repair with repairing algorithm, judges the quality of link by obtaining the signal strength signal intensity of data.If signal strength signal intensity is opened route repair lower than threshold value, before link down, just can obtain a new reparation route like this.
Particularly, each node need to compare the relevant information of the data that receive, minimum and maximum Depth and corresponding node ID are recorded and be maintained in an extra data structure Depth neighbor table (DNT), as shown in Figure 2, the content of various piece has demonstration to this data structure in the drawings.MND and MNID represent that node is at <SID, on the route path of DID>, and within the scope of this node self-energy, in the packet that can receive, minimum Depth value and have the node ID number of minimum Depth value.MXD and MXID represent node at SID to the route path of DID, in the packet that can receive within the scope of self-energy, maximum Depth value and have the node ID number of maximum Depth value.
Preferably, be divided into following several step:
Step 1: when certain node receives a packet, whether decision signal intensity has reached threshold value.If surpass threshold value, extract source node in packet, destination node, the ID of sending node and sender's Depth information.Otherwise if this bag is the data of issuing this node, node can be broadcasted a Help packet (specifically seeing step 3); If cross-talk packet abandons.
Step 2: in the DNT of node with <SID, DID> retrieves as entrance information, if received the information of same source and destination node before, original <SID in the information notebook data bag being extracted and DNT, DID> item is compared, and upgrades MND, MXD, MNID, MXID.If there is no corresponding <SID, DID> entrance information, these information will be as new information record in DNT.
Step 3: in certain specific moment, if downstream node has been received the information of upstream node, detect discovery signals strength ratio threshold value low, this node will be broadcasted a Help packet (comprising self Depth and the source node of route path and the ID of destination node), and notice neighbor node helps its upstream node to set up a new route.Help packet is that we define, and its effect is similar to RREQ.
Step 4: certain node has been received Help packet, by the MXD of storage in self DNT table, the Depth in MND and Help packet compares.Once meet the requirements, carry out route repair.Like this, a kind of link down prediction based on AODV based on AODV has just completed one action with reparation.Meanwhile, for repair mechanism, carry out algorithm improvement, can be in the situation that having many repair paths to select, the node of the shortest path of selecting to detour.
Preferably, selective basis Depth value compares.Described step 4 should comprise the steps:
Step 4.1: certain node receive Help packet after, first retrieve <SID same in DNT, the MND in DID> and MXD value, make it compare with the Depth carrying in Help packet.
Step 4.2: if MND ﹤ Depth ﹤ is MXD, illustrate in this node energy range, <SID, on DID> data path, the node that can communicate by letter is the upstream and downstream node that sends Help packet, while carrying out link repair, can be directly and upstream and downstream node set up route.
Step 4.3: if Depth≤MND, or Depth >=MXD, illustrate that the node that sends Help packet, in this node energy range boundary or outside border, upgrades related data in DNT, do not carry out route repair.
Step 4.4: in the situation that can carrying out route repair, the next-hop node of this node updates oneself is MNID, notice upstream node MXID upgrades its next-hop node for self.
In link, just completed once like this prediction of the link down based on AODV and repaired.In reparation, introduce all respective items in retrieval DNT, according to Depth value, for according to carrying out the reparation of link, so not only dissolved the danger of link down, also shortened as much as possible linkage length simultaneously.
Further, as follows a preferred embodiment of the present invention is described.
We suppose that a hybrid sensor network being comprised of several nodes is deployed in an outdoor plane monitored area.Implementation method of the present invention is as follows: as shown in Figure 3, this is a route path from S node to D node.The route degree of depth of supposing B, C, D, E is respectively 1,2,3,4.Node F is a node outside data link, and it can constantly receive the packet of cross-talk in link, and with <SID, DID> is entrance information, is kept in DNT.As situation in figure, this Nodes is at B, C, and D, in the energy range of E, will be subject to the cross-talk data that four nodes send.In the present invention, an important feature is exactly the employing for cross-talk packet, obtains the route depth value of other nodes on route path by cross-talk, and constantly updates, and obtains optimum repair mode when having reparation demand.Next, we will describe the implementation of link down prediction and route repair algorithm in detail.As follows:
The first step, F receives a packet, and whether decision signal intensity has reached threshold value, if surpass threshold value, extracts ID and the sender's of source node in packet, destination node, sending node Depth information.Meanwhile, upgrade MND, MXD, MNID, the MXID of respective items in DNT table.Otherwise, if this bag is the data of issuing this node, a little less than the signal strength signal intensity of issuing this packet is described, broadcast a Help packet; If cross-talk packet, packet discard returning.
Second step, in certain moment, node C place receives and from B, sends to its data, and signal strength signal intensity, lower than threshold value, shows may occur the interruption of connection herein.Node C is source node SID, destination node DID, and the Depth value of self exists in Help, and broadcast transmission Help packet.
The 3rd step, node F has received after Help packet, starts to retrieve <SID corresponding in DNT, DID> entrance information, the MND=1 safeguarding in the DNT that retrieval obtains, MXD=4, MND=B, MXD=E.
The 4th step, Depth and MND in judgement Help packet, the magnitude relationship between MXD.Depth between, requirement is shortened in the path that meets route repair.
The 4th step, node F is set as E by the next-hop node of oneself, and notifies upstream node B that its downstream node is set as to F, completes route repair.
Be more than the detailed description to the enforcement of route repair, run into new routing issue, all can adopt said method to carry out route repair.
Above specific embodiments of the invention are described.It will be appreciated that, the present invention is not limited to above-mentioned specific implementations, and those skilled in the art can make various distortion or modification within the scope of the claims, and this does not affect flesh and blood of the present invention.
Claims (6)
1. the link down based on AODV is predicted and restorative procedure, it is characterized in that, require node that the packet of receiving is identified and detected, and the source node information of the route path at packet place, destination node information, sender's route depth information are maintained in a self-defining data structure; By to information comparison in data structure, decide and when carry out route repair, specifically comprise the following steps:
Step 1: when certain node x receives a packet, first whether decision signal intensity has reached threshold value;
If surpass threshold value, extract the node number of source node in packet, destination node, sending node and sender's route depth D epth information;
If lower than threshold value, judge whether this packet is the data of issuing this node x; If so, broadcast a Help packet; If belong to cross-talk packet, be judged as and be not, abandon;
Step 2: with <SID, DID> retrieves as entrance information in the route degree of depth neighbor table DNT of node, and wherein, SID is the source node number in routed path, and DID is the destination node number in routed path; If received same source node information and the information of destination node before, original <SID in the information this packet being extracted and route depth information table DNT, DID> item is compared, and upgrades MND, MXD, MNID, MXID, wherein, MND is Minimal routing depth value in energy range, MXD is maximum route depth value, and MNID is corresponding node number, and MXID is corresponding node number; If there is no corresponding <SID, DID>, the information that this packet extracts will be as new information record in route degree of depth neighbor table DNT;
Step 3: in certain specific moment, if downstream node has been received the data of upstream node, detect discovery signals strength ratio threshold value low, this downstream node will be broadcasted a Help packet, and Help packet is used for notifying neighbor node to help its upstream node to set up a new route;
Step 4: certain node has been received Help packet, compares the MXD, the MND that in self route depth information table DNT, store and the route depth D epth in Help packet; Once meet the requirements, carry out route repair; Like this, link down prediction and route repair have just completed one action, guarantee that link was repaired before fracture.
2. link down prediction and the restorative procedure based on AODV according to claim 1, is characterized in that, described step 4 comprises following route repair mechanism step:
Step 4.1: after certain node is received Help packet, same <SID in retrieval route depth information table DNT, MND in DID> and MXD value, make this MND and MXD value compare with the route depth D epth carrying in Help packet;
Step 4.2: if MND ﹤ Depth ﹤ is MXD, illustrate in this node energy range, on the route path from SID to DID, the upstream and downstream node of the node of the transmission Help packet of can communicating by letter; While carrying out link repair, direct and upstream and downstream node is set up new route;
Step 4.3: if Depth≤MND, or Depth≤MXD, the node that Help packet is sent in explanation is in this node energy range boundary or outside border; Upgrade related data in route depth information table DNT, do not carry out route repair;
Step 4.4: in the situation that can carrying out route repair, the next-hop node of this node updates oneself is MNID, it is this node that notice upstream node MXID upgrades its next-hop node.
3. link down prediction and the restorative procedure based on AODV according to claim 2, is characterized in that, described node-routing degree of depth neighbor table DNT, and particularly, the route degree of depth neighbor table DNT of each node comprises:
Source node SID in-routed path;
Destination node DID in-routed path;
Minimal routing depth value MND in-energy range;
The node number MNID of-Minimal routing pathdepth node;
Maximum route depth value MXD in-energy range;
The node number MXID of-maximum routed path degree of depth node.
4. link down based on AODV prediction according to claim 2 and restorative procedure, is characterized in that, described Help packet comprises: the route depth D epth of sending node self, the source node of route path number, destination node number.
5. the link down based on AODV according to claim 2 is predicted and restorative procedure, it is characterized in that, described route depth D epth and MND, MXD relatively after, if do not meet the requirement of route repair mechanism, can upgrade in route depth information table DNT corresponding route depth information.
6. link down prediction and the restorative procedure based on AODV according to claim 2, is characterized in that, in the situation that having many repair paths to select, selects the shortest repair path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410211695.8A CN104023349B (en) | 2014-05-19 | 2014-05-19 | Link down prediction and restorative procedure based on AODV |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410211695.8A CN104023349B (en) | 2014-05-19 | 2014-05-19 | Link down prediction and restorative procedure based on AODV |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104023349A true CN104023349A (en) | 2014-09-03 |
| CN104023349B CN104023349B (en) | 2017-09-26 |
Family
ID=51439872
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410211695.8A Expired - Fee Related CN104023349B (en) | 2014-05-19 | 2014-05-19 | Link down prediction and restorative procedure based on AODV |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104023349B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108141904A (en) * | 2015-10-13 | 2018-06-08 | 飞利浦照明控股有限公司 | It is route using the unicast messages of duplicate node |
| CN111148175A (en) * | 2019-12-30 | 2020-05-12 | 沈阳理工大学 | Self-adaptive route repairing method in wireless self-organizing network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827413A (en) * | 2009-03-05 | 2010-09-08 | 赵欣 | Dynamic multipath routing algorithm based on mobility prediction |
| CN102281609A (en) * | 2011-08-26 | 2011-12-14 | 江苏合成物联网科技有限公司 | Internet of things-based route improved protocol |
| US8089947B2 (en) * | 2007-08-31 | 2012-01-03 | Intel Corporation | Spatial reuse in directional antenna systems |
-
2014
- 2014-05-19 CN CN201410211695.8A patent/CN104023349B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8089947B2 (en) * | 2007-08-31 | 2012-01-03 | Intel Corporation | Spatial reuse in directional antenna systems |
| CN101827413A (en) * | 2009-03-05 | 2010-09-08 | 赵欣 | Dynamic multipath routing algorithm based on mobility prediction |
| CN102281609A (en) * | 2011-08-26 | 2011-12-14 | 江苏合成物联网科技有限公司 | Internet of things-based route improved protocol |
Non-Patent Citations (1)
| Title |
|---|
| 朱广荣等: "基于链路失效预测的AODV路由协议", 《机电产品开发与创新》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108141904A (en) * | 2015-10-13 | 2018-06-08 | 飞利浦照明控股有限公司 | It is route using the unicast messages of duplicate node |
| CN108141904B (en) * | 2015-10-13 | 2021-03-12 | 飞利浦照明控股有限公司 | Unicast message routing using duplicate nodes |
| CN111148175A (en) * | 2019-12-30 | 2020-05-12 | 沈阳理工大学 | Self-adaptive route repairing method in wireless self-organizing network |
| CN111148175B (en) * | 2019-12-30 | 2023-02-07 | 沈阳理工大学 | Self-adaptive route repairing method in wireless self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104023349B (en) | 2017-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101616466B (en) | Ad hoc network zone routing method | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| CN106131919B (en) | A kind of synchronous method of non-stop layer self-organized network topology | |
| CN101436997B (en) | Method for repairing route based on AODV and link fault type | |
| CN101394356B (en) | Route establishing method and device for mobile Ad hoc network | |
| RU2010144792A (en) | NODE DEVICE AND PROGRAM | |
| JP4783305B2 (en) | Method for transmitting station information in wireless mesh network, mesh access point device and mesh portal device | |
| CN102802228A (en) | AdHoc network multipath routing method oriented to link stability | |
| JP5812917B2 (en) | Method for discovering multiple routes in a multi-hop network and node for searching for multiple routes | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| CN102916879B (en) | Rapid route convergence method | |
| CN104301912B (en) | A kind of detection method and device of path break-make | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN102769845A (en) | Wormhole detecting method based on specific triple-jump channel path in wireless sensor network | |
| CN101309217B (en) | Network multipath routing method based on AD HOC on basis of bidirectional rerouting | |
| CN102802186B (en) | A kind of detection method of scrambling conflict community and checkout equipment | |
| CN104023349A (en) | AODV-based link interruption prediction and restoration method | |
| CN103415033B (en) | The foundation of Ad Hoc network on-demand routing protocol based on Path-collection and maintaining method | |
| CN102573000B (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| CN109787838B (en) | Method for avoiding fault relay node in multi-hop network | |
| WO2011142839A3 (en) | Mobile ad-hoc re-routing method | |
| CN101127669B (en) | Method and corresponding device based on OLSR dispersion network topology information | |
| KR100821301B1 (en) | Method and Apparatus For An Improvement of Routing Performance in Ad Hoc Networks | |
| CN105591932A (en) | Method and device for identifying neighbor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170926 Termination date: 20200519 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |