CN104023349B - Link down prediction and restorative procedure based on AODV - Google Patents
Link down prediction and restorative procedure based on AODV Download PDFInfo
- Publication number
- CN104023349B CN104023349B CN201410211695.8A CN201410211695A CN104023349B CN 104023349 B CN104023349 B CN 104023349B CN 201410211695 A CN201410211695 A CN 201410211695A CN 104023349 B CN104023349 B CN 104023349B
- 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.)
- Expired - Fee Related
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 a kind of link down prediction based on AODV and restorative procedure, it is required that node is identified and detected to the packet received, and the source node identification of the route path where packet, destination node information, sender's route depth information are maintained in a customized data structure；By comparing information in data structure, to determine when carry out route repair.The method that the present invention is provided is avoided initiates route establishment process again by source node, simultaneous selection most short repair path, is effectively improved the communication efficiency of link, improves the stability of link, reduces the expense of control packet.
Description
Technical field
Prediction and route repair mechanism are interrupted the present invention relates to a kind of Ad Hoc networks link, AODV is particularly based on
Link down prediction repair algorithm with shortest path, the present invention does not have strict restriction for the scale of network, especially suitable
The Ad Hoc networks frequently changed in topology, can be effectively reduced the data volume communicated in network, it is ensured that the reliability of link
And stability.
Background technology
Routing Protocol is one of important content of Ad Hoc networks research in recent years.Routing Protocol be responsible for route foundation and
Maintenance work, is particularly important part in whole network.Routing Protocol allows for adapting to the dynamic of Ad Hoc networks
Change this characteristic, accurate routing iinformation is provided for node, ensure the communication between node, while maximum reduction control bag
Expense improve the performance of whole network.
AODV (Ad hoc On-Demand Distance Vector Routing, Ad Hoc demand distance vectors) is Ad
Typical on-demand routing protocol in Hoc network, it safeguards the data in routing table dynamically as needed, and each node is only set up
With the routing iinformation for safeguarding the destination node needed for oneself, rather than in the whole network every other node route.Although route is built
Vertical process causes certain delay to occur, but can save the resource of whole network, and can solve node dynamic mobile
The situation of caused route changing.In Ad Hoc networks, due to the mobility and the complexity of local environment of node, network
In node may can face the situation of link down at any time.
The method that traditional AODV is recovered when finding route open circuit using source node, i.e., accuse when RERR transfers back to source node
When knowing that route is broken, source node re-starts route discovery, although this method is reliable, time delay is very big, so proposing local
Thought is repaired, due to causing the node of open circuit may still nearby, thus life span can be used in upstream node at chain rupture
(TTL) smaller RREQ broadcast come repair way by.Zheng Xiangquan exists《Journal of UEST of China》" MANET AODV route association
In the improvement that chain rupture is repaired in view ", it is proposed that use local reverse route method for reconstructing, disappeared by broadcasting a link repair
Breath completes the task of route querying and Route establishment simultaneously, can save the time delay introduced when rebuilding route, and certain
The overhead of rerouting is reduced in degree.But in this case, link has occurred that interruption, for the biography of data
It is defeated to cause considerable influence.So, in order to avoid the interruption of link, we use link down forecasting mechanism, and the mechanism can be with
Predict that link is imminent to interrupt.Crisostomo and Sargento is in " In IEEE International Workshop
Article " Improving AODV with preemptive local on Wireless Ad-Hoc Networks "
The position and movement information using node is proposed in route repair ", to predict the link easily interrupted and be potential
Backup node using other supplementary modules such as GPS, it is necessary to realize such function.Although this mode avoids AODV routes
The life it was found that mass data caused is contracted for fixed output quotas, but need to use new module, hardware cost rises, and needs to hand between each node
The information of stream is also accordingly increased, and network overhead is still very big.
The content of the invention
For defect of the prior art, in invention, we have proposed a kind of a kind of novel link based on AODV
Prediction and restorative procedure are interrupted, this method predicts the situation of link, the reparation of line link is entered rapidly before can breaking in a link,
Repair process selects shortest path by router-level topology simultaneously.The mass data that AODV route discoveries are caused so both was avoided
Stream, while the efficiency of network can be improved by dynamic route shortening again.
A kind of the link down prediction and restorative procedure based on AODV provided according to the present invention, it is desirable to which node is to receiving
Packet is identified and detects, and by the source node identification of the route path where packet, destination node information, sender
Route depth information is maintained in a customized data structure；By comparing information in data structure, come determine when
Route repair is carried out, following steps are specifically included：
Step 1：When certain node x receives a packet, judge whether signal intensity has reached threshold value first；
If more than threshold value, extracting source node in packet, destination node, the node number of sending node and sender
It route depth Depth information；
If less than threshold value, judging whether the packet is intended for node x data；If it is, broadcast one
Help packets；If belonging to cross-talk packet and being judged as it not being to abandon；
Step 2：In the route depth neighbor table DNT of node with<SID,DID>Retrieved as access information, its
In, SID is the source node number in routed path, and DID is the destination node number in routed path；If have received same source before
The information of nodal information and destination node, the then information extracted the packet is original in depth information table DNT with routeing
's<SID,DID>Item compares, and updates MND, MXD, MNID, MXID, wherein, MND is Minimal routing depth in energy range
Value, MXD is maximum route depth value, and MNID is corresponding node number, and MXID is corresponding node number；If not corresponding<SID,DID
>, then the information that the packet is extracted will as new information route depth neighbor table DNT in record；
Step 3：At the time of some is specific, if downstream node have received the data of upstream node, detection finds signal
Strength ratio threshold value is low, and the downstream node will broadcast a Help packet, and Help packets are used to notify neighbor node to help
Its upstream node sets up a new route；
Step 4：Some node have received Help packets, MXD, the MND that will be stored in itself route depth information table DNT
It is compared with the route depth Depth in Help packets；Once meeting the requirements, route repair is carried out；So, link down
Prediction and route repair just complete one action, it is ensured that link is repaired before breaking.
Preferably, the step 4 includes following route repair mechanism step：
Step 4.1：Some node is received after Help packets, same in retrieval route depth information table DNT<SID,
DID>In MND and MXD values, make MND the and MXD values compared with the route depth Depth carried in Help packets；
Step 4.2：If MND ﹤ Depth ﹤ MXD, illustrate in this node energy range, the route path from SID to DID
On, it can communicate to the upstream and downstream node for the node for sending Help packets；When carrying out link repair, directly saved with upstream and downstream
Point sets up new route；
Step 4.3：If Depth≤MND, or Depth≤MXD, then explanation sends the node of Help packets at this
In node energy range boundary or outside border；Related data in route depth information table DNT is then updated, is repaiied without route
It is multiple；
Step 4.4：In the case where that can carry out route repair, the node updates next-hop node of oneself is MNID,
Upstream node MXID is notified to update its next-hop node for this node.
Preferably, described node-routing depth neighbor table DNT, specifically, the route depth neighbor table DNT of each node
Including：
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 depth node.
Preferably, the Help packets include：The route depth Depth of sending node itself, the source section for routeing path
Period, destination node number.
Preferably, after described route depth Depth is compared with MND, MXD, if not meeting wanting for route repair mechanism
Ask, then can update corresponding route depth information in route depth information table DNT.
Preferably, in the case where there is a plurality of repair path to select, most short repair path is selected.
Compared with prior art, the present invention has following beneficial effect：
The method that the present invention is provided is avoided initiates route establishment process again by source node, simultaneous selection most short reparation
Path, is effectively improved the communication efficiency of link, improves the stability of link, reduces the expense of control packet.
Brief description of the drawings
By reading the detailed description made with reference to the following drawings to non-limiting example, further feature of the invention,
Objects and advantages will become more apparent upon：
Fig. 1 is system flow block diagram of the invention；
The schematic diagram that Fig. 2 is DNT in the present invention；
Fig. 3 is process schematic in the present invention.
Embodiment
With reference to specific embodiment, the present invention is described in detail.Following examples will be helpful to the technology of this area
Personnel further understand the present invention, but the invention is not limited in any way.It should be pointed out that to the ordinary skill of this area
For personnel, without departing from the inventive concept of the premise, various modifications and improvements can be made.These belong to the present invention
Protection domain.
In order to reach the above object, in present invention, it is desirable to node extracts relevant information to the data received and protected
Deposit, the information extracted in repair process is foundation.This method includes：
It first proposed route depth concept.In AODV Routing Protocols, mobile node of the route depth in activated path
It is middle to preserve.Depth, which is route, in order to reduce the expense of control packet, in our agreement is defined as certain node in a link to source
The hop count of node, the Depth of source node is set to 0, and this is different from traditional AODV.
Preferably, when packet is issued from source node, its hop count is set to 0.And often by a centre
Node, can increase by 1.In order to avoid confusion, we are represented to route depth with Depth.AODV link down prediction is calculated with repairing
Method is a kind of routing mechanism made a prediction and repaired before that effectively can break in a link, by the signal for obtaining data
Intensity judges the quality of link.Route repair is opened if signal intensity is less than threshold value, before so breaking in a link, so that it may
With obtain a new repair way by.
Specifically, each node needs the relevant information of the data received being compared, will be minimum and maximum
Depth and corresponding node ID are recorded and are maintained in an extra data structure Depth neighbor table (DNT), this number
According to structure as shown in Fig. 2 the content of various pieces has display in figure.MND and MNID represent that node exists<SID,DID>Route
On path, in the range of the node self-energy, in the packet that can be received, minimum Depth values and possess minimum Depth values
Node ID number.MXD and MXID represent node on SID to DID route path, the data that self-energy scope interior energy is received
Bao Zhong, maximum Depth values and the node ID number for possessing maximum Depth values.
Preferably, it is divided into following several steps：
Step 1：When certain node receives a packet, judge whether signal intensity has reached threshold value.If it exceeds threshold
Value, then extract source node, destination node, the ID of sending node and the Depth information of sender in packet.Otherwise, if should
Bag is intended for the data of the node, and node can broadcast a Help packet (being specifically shown in step 3)；If cross-talk packet,
Then abandon.
Step 2：In the DNT of node with<SID,DID>Retrieved as access information, if having received same source before
It is with the information of destination node, then original in the information extracted notebook data bag and DNT<SID,DID>Item compares, more
New MND, MXD, MNID, MXID.If not corresponding<SID,DID>Access information, these information will exist as new information
Recorded in DNT.
Step 3：At the time of some is specific, if downstream node have received the information of upstream node, detection finds signal
Strength ratio threshold value is low, and the node will broadcast a Help packet (source node and mesh comprising itself Depth and route path
Node ID), notify neighbor node to help its upstream node to set up a new route.Help packets are that we define,
It, which is acted on, is similar to RREQ.
Step 4：Some node have received Help packets, MXD, MND and the Help packet that will be stored in itself DNT table
In Depth be compared.Once meeting the requirements, route repair is carried out.So, a kind of link based on AODV based on AODV
Interrupt prediction and just complete one action with repairing.Meanwhile, algorithm improvement is carried out for repair mechanism, there can be a plurality of reparation
In the case that path can be selected, selection is detoured the node of shortest path.
Preferably, selection is compared according to Depth values.Described step 4 should comprise the following steps：
Step 4.1：Certain node receive Help packets after, retrieve first same in DNT<SID,DID>In
MND and MXD values, make it compared with the Depth carried in Help packets.
Step 4.2：If MND ﹤ Depth ﹤ MXD, illustrate in this node energy range,<SID,DID>On data path, energy
Enough nodes communicate are the upstream and downstream nodes for sending Help packets, during progress link repair, can directly with upstream and downstream section
Point sets up route.
Step 4.3：If Depth≤MND, or Depth >=MXD, illustrate the node for sending Help packets in the section
On point energy range border or outside border, then related data in DNT is updated, without route repair.
Step 4.4：In the case where that can carry out route repair, the node updates next-hop node of oneself is MNID,
Upstream node MXID is notified to update its next-hop node for itself.
The once link down prediction based on AODV is so just completed in a link with repairing.Inspection is introduced in reparation
All respective items in rope DNT, enter the reparation of line link according to Depth values are foundation, have so not only dissolved link down
Danger, while also shortening linkage length as far as possible.
Further, a preferred embodiment as follows to the present invention is described.
We assume that a hybrid sensor network being made up of several nodes is deployed in an outdoor plane prison
Survey in region.The implementation of the present invention is as follows：As shown in figure 3, this is a route path from S nodes to D nodes.Assuming that
B, C, D, E route depth are respectively 1,2,3,4.Node F is a node outside data link, and it can constantly be received
The packet of cross-talk in link, with<SID,DID>For access information, it is stored in DNT.Situation in such as figure, the node is in B,
Within C, D, E energy range, it will the cross-talk data sent by four nodes.In the present invention, one it is important the characteristics of just
It is the use for cross-talk packet, the route depth value of other nodes on route path is obtained by cross-talk, and constantly updates,
Optimal repair mode is obtained when there is reparation demand.Next, we will be described in link down prediction and route repair
The implementation procedure of algorithm.It is as follows：
The first step, F receives a packet, judges whether signal intensity has reached threshold value, if it exceeds the threshold, then carrying
Take source node in packet, destination node, the ID of sending node and the Depth information of sender.Meanwhile, update right in DNT tables
Answer MND, MXD, MNID, MXID of item.Otherwise, if the bag is intended for the data of the node, the letter for issuing the packet is illustrated
Number intensity is weak, then broadcasts a Help packet；If cross-talk packet, then packet discard and return.
Received at second step, certain moment, node C and its data are sent to from B, signal intensity is less than threshold value, shows this
The interruption that place may be connected.There is Help by node C in source node SID, destination node DID, the Depth values of itself
In, and broadcast transmission Help packets.
3rd step, node F have received after Help packets, start corresponding in retrieval DNT<SID,DID>Access information,
Retrieve the MND=1, MXD=4, MND=B, MXD=E safeguarded in the DNT obtained.
4th step, judges the magnitude relationship between the Depth and MND, MXD in Help packets.Depth is at both
Between, requirement is shortened in the path for meeting route repair.
The next-hop node of oneself is set as E by the 4th step, node F, and notifies upstream node B will node sets downstream
For F, route repair is completed.
Above is the detailed description of the implementation to route repair, runs into new routing issue, it can be entered using the above method
Row route repair.
The specific embodiment of the present invention is described above.It is to be appreciated that the invention is not limited in above-mentioned
Particular implementation, those skilled in the art can make various deformations or amendments within the scope of the claims, this not shadow
Ring the substantive content of the present invention.
Claims (6)
1. a kind of link down prediction and restorative procedure based on AODV, it is characterised in that it is required that node is to the packet that receives
It is identified and detects, and the source node identification of the route path where packet, destination node information, sender is route deeply
Maintenance of information is spent in a customized data structure；By comparing information in data structure, to determine when enter walking along the street
By repairing, following steps are specifically included：
Step 1：When certain node x receives a packet, judge whether signal intensity has reached threshold value first；
If more than threshold value, extracting source node, destination node, the node number of sending node and the route of sender in packet
Depth Depth information；
If less than threshold value, judging whether the packet is intended for node x data；If it is, one Help number of broadcast
According to bag；If belonging to cross-talk packet and being judged as it not being to abandon；
Step 2：In the route depth neighbor table DNT of node with<SID,DID>Retrieved as access information, wherein, SID
For the source node number in routed path, DID is the destination node number in routed path；If have received same source node letter before
The information of breath and destination node, then the information extracted the packet with it is original in route depth information table DNT<SID,
DID>Item compares, and updates MND, MXD, MNID, MXID, wherein, MND is Minimal routing depth value in energy range, and MXD is
Maximum route depth value in energy range, MNID is the corresponding node number of Minimal routing pathdepth node, and MXID is most main road
By the corresponding node number of pathdepth node；If not corresponding<SID,DID>, then the information that the packet is extracted will
Recorded as new information in route depth neighbor table DNT；
Step 3：At the time of some is specific, if downstream node have received the data of upstream node, detection finds signal intensity
Lower than threshold value, the downstream node will broadcast a Help packet, and Help packets are used to notify neighbor node to help thereon
Trip node sets up a new route；
Step 4：Some node have received Help packets, by MXD, MND for being stored in itself route depth information table DNT with
Route depth Depth in Help packets is compared；Once meeting the requirements, route repair is carried out；So, link down is pre-
Survey and route repair just completes one action, it is ensured that link is repaired before breaking；
Wherein, AODV refers to demand distance vector.
2. link down prediction and restorative procedure according to claim 1 based on AODV, it is characterised in that the step
4 include following route repair mechanism step：
Step 4.1：Some node is received after Help packets, same in retrieval route depth information table DNT<SID,DID>
In MND and MXD values, make MND the and MXD values compared with the route depth Depth carried in Help packets；
Step 4.2：If MND ﹤ Depth ﹤ MXD, illustrate in this node energy range, on the route path from SID to DID,
It can communicate to the upstream and downstream node for the node for sending Help packets；When carrying out link repair, directly with upstream and downstream node
Set up new route；
Step 4.3：If Depth≤MND, or Depth≤MXD, then explanation sends the node of Help packets in the node
On energy range border or outside border；Related data in route depth information table DNT is then updated, without route repair；
Step 4.4：In the case where that can carry out route repair, the node updates next-hop node of oneself is MNID, is notified
Upstream node MXID updates its next-hop node for this node.
3. link down prediction and restorative procedure according to claim 2 based on AODV, it is characterised in that described section
Point route depth neighbor table DNT, specifically, the route depth neighbor table DNT of each node includes：
Source node SID in-routed path；
Destination node DID in-routed path；
Minimal routing depth value MND in-energy range；
The corresponding node MNID of-Minimal routing pathdepth node；
Maximum route depth value MXD in-energy range；
The corresponding node MXID of-maximum routed path depth node.
4. link down prediction and restorative procedure according to claim 2 based on AODV, it is characterised in that the Help
Packet includes：The route depth Depth of sending node itself, the source node number for routeing path, destination node number.
5. link down prediction and restorative procedure according to claim 2 based on AODV, it is characterised in that described road
After depth Depth is compared with MND, MXD, if not meeting the requirement of route repair mechanism, route depth information can be updated
Corresponding route depth information in table DNT.
6. link down prediction and restorative procedure according to claim 2 based on AODV, it is characterised in that a plurality of having
In the case that repair path can be selected, most short repair path is selected.
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 CN104023349A (en) | 2014-09-03 |
| CN104023349B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017063866A1 (en) * | 2015-10-13 | 2017-04-20 | Philips Lighting Holding B.V. | Unicast message routing using repeating nodes |
| CN111148175B (en) * | 2019-12-30 | 2023-02-07 | 沈阳理工大学 | 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路由协议;朱广荣等;《机电产品开发与创新》;20100531;第23卷(第3期);第126-128页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104023349A (en) | 2014-09-03 |
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 | |
| CN101436997B (en) | Method for repairing route based on AODV and link fault type | |
| WO2011013165A1 (en) | Node device, storage medium, and method for transmitting frame | |
| CN106888490A (en) | The method for routing and device of a kind of wireless self-networking | |
| CN104283789B (en) | Route convergent method and system | |
| CN102202333B (en) | Routing method of wireless ad hoc network used for small satellite constellation communication | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| CN102802228A (en) | AdHoc network multipath routing method oriented to link stability | |
| CN106131916A (en) | A kind of wireless network method for routing foundation based on ant group algorithm | |
| CN108055684A (en) | A kind of aviation method for self-organizing network routing | |
| CN106100720A (en) | The fast route convergence optimization method of LEO/MEO satellite network | |
| CN101150518A (en) | A method for route establishment under unidirectional link environment | |
| CN101827413A (en) | Dynamic multipath routing algorithm based on mobility prediction | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN104023349B (en) | Link down prediction and restorative procedure based on AODV | |
| CN101610561A (en) | A kind of wireless sensor network multi-path routing mechanism of supporting division of valid domain | |
| CN106604350A (en) | Method for building tree-shaped route in wireless Ad Hoc network for power distribution and utilization | |
| CN101309217B (en) | Network multipath routing method based on AD HOC on basis of bidirectional rerouting | |
| CN102573000B (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| CN104811990B (en) | The HR-WPAN Mesh network high usage route restorative procedure rebuild based on adaptive two-way approach | |
| CN109787838B (en) | Method for avoiding fault relay node in multi-hop network | |
| CN107172676B (en) | Wireless sensor network routing method based on node redundancy and graph coloring algorithm | |
| CN103491596B (en) | A kind of micro power radio communication method | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170926 Termination date: 20200519 |