CN102685861B - Method and device for collecting data by sink nodes of wireless sensor network - Google Patents
Method and device for collecting data by sink nodes of wireless sensor network Download PDFInfo
- Publication number
- CN102685861B CN102685861B CN201210146641.9A CN201210146641A CN102685861B CN 102685861 B CN102685861 B CN 102685861B CN 201210146641 A CN201210146641 A CN 201210146641A CN 102685861 B CN102685861 B CN 102685861B
- Authority
- CN
- China
- Prior art keywords
- node
- dominating set
- connected dominating
- minimum connected
- shortest
- 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
Abstract
The invention relates to a method and device for collecting data by sink nodes of a wireless sensor network, belonging to the technical field of network communication. The method comprises the following steps of: firstly, generating a network topology of sensor nodes according to position information and communication radiuses of the sensor nodes and determining a minimum connected dominating set according to the generated network topology; then acquiring the shortest traversal path length of the minimum connected dominating set according to a TSP (Travelling Salesman Problem); and finally, if the shortest traversal path length of the minimum connected dominating set is smaller than or equal to a threshold value, considering the minimum connected dominating set as a sink node set, and collecting data of all sink nodes in the sink node set through the shortest traversal path of the minimum connected dominating set. According to the embodiment of the invention, multi-hop transmission of a wireless sensor is effectively reduced under the condition of ensuring the data delay requirement in the sensor network, the data transmission accuracy is ensured and the energy consumption is reduced.
Description
Technical field
The present invention relates to a kind of wireless sensor network sink node and collect method and the device of data, belong to network communications technology field.
Background technology
In sensor network, node by variety of way be deployed in a large number perceived object inner or near, these nodes form wireless network by Ad hoc mode, with specific information in the mode perception, acquisition and processing network's coverage area of cooperation, can realize the collection at any time of anywhere information, process and analyze.The structure of a typical sensor network generally comprises sensor node or group of sensor node, sink node, the Internet and user interface etc., and wherein sink node refers to aggregation node at wireless sensor network, is mainly responsible for being connected of sensor network and outer net.
Because the energy content of battery of sensor node is limited, and generally can not change in actual applications battery, cause the life-span of wireless sensor network generally shorter, therefore save energy consumption is the matter of utmost importance of wireless sensor network research always.In wireless sensor network, in order to save the method that transmission energy consumption generally adopts be at present: first, sensor node is communicated by letter mutually and is formed net and be connected to sink node by the mode of multi-hop, then, sink node is collected after the data of all nodes, completes and the connection of outer net by gateway.But due to the restriction of the factors such as the battery flying power of the speed of touring around path, sink node, sensor node buffer size and the sink node of sink node, cause sink node can not travel through each sensor node to carry out the collection of data, add sink node travel through whole monitored area data need (generally need several hours) for a long time and the larger factor of time delay of wireless sensor network itself, so adopt, to carry out in this way data transmission delay serious, and easily cause sensor node to receive error in data.
Summary of the invention
The invention provides a kind of method and device, with solve sink node in prior art can not collecting sensor network in the data of each sensor node and the problem such as data transmission delay is serious, the present invention adopts following technical scheme for this reason:
Wireless sensor network sink node is collected a method for data, comprising:
Generate the network topological diagram of sensor node according to the positional information of sensor node and communication radius, and determine minimum connected dominating set according to the network topological diagram generating;
Obtain the shortest traverse path length of described minimum connected dominating set according to traveling salesman problem TSP;
If the shortest traverse path length of described minimum connected dominating set is less than or equal to threshold value, described minimum connected dominating set is aggregation node collection, and sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of described minimum connected dominating set.
Wireless sensor network sink node is collected a device for data, it is characterized in that, comprising:
Topological diagram generation module, for generating the network topological diagram of sensor node according to the positional information of sensor node and communication radius;
Minimum connected dominating set determination module, determines minimum connected dominating set for the network topological diagram generating according to described topological diagram generation module;
The shortest traverse path determination module, for obtaining the shortest traverse path length of the definite minimum connected dominating set of described minimum connected dominating set determination module according to traveling salesman problem TSP;
Judge module, whether the shortest traverse path length of determining for the shortest traverse path determination module described in judging is less than or equal to threshold value, if so, carries out spider module;
Spider module, for determining that the definite minimum connected dominating set of described minimum connected dominating set determination module is aggregation node collection, sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of the definite minimum connected dominating set of the shortest described traverse path determination module.
The technical scheme that embodiment of the present invention provides is by choosing node in minimum connected dominating set as aggregation node, so that other node sends the data to the aggregation node in its shortest jumping path, sink node only need be collected by the shortest traverse path the data of all aggregation node storages, at the multi-hop transmission that ensures effectively to have reduced under the condition that in sensor network, data delay requires wireless senser, not only ensure the accuracy of transmission data but also saved energy consumption.
Brief description of the drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the present invention, below the accompanying drawing of required use during embodiment is described is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is that a kind of wireless sensor network sink node of the present invention is collected the method flow schematic diagram of data;
Fig. 2 is that the present invention is laid in the interior method flow schematic diagram as example sink node collection data of square area of M × M square metre at random taking N sensor node;
Fig. 3 is that a kind of wireless sensor network sink node of the present invention is collected the apparatus structure schematic diagram of data.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiment.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
A kind of wireless sensor network sink node providing in embodiment of the present invention is collected the method for data, as shown in Figure 1, comprising:
11, according to the network topological diagram of the positional information of sensor node and communication radius generation sensor node.
12, determine minimum connected dominating set according to the network topological diagram generating.
13, obtain the shortest traverse path length of described minimum connected dominating set according to traveling salesman problem TSP (Traveling Salesman Problem).
If the shortest traverse path length of 14 described minimum connected dominating sets is less than or equal to threshold value, described minimum connected dominating set is aggregation node collection, and sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of described minimum connected dominating set.
Particularly, threshold value is sink node maximum path traversal length, is specially the translational speed of sink node and the product of wireless sensor network maximum delay patient time.
Further, if the shortest traverse path length of described minimum connected dominating set is greater than threshold value, calculate the weight of each node in described minimum connected dominating set, the weight of the each node calculating is compared, the node of selecting weight minimum shifts out described minimum connected dominating set, and again perform step 13, until the shortest traverse path length of the minimum connected dominating set obtaining is less than or equal to threshold value, described minimum connected dominating set is aggregation node collection, sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of described minimum connected dominating set.
Particularly, calculate the weight w (x) of each node in described minimum connected dominating set, comprising:
Wherein,
x represents a node in described minimum connected dominating set, and U represents minimum connected dominating set, and V represents the sensor node in sensor network, and TSP (U) represents the shortest traverse path length of described minimum connected dominating set,
represent that sensor node is to the total jumping figure of transmission of node in described minimum connected dominating set from sensor network.
Particularly, in above-mentioned Weighting type, point subrepresentation is when removing from minimum connected dominating set after this node x, the general sensor nodes that whole network newly increases is to the route cost of each aggregation node in minimum connected dominating set, and denominator represents to remove from minimum connected dominating set the traverse path length that can save after this node x.Can see, when removing after this node x, if the value of molecular moiety is less, and the value of denominator part is larger, the value of w (x) is less, at this moment show that removing of node x not only makes general sensor nodes increase little to the route cost of each aggregation node in minimum connected dominating set, and the traverse path that makes Sink node compare remove before this node x shorter, that is to say the restriction that can reach as early as possible with the least possible route cost traverse path length that removes of node x, under the condition that limits traverse path length, travel through aggregation node as much as possible simultaneously.This shows, node that at every turn should weight selection minimum removes.
The embodiment of the present invention is laid in the square area of M × M square metre (wherein N and M are positive integer) as example at random taking N sensor node, suppose that the sensor node after laying can not move, Sink node can move freely in this square area, and this N sensor node periodically produces Monitoring Data, and (these Monitoring Data allow certain time delay, the new data that produce must be uploaded in this time delay period), illustrate as shown in Figure 2 sink node and collect the method for data, comprising:
21, according to the network topological diagram G (V, E) of the positional information of sensor node and communication radius generation sensor node.
Wherein, V is the sensor node collection in euclidean (geometric one) plane, represents the position of sensor node in network, and E is the set on limit, represents the topology of wireless sensor network, and if only if sensor node V
iand V
jin communication range each other time, (V
i, V
j) ∈ E.
22, determine minimum connected dominating set according to the network topological diagram generating.
23, obtain the shortest traverse path length of minimum connected dominating set according to TSP.
Whether the shortest traverse path length that 24, determining step 23 obtains is less than or equal to threshold value, if so, performs step 25; If not, perform step 26.
25,, using minimum connected dominating set as aggregation node collection, the shortest traverse path that sink node obtains by step 23 is collected the data of the concentrated each aggregation node of this aggregation node.
26, calculate the weight of each node in minimum connected dominating set, the weight of the each node calculating is compared, select the node of weight minimum to shift out in the definite minimum connected dominating set of step 22, and the minimum connected dominating set shifting out after this node is re-executed to step 23 as new minimum connected dominating set.
The embodiment of the present invention is by selecting operative sensor node as aggregation node, and obtain accessing the shortest path of each aggregation node by TSP, other sensor node can be sent to aggregation node nearby by data by the mode of multi-hop, and aggregation node carries out data fusion and becomes to wrap and be temporary in an aggregation node.Aggregation node can be regarded as to the leader cluster node in traditional hierarchical wireless sensor network, general sensor nodes is seen the member node of cluster.Sink node is accessed each aggregation node successively according to the route of design, in the time that Sink node motion arrives aggregation node, aggregation node sends to Sink node the data of storage, and Sink node is collected after the data of all aggregation nodes, the disposable data data processing centre that sends to.The embodiment of the present invention has designed one and has combined the heuritic approach of consideration sensor node to aggregation node route and path, mobile base station (sink node).Based on minimum connected dominating set, select minimum connected dominating set node, and according to the weight of each node in the weight calculation connected dominating set of definition, remove each time the node of weight minimum in a dominant set, until the mobile route length of mobile base station maximum length under ductility requirement condition while being less than or equal to, then using the connected dominating set finally obtaining as aggregation node collection, other sensor node obtains from the route of own nearest aggregation node by shortest path first; Must be toured around to mobile base station the minimal path of each aggregation node by TSP algorithm simultaneously.The embodiment of the present invention can select aggregation node effectively, to reduce as much as possible the transmission jump number of network, thereby can save network energy consumption prolong network lifetime.
The specific embodiment of the present invention also provides a kind of wireless sensor network sink node to collect the device of data, as shown in Figure 3, comprising:
Topological diagram generation module 31, for generating the network topological diagram of sensor node according to the positional information of sensor node and communication radius.
Minimum connected dominating set determination module 32, determines minimum connected dominating set for the network topological diagram generating according to described topological diagram generation module 31.
The shortest traverse path determination module 33, for obtaining the shortest traverse path length of the definite minimum connected dominating set of described minimum connected dominating set determination module 32 according to traveling salesman problem TSP.
Whether judge module 34, be less than or equal to threshold value for the shortest traverse path length that the shortest traverse path determination module 33 is determined described in judging, if so, carries out spider module 35.
Particularly, threshold value is sink node maximum path traversal length, is specially the translational speed of sink node and the product of wireless sensor network maximum delay patient time.
Spider module 35, for determining that the definite minimum connected dominating set of described minimum connected dominating set determination module 32 is aggregation node collection, sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of the definite minimum connected dominating set of the shortest described traverse path determination module 33.
As optionally, described judge module 34, if be also greater than threshold value for the shortest traverse path length of the definite minimum connected dominating set of the shortest described traverse path determination module 33, carries out weight computation module 36.
Weight computation module 36, for calculating the weight of the definite each node of minimum connected dominating set of described minimum connected dominating set determination module 32;
Particularly, calculate the weight w (x) of each node in described minimum connected dominating set, comprising:
Wherein,
x represents a node in described minimum connected dominating set, and U represents minimum connected dominating set, and V represents the sensor node in sensor network, and TSP (U) represents the shortest traverse path length of described minimum connected dominating set,
represent that sensor node is to the total jumping figure of transmission of node in described minimum connected dominating set from sensor network.
Alternative module 37, the weight that is used for each node that described weight computation module 36 is calculated compares, the node of selecting weight minimum shifts out the definite minimum connected dominating set of minimum connected dominating set determination module 32, and re-executes the shortest traverse path determination module 33.
The specific implementation of the processing capacity of the each module comprising in said apparatus is described in embodiment of the method before, is no longer repeated in this description at this.
It should be noted that in said apparatus embodiment, included modules is just divided according to function logic, but is not limited to above-mentioned division, as long as can realize corresponding function; In addition, the concrete title of each functional module also, just for the ease of mutual differentiation, is not limited to protection scope of the present invention.
In addition, one of ordinary skill in the art will appreciate that all or part of step realizing in above-mentioned each embodiment of the method is can carry out the hardware that instruction is relevant by program to complete, corresponding program can be stored in a kind of computer-readable recording medium, the above-mentioned storage medium of mentioning can be read-only memory, disk or CD etc.
The above; it is only preferably embodiment of the present invention; but protection scope of the present invention is not limited to this; any be familiar with those skilled in the art the embodiment of the present invention disclose technical scope in; the variation that can expect easily or replacement, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (4)
1. wireless sensor network sink node is collected a method for data, it is characterized in that, comprising:
Generate the network topological diagram of sensor node according to the positional information of sensor node and communication radius, and determine minimum connected dominating set according to the network topological diagram generating;
Obtain the shortest traverse path length of described minimum connected dominating set according to traveling salesman problem TSP;
If the shortest traverse path length of described minimum connected dominating set is less than or equal to threshold value, described minimum connected dominating set is aggregation node collection, and sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of described minimum connected dominating set;
If the shortest traverse path length of described minimum connected dominating set is greater than threshold value, calculate the weight of each node in described minimum connected dominating set, the weight of the each node calculating is compared, the node of selecting weight minimum shifts out described minimum connected dominating set, and described in regaining, shift out the shortest traverse path length of the minimum connected dominating set after node, until the shortest traverse path length of the minimum connected dominating set obtaining is less than or equal to threshold value, described minimum connected dominating set is aggregation node collection, sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of described minimum connected dominating set,
The weight w (x) of each node in the described minimum connected dominating set of described calculating, comprising:
Wherein,
, x represents a node in described minimum connected dominating set, and U represents minimum connected dominating set, and V represents the sensor node in sensor network, and TSP (U) represents the shortest traverse path length of described minimum connected dominating set,
represent that sensor node is to the total jumping figure of transmission of node in described minimum connected dominating set from sensor network.
2. method according to claim 1, is characterized in that, described threshold value is sink node maximum path traversal length, is specially the translational speed of sink node and the product of wireless sensor network maximum delay patient time.
3. wireless sensor network sink node is collected a device for data, it is characterized in that, comprising:
Topological diagram generation module, for generating the network topological diagram of sensor node according to the positional information of sensor node and communication radius;
Minimum connected dominating set determination module, determines minimum connected dominating set for the network topological diagram generating according to described topological diagram generation module;
The shortest traverse path determination module, for obtaining the shortest traverse path length of the definite minimum connected dominating set of described minimum connected dominating set determination module according to traveling salesman problem TSP;
Judge module, whether the shortest traverse path length of determining for the shortest traverse path determination module described in judging is less than or equal to threshold value, if so, carries out spider module;
Spider module, for determining that the definite minimum connected dominating set of described minimum connected dominating set determination module is aggregation node collection, sink node is collected the data of the concentrated each aggregation node of described aggregation node by the shortest traverse path of the definite minimum connected dominating set of the shortest described traverse path determination module;
Described judge module, if be also greater than threshold value for the shortest traverse path length of the definite minimum connected dominating set of the shortest described traverse path determination module, carries out weight computation module;
Weight computation module, for calculating the weight of the definite each node of minimum connected dominating set of described minimum connected dominating set determination module;
Alternative module, the weight that is used for each node that described weight computation module is calculated compares, the node of selecting weight minimum shifts out the definite minimum connected dominating set of minimum connected dominating set determination module, and re-executes the shortest traverse path determination module;
Described weight computation module, specifically for calculating the weight w (x) of each node in described minimum connected dominating set, comprising:
Wherein,
, x represents a node in described minimum connected dominating set, and U represents minimum connected dominating set, and V represents the sensor node in sensor network, and TSP (U) represents the shortest traverse path length of described minimum connected dominating set,
represent that sensor node is to the total jumping figure of transmission of node in described minimum connected dominating set from sensor network.
4. device according to claim 3, is characterized in that, threshold value described in described judge module is sink node maximum path traversal length, is specially the translational speed of sink node and the product of wireless sensor network maximum delay patient time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210146641.9A CN102685861B (en) | 2012-05-11 | 2012-05-11 | Method and device for collecting data by sink nodes of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210146641.9A CN102685861B (en) | 2012-05-11 | 2012-05-11 | Method and device for collecting data by sink nodes of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102685861A CN102685861A (en) | 2012-09-19 |
| CN102685861B true CN102685861B (en) | 2014-08-27 |
Family
ID=46817065
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210146641.9A Expired - Fee Related CN102685861B (en) | 2012-05-11 | 2012-05-11 | Method and device for collecting data by sink nodes of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102685861B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103269505A (en) * | 2013-04-02 | 2013-08-28 | 南京邮电大学 | Wireless sensor network data acquisition method based on multiple mobile factors |
| CN104539542B (en) * | 2014-12-03 | 2017-10-24 | 南京邮电大学 | A kind of low energy consumption based on mobile Sink Data Collections route tree shears method |
| CN108521634B (en) * | 2018-02-11 | 2020-09-15 | 南京邮电大学 | Mobile Sink data collection method based on energy consumption balance tree |
| CN109033125B (en) * | 2018-05-31 | 2022-05-13 | 黑龙江大学 | Time sequence data domination set information extraction method |
| CN109586957A (en) * | 2018-11-19 | 2019-04-05 | 国家电网公司 | The processing method and processing device of communication network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1917460A (en) * | 2006-09-07 | 2007-02-21 | 上海交通大学 | Distribution type structuring method for virtual backbone network in network of wireless sensor |
| US7680068B1 (en) * | 2005-09-13 | 2010-03-16 | Rockwell Collins, Inc. | System and method for artery node selection in an ad-hoc network |
-
2012
- 2012-05-11 CN CN201210146641.9A patent/CN102685861B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7680068B1 (en) * | 2005-09-13 | 2010-03-16 | Rockwell Collins, Inc. | System and method for artery node selection in an ad-hoc network |
| CN1917460A (en) * | 2006-09-07 | 2007-02-21 | 上海交通大学 | Distribution type structuring method for virtual backbone network in network of wireless sensor |
Non-Patent Citations (1)
| Title |
|---|
| Wu J，Li HL.On calculating connected dominating set for efficient routing in ad hoc wireless network.《Proceedings of 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile》.1999, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102685861A (en) | 2012-09-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102685861B (en) | Method and device for collecting data by sink nodes of wireless sensor network | |
| He et al. | A progressive approach to reducing data collection latency in wireless sensor networks with mobile elements | |
| Prabhu et al. | Mobility assisted dynamic routing for mobile wireless sensor networks | |
| Esnaashari et al. | Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach | |
| KR101912734B1 (en) | Cluster-based mobile sink location management method and apparatus for solar-powered wireless sensor networks | |
| Jawhar et al. | An efficient framework for autonomous underwater vehicle extended sensor networks for pipeline monitoring | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| CN105979488A (en) | Collaborative charging algorithm based on region partition in wireless sensor network | |
| KR101948447B1 (en) | Efficient Mobile Sink Location Management Device Using Multi-Ring in Solar-Powered Wireless Sensor Networks, Management Method and Recording Medium thereof | |
| CN106209261B (en) | The mobile data collection method of three-dimensional UASNs based on probability neighborhood grid | |
| Wu et al. | Data gathering by mobile mules in a spatially separated wireless sensor network | |
| CN106255131A (en) | Sensor network anchor point system of selection based on wireless charging | |
| Li et al. | Exploiting actuator mobility for energy-efficient data collection in delay-tolerant wireless sensor networks | |
| CN103237364B (en) | A kind of integrated wireless sensor network data collection mechanism | |
| CN103701647A (en) | Wireless network topology optimizing and generating method | |
| CN105228212A (en) | The underwater sensor network method for routing that a kind of many mobile sink node location are auxiliary | |
| Pal et al. | A Smart Framework for Enhancing the IoT Network Lifespan | |
| CN106412935B (en) | A kind of network topology structure method for building up based on Complex Networks Theory | |
| CN102446413A (en) | Method and device for acquiring path information based on switching information of mobile terminal | |
| Nandyala et al. | AUV-Aided Isolated Sub-Network Prevention for Underwater Wireless Sensor Networks | |
| Wu et al. | Path planning in mobile wireless sensor networks | |
| Elleuchi et al. | Power aware scheme for water pipeline monitoring based on Wireless Sensor Networks | |
| Bhakare et al. | Distance distribution approach of minimizing energy consumption in grid wireless sensor network | |
| Jacquet et al. | Using a token approach for the MAC layer of linear sensor networks: Impact of the node position on the packet delivery | |
| CN107294853B (en) | Power communication network path optimization method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| 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: 20140827 Termination date: 20160511 |