CN102685861A - 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
- CN102685861A CN102685861A CN2012101466419A CN201210146641A CN102685861A CN 102685861 A CN102685861 A CN 102685861A CN 2012101466419 A CN2012101466419 A CN 2012101466419A CN 201210146641 A CN201210146641 A CN 201210146641A CN 102685861 A CN102685861 A CN 102685861A
- Authority
- CN
- China
- Prior art keywords
- node
- dominating set
- connected dominating
- minimum connected
- minimum
- 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
Images
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
- Mobile Radio Communication Systems (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
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 the method and the device of data, belong to the network communications technology field.
Background technology
In sensor network; Node through variety of way be deployed in a large number by perceptive object inner or near; These nodes constitute wireless network through the self-organizing mode; With information specific in cooperation way perception, collection and the processing network's coverage area, can realize the collection at any time of anywhere information, handle 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 the sink node refers to aggregation node at wireless sensor network, and mainly responsible sensor network is connected with outer net.
Because the energy content of battery of sensor node is limited, and in practical application, generally can not change battery, cause the life-span of wireless sensor network generally shorter, therefore save the matter of utmost importance that energy consumption is wireless sensor network research always.At present in the wireless sensor network be: at first in order to save the method that the transmission energy consumption generally adopts; Sensor node mutual communication netting and the mode through multi-hop are connected to the sink node; Then, after the sink node is collected the data of all nodes, through being connected of gateway completion and outer net.But because the restriction of many factors such as battery flying power of the speed of touring around path, sink node, sensor node buffer size and the sink node of sink node; Cause the sink node can not travel through each sensor node to carry out the collection of data; Add that the data that the sink node travels through whole monitored area need (generally to need several hrs) for a long time and the bigger factor of time delay of wireless sensor network itself; So it is serious to adopt this method to carry out data transmission delay, and cause sensor node to receive error in data easily.
Summary of the invention
The invention provides a kind of method and device, with solve sink node in the prior art can not the collecting sensor network in problems such as data and the data transmission delay of each sensor node be serious, the present invention adopts following technical scheme for this reason:
A kind of wireless sensor network sink node is collected the method for data, comprising:
Generate the network topological diagram of sensor node according to the positional information of sensor node and communication radius, and confirm minimum connected dominating set according to the network topological diagram that generates;
Obtain the shortest traverse path length of said minimum connected dominating set according to traveling salesman problem TSP;
If the shortest traverse path length of said minimum connected dominating set is smaller or equal to threshold value; Then said minimum connected dominating set is the aggregation node collection, and the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of said minimum connected dominating set.
A kind of wireless sensor network sink node is collected the device of data, it is characterized in that, comprising:
The topological diagram generation module is used for according to the positional information of sensor node and the network topological diagram of communication radius generation sensor node;
The minimum connected dominating set determination module is used for confirming minimum connected dominating set according to the network topological diagram that said topological diagram generation module generates;
The shortest traverse path determination module is used for obtaining according to traveling salesman problem TSP the shortest traverse path length of the minimum connected dominating set that said minimum connected dominating set determination module confirms;
Judge module is used to judge that whether the shortest said traverse path determination module the shortest definite traverse path length is smaller or equal to threshold value, if then carry out spider module;
Spider module; Be used for confirming that the minimum connected dominating set that said minimum connected dominating set determination module is confirmed is the aggregation node collection, the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of the minimum connected dominating set that the shortest said traverse path determination module is confirmed.
The technical scheme that embodiment of the present invention provides is through choosing node in the minimum connected dominating set as aggregation node; So that other node sends the data to its shortest aggregation node of jumping the path; The sink node only need get final product through the data of the shortest all aggregation nodes storages of traverse path collection; In guaranteeing sensor network, effectively reduced the multi-hop transmission of wireless senser under the condition of data delay property requirement, not only guaranteed the accuracy of transmission data but also saved energy consumption.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention; The accompanying drawing of required use is done to introduce simply in will describing embodiment below; Obviously, the accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills; Under the prerequisite of not paying creative work property, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is that a kind of wireless sensor network sink node of the present invention is collected the method flow sketch map of data;
To be the present invention be laid in one M * M square metre the square area with N sensor node Fig. 2 at random be the method flow sketch map of example sink node collection data;
Fig. 3 is that a kind of wireless sensor network sink node according to the invention is collected the apparatus structure sketch map of data.
Embodiment
To combine the accompanying drawing in the embodiment of the invention below, the technical scheme in the embodiment of the invention is carried out clear, intactly description, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all belong to the scope of the present invention's protection.
A kind of wireless sensor network sink node that provides in embodiment of the present invention is collected the method for data, and is as shown in Figure 1, comprising:
11, according to the positional information of sensor node and the network topological diagram of communication radius generation sensor node.
12, confirm minimum connected dominating set according to the network topological diagram that generates.
13, obtain the shortest traverse path length of said minimum connected dominating set according to traveling salesman problem TSP (Traveling Salesman Problem).
14, if the shortest traverse path length of said minimum connected dominating set smaller or equal to threshold value; Then said minimum connected dominating set is the aggregation node collection, and the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of said minimum connected dominating set.
Particularly, threshold value is a 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 said minimum connected dominating set is greater than threshold value; Then calculate the weight of each node in the said minimum connected dominating set, the weight of each node that calculates is compared, select the minimum node of weight and shift out said minimum connected dominating set; And execution in step 13 again; Smaller or equal to threshold value, then said minimum connected dominating set is the aggregation node collection up to the shortest traverse path length of the minimum connected dominating set that obtains, and the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of said minimum connected dominating set.
Particularly, calculate the weight w (x) of each node in the said minimum connected dominating set, comprising:
Wherein,
x representes a node in the said minimum connected dominating set; U representes minimum connected dominating set; V representes the sensor node in the sensor network; The total jumping figure of transmission of the shortest traverse path length of the said minimum connected dominating set of TSP (U) expression,
expression sensor node node in the said minimum connected dominating set from sensor network.
Particularly; Divide subrepresentation in the above-mentioned Weighting type after from minimum connected dominating set, removing this node x; The route cost of the general sensor nodes that whole network increases newly each aggregation node in the minimum connected dominating set, and denominator representes from minimum connected dominating set, to remove the traverse path length that can save behind this node x.Can see; After removing this node x; If the value of molecular moiety is less, and the value of denominator part is bigger, and then the value of w (x) is less; At this moment it is little to show that removing of node x makes that not only the route cost of general sensor nodes each aggregation node in the minimum connected dominating set increases; And make the traverse path of Sink node compare to remove before this node x shorter, that is to say the restriction that can reach traverse path length as early as possible that removes of node x, simultaneously traversal aggregation node as much as possible under the condition that limits traverse path length with the least possible route cost.This shows, should remove by the minimum node of weight selection at every turn.
The embodiment of the invention is laid at random with N sensor node that (wherein N and M are positive integer) is example in one M * M square metre the square area; Sensor node after supposing to lay can not move; The 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 promptly new data that produce must be uploaded in this time delay period), the method that specifies sink node collection data as shown in Figure 2 comprises:
21, according to the positional information of sensor node and communication radius generate sensor node network topological diagram G (V, E).
Wherein, V is the sensor node collection on euclidean (geometric a kind of) plane, represents the position of sensor node in the 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 the time of in communication range each other, (V
i, V
j) ∈ E.
22, confirm minimum connected dominating set according to the network topological diagram that generates.
23, obtain the shortest traverse path length of minimum connected dominating set according to TSP.
24, whether the shortest traverse path length of determining step 23 acquisitions is smaller or equal to threshold value, if then execution in step 25; If not, execution in step 26 then.
25, with minimum connected dominating set as the aggregation node collection, the sink node is collected the data that this aggregation node is concentrated each aggregation node through the shortest traverse path that step 23 obtains.
26, calculate the weight of each node in the minimum connected dominating set; The weight of each node that calculates is compared; Select the minimum node of weight to shift out in the minimum connected dominating set that step 22 confirms, and will shift out minimum connected dominating set behind this node as new minimum connected dominating set execution in step again 23.
The embodiment of the invention is through selecting the operative sensor node as aggregation node; And obtain visiting the shortest path of each aggregation node through TSP; Other sensor node can be sent to aggregation node nearby with data through the mode of multi-hop, and aggregation node carries out data fusion and becomes to wrap and be temporary in an aggregation node.Can regard aggregation node as in traditional level type wireless sensor network leader cluster node, general sensor nodes is seen the member node of cluster.The Sink node is visited each aggregation node successively according to the route of design; When the Sink node motion arrives aggregation node; Aggregation node sends to the Sink node to the data of storage, after the Sink node is collected the data of all aggregation nodes, the disposable data processing centre that sends to of data.The embodiment of the invention has designed a kind of the associating and has considered the heuritic approach of sensor node to aggregation node route and path, mobile base station (sink node).Based on minimum connected dominating set; Select the minimum connected dominating set node; And according to the weight of each node in the weight calculation connected dominating set of definition, remove the minimum node of weight in the dominant set each time, up to the mobile route length of mobile base station smaller or equal to the time maximum length under the ductility requirement condition; The connected dominating set that will obtain at last then is as the aggregation node collection, and other sensor node obtains the route from own nearest aggregation node through shortest path first; Must tour around the minimal path of each aggregation node simultaneously to the mobile base station by the TSP algorithm.The embodiment of the invention can select aggregation node effectively, reducing the transmission jump number of network as much as possible, thereby can save the network energy consumption and prolong network life.
The device that embodiment of the present invention also provides a kind of wireless sensor network sink node to collect data, as shown in Figure 3, comprising:
Topological diagram generation module 31 is used for according to the positional information of sensor node and the network topological diagram of communication radius generation sensor node.
Minimum connected dominating set determination module 32 is used for confirming minimum connected dominating set according to the network topological diagram that said topological diagram generation module 31 generates.
The shortest traverse path determination module 33 is used for obtaining according to traveling salesman problem TSP the shortest traverse path length of the minimum connected dominating set that said minimum connected dominating set determination module 32 confirms.
Particularly, threshold value is a 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.
As optional, said judge module 34 also is used for if the shortest traverse path length of the minimum connected dominating set that the shortest said traverse path determination module 33 is confirmed greater than threshold value, is then carried out weight computation module 36.
Particularly, calculate the weight w (x) of each node in the said minimum connected dominating set, comprising:
Wherein,
x representes a node in the said minimum connected dominating set; U representes minimum connected dominating set; V representes the sensor node in the sensor network; The total jumping figure of transmission of the shortest traverse path length of the said minimum connected dominating set of TSP (U) expression,
expression sensor node node in the said minimum connected dominating set from sensor network.
Relatively select module 37; The weight of each node that is used for said weight computation module 36 is calculated compares; Select the minimum node of weight and shift out the minimum connected dominating set that minimum connected dominating set determination module 32 is confirmed, and carry out the shortest traverse path determination module 33 again.
The concrete implementation of the processing capacity of each module that comprises in the said apparatus is described in method embodiment before, no longer is repeated in this description at this.
It should be noted that among the said apparatus embodiment that each included module is just divided according to function logic, but is not limited to above-mentioned division, as long as can realize function corresponding; 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 that realizes among above-mentioned each method embodiment is to instruct relevant hardware to accomplish through program; Corresponding program can be stored in a kind of computer-readable recording medium; The above-mentioned storage medium of mentioning can be a read-only memory, disk or CD etc.
The above; Be merely the preferable embodiment of the present invention; But protection scope of the present invention is not limited thereto; Any technical staff who is familiar with the present technique field is in the technical scope that the embodiment of the invention discloses, and the variation that can expect easily or replacement all should be encompassed within 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 (8)
1. the method for wireless sensor network sink node collection data 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 confirm minimum connected dominating set according to the network topological diagram that generates;
Obtain the shortest traverse path length of said minimum connected dominating set according to traveling salesman problem TSP;
If the shortest traverse path length of said minimum connected dominating set is smaller or equal to threshold value; Then said minimum connected dominating set is the aggregation node collection, and the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of said minimum connected dominating set.
2. method according to claim 1 is characterized in that, also comprises:
If the shortest traverse path length of said minimum connected dominating set is greater than threshold value; Then calculate the weight of each node in the said minimum connected dominating set; The weight of each node that calculates is compared; Select the minimum node of weight and shift out said minimum connected dominating set, and regain the said the shortest traverse path length that shifts out the minimum connected dominating set behind the node, up to the shortest traverse path length of the minimum connected dominating set that obtains smaller or equal to threshold value; Then said minimum connected dominating set is the aggregation node collection, and the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of said minimum connected dominating set.
3. method according to claim 2 is characterized in that, the weight w (x) of each node in the said minimum connected dominating set of said calculating comprises:
Wherein,
x representes a node in the said minimum connected dominating set; U representes minimum connected dominating set; V representes the sensor node in the sensor network; The total jumping figure of transmission of the shortest traverse path length of the said minimum connected dominating set of TSP (U) expression,
expression sensor node node in the said minimum connected dominating set from sensor network.
4. according to each described method of claim 1-3, it is characterized in that said threshold value is a 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.
5. a wireless sensor network sink node is collected the device of data, it is characterized in that, comprising:
The topological diagram generation module is used for according to the positional information of sensor node and the network topological diagram of communication radius generation sensor node;
The minimum connected dominating set determination module is used for confirming minimum connected dominating set according to the network topological diagram that said topological diagram generation module generates;
The shortest traverse path determination module is used for obtaining according to traveling salesman problem TSP the shortest traverse path length of the minimum connected dominating set that said minimum connected dominating set determination module confirms;
Judge module is used to judge that whether the shortest said traverse path determination module the shortest definite traverse path length is smaller or equal to threshold value, if then carry out spider module;
Spider module; Be used for confirming that the minimum connected dominating set that said minimum connected dominating set determination module is confirmed is the aggregation node collection, the sink node is collected the data that said aggregation node is concentrated each aggregation node through the shortest traverse path of the minimum connected dominating set that the shortest said traverse path determination module is confirmed.
6. device according to claim 5 is characterized in that, said judge module also is used for if the shortest traverse path length of the minimum connected dominating set that the shortest said traverse path determination module is confirmed greater than threshold value, is then carried out weight computation module;
Weight computation module is used for calculating the weight of each node of minimum connected dominating set that said minimum connected dominating set determination module confirms;
Relatively select module; The weight of each node that is used for said weight computation module is calculated compares; Select the minimum node of weight and shift out the minimum connected dominating set that the minimum connected dominating set determination module is confirmed, and carry out the shortest traverse path determination module again.
7. device according to claim 6 is characterized in that, said weight computation module specifically is used for calculating the weight w (x) of said each node of minimum connected dominating set, comprising:
Wherein,
x representes a node in the said minimum connected dominating set; U representes minimum connected dominating set; V representes the sensor node in the sensor network; The total jumping figure of transmission of the shortest traverse path length of the said minimum connected dominating set of TSP (U) expression,
expression sensor node node in the said minimum connected dominating set from sensor network.
8. according to each described device of claim 5-7; It is characterized in that; Threshold value described in the said judge module is a 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 true CN102685861A (en) | 2012-09-19 |
| CN102685861B 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) |
Cited By (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 |
| CN104539542A (en) * | 2014-12-03 | 2015-04-22 | 南京邮电大学 | Low-energy-consumption routing tree pruning method based on mobile Sink data collection |
| CN108521634A (en) * | 2018-02-11 | 2018-09-11 | 南京邮电大学 | A kind of mobile Sink methods of data capture based on energy consumption balance tree |
| CN109033125A (en) * | 2018-05-31 | 2018-12-18 | 黑龙江大学 | 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》 * |
Cited By (8)
| 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 |
| CN104539542A (en) * | 2014-12-03 | 2015-04-22 | 南京邮电大学 | Low-energy-consumption routing tree pruning method based on mobile Sink data collection |
| CN104539542B (en) * | 2014-12-03 | 2017-10-24 | 南京邮电大学 | A kind of low energy consumption based on mobile Sink Data Collections route tree shears method |
| CN108521634A (en) * | 2018-02-11 | 2018-09-11 | 南京邮电大学 | A kind of mobile Sink methods of data capture based on energy consumption balance tree |
| CN108521634B (en) * | 2018-02-11 | 2020-09-15 | 南京邮电大学 | Mobile Sink data collection method based on energy consumption balance tree |
| CN109033125A (en) * | 2018-05-31 | 2018-12-18 | 黑龙江大学 | Time sequence data domination set information extraction method |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102685861B (en) | 2014-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dong et al. | UAV-assisted data gathering in wireless sensor networks | |
| CN102685861A (en) | Method and device for collecting data by sink nodes of wireless sensor network | |
| CN104640168B (en) | Vehicular ad hoc network method for routing based on Q study | |
| Kashi et al. | Connectivity weakness impacts on coordination in wireless sensor and actor networks | |
| Kamble et al. | Systematic analysis and review of path optimization techniques in WSN with mobile sink | |
| KR101912734B1 (en) | Cluster-based mobile sink location management method and apparatus for solar-powered wireless sensor networks | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| Siew et al. | Cluster heads distribution of wireless sensor networks via adaptive particle swarm optimization | |
| CN107919918A (en) | The reliable acquisition method of Internet of Things data under a kind of mobile node auxiliary water | |
| CN105429877A (en) | Optimal path searching method based on particle swarm optimization | |
| CN110049448A (en) | A kind of wireless sense network method of data capture based on unmanned aerial vehicle group | |
| Punriboon et al. | Fuzzy logic-based path planning for data gathering mobile sinks in WSNs | |
| 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 | |
| Bendjima et al. | Optimal itinerary planning for mobile multiple agents in WSN | |
| Erim et al. | Optimized mobility models for disaster recovery using UAVs | |
| Li et al. | Exploiting actuator mobility for energy-efficient data collection in delay-tolerant wireless sensor networks | |
| Shrivastava | A Hybrid Sink Repositioning Technique for Data Gathering in Wireless Sensor Networks | |
| CN103237364B (en) | A kind of integrated wireless sensor network data collection mechanism | |
| CN105634873B (en) | A kind of method of evaluating performance and system of bullet train operating environment monitoring network | |
| CN103826279A (en) | Mobile data collection method with minimized concurrent data uploading and collecting cost | |
| Nandyala et al. | AUV-Aided Isolated Sub-Network Prevention for Underwater Wireless Sensor Networks | |
| Wu et al. | Path planning in mobile wireless sensor networks | |
| Magadán et al. | Clustered wsn for building energy management applications |
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 |
Granted publication date: 20140827 Termination date: 20160511 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |