CN107911834A - Lifetime optimal DAG building methods in data-centered wireless sensor network - Google Patents
Lifetime optimal DAG building methods in data-centered wireless sensor network Download PDFInfo
- Publication number
- CN107911834A CN107911834A CN201711455034.XA CN201711455034A CN107911834A CN 107911834 A CN107911834 A CN 107911834A CN 201711455034 A CN201711455034 A CN 201711455034A CN 107911834 A CN107911834 A CN 107911834A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- network
- dag
- lifetime
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Nitrogen And Oxygen Or Sulfur-Condensed Heterocyclic Ring Systems (AREA)
- Mobile Radio Communication Systems (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
The invention belongs to wireless sensor network technology field, disclose lifetime optimal DAG building methods in a kind of data-centered wireless sensor network, DAG allows each node in network to have multiple father nodes and multiple child nodes, each intermediate node can select arbitrary father's node send oneself it is locally generated either forward the data packet received at child nodes, all nodes load in network being more uniformly distributed in network.What the present invention constructed is data-centered route, and the change of data volume in network is included among the design of routing infrastructure.In each sampling period, which data is sent actually, is driven in itself by data completely, and only can be just determined after sensor node perceives data.No matter how the data pattern in network changes, and DAG structures can balance the data volume in network, optimize network lifetime.
Description
Technical Field
The invention belongs to the technical field of Wireless Sensor Networks, and particularly relates to a method for constructing a Directed Acyclic Graph (Directed Acyclic Graph) DAG (direct Acyclic Graph) in a Wireless Sensor Network (WSNs) with data as a center.
Background
The wireless sensor network is composed of densely deployed wireless sensor nodes. Such networks are generally installed in natural areas, and changes in physical quantities in target environments are monitored through mutual cooperation between nodes. Such a network is generally composed of a base station and a plurality of sensor nodes. The sensor nodes are powered by a battery, the base station is powered by a power supply, and the sensor nodes and the base station are self-organized into a network in a wireless communication mode. In each sampling period, the data collected by the sensor nodes needs to be transmitted to the central node, so that the user can conveniently further process the data. Such continuous data collection often extracts a large amount of information from the deployment area of the network, but is very power consuming. Once a node in the network consumes all of the power, the entire network is no longer connected, thereby dividing the network into several disconnected regions. It is of interest to save network power in continuous data collection to extend the lifetime of the network. In the data collection process, the energy use efficiency of the nodes is influenced by the routing structure. Different routing structures will affect the number of data packets received by each node and to be sent, thereby affecting the energy utilization of the node. Here, a definition of a data pattern is given, that is, a distribution of wireless sensor nodes that transmit data to a sink node in each sampling period. Most of the existing routing works mostly ignore the change of data, and are used to process the complete data pattern, that is, each node in the network will send a data packet to the sink node in each sampling period. However, in continuous sensor data collection, the data pattern in the network is dynamically changing, and such changes are completely unpredictable. Such as: in adjacent sampling periods, data acquired by each sensor node is usually relatively stable or fluctuates only within a certain range. In order to save electric quantity, only when the deviation between the new sampling numerical value and the data reported last time is large to a certain degree, the node needs to send the data collected this time to the base station. Before a node samples the environment, each sensor node cannot calculate in advance what the deviation of its two reported data is. In practice, only relatively important data is reported to the sink node in order to save energy, but the selection of reported data is driven entirely by the data itself and can only be determined if and only if the data is sensed by the sensor. This is known as a data-centric sensor network.
The ever changing network data patterns greatly increase the difficulty of designing energy efficient routing protocols. This is because different data patterns in the network may cause each node to spend different percentages of energy on receiving, transmitting, and idle listening of data packets. Therefore, different data patterns need to be matched with different routing structures to extend the lifetime of the network. For example, when there are many nodes sending data in the network, receiving and transmitting data packets usually take a considerable weight in the energy consumption of the sensor nodes. In this case, it is very important to balance the data amount of each node. On the other hand, when there are fewer nodes sending data in the network, the energy consumption of the sensor nodes is usually dominated by idle listening. At this time, the sensor nodes around the sink node are no longer the bottleneck of energy consumption. Making the energy spent by each node in idle sensing as small as possible becomes a considerable consideration in designing routing structures. Therefore, in order to cope with dynamic data patterns, it is important to design a routing structure capable of balancing energy costs of different nodes, and to extend the lifetime of a network.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a method for constructing an optimal DAG (demand-oriented architecture) in a wireless sensor network with data as a center.
The invention has two significant advantages: (a) In a directed acyclic graph DAG network, each node has multiple parent nodes and multiple child nodes, and each intermediate node can select any parent node to send a packet generated locally by itself or received from a child node. Compared with the tree structure in which each node only has a single parent node, the DAG structure can better balance loads and prolong the life span. (b) the amount of data in the network dynamically changes: the set of wireless sensor nodes in the network that generate local data packets changes dynamically at each sampling period, and this change cannot be predicted. At each sampling period, which data to send is driven entirely by the data itself and can only be determined after the sensor node senses the data.
Further, the method for constructing the optimal DAG for the lifetime in the data-centric wireless sensor network comprises the following steps:
modeling a problem with an optimal DAG structure in a life period without considering an idle monitoring condition to form a linear programming problem;
step two, incorporating energy for idle interception into the expression of the life-span optimization problem, and modeling the problem as an integer programming problem;
and step three, transforming the Integer Programming problem into a solvable Mixed Linear Integer Programming MILP (Mixed Linear Integer Programming MILP) problem through mathematical transformation.
And step four, calculating by using the current most advanced general mathematical programming solution device CPLEX, GLP, gurobi or Mosek to obtain an optimal solution by contrasting the mixed integer linear programming problem.
Specifically, in the case of no idle listening consideration, the modeling method of the problem of the optimal DAG structure in lifetime includes:
Problem-LINEAR
maximize T
condition (1) describes the restriction of the flow, where p i T is the total number of packets generated at node i during the lifetime T; condition (2) indicates that the total energy cost of node i is given by the initial energy B during the time of lifetime T i (ii) is limited; condition (3) specifies that the flow rate is positive.
Idle listening is considered next. The idea of the second step comes from the following idea: in each sampling period, all data packets sent by each sensor node i to each parent node p thereof are continuously distributed in all time slices of the link (i, p) from the first time slice of the link (i, p); if the node i does not send data in the time slice of a certain link (i, p), the time slices of all the following links (i, p) are set to be null, and the node i does not send data to the node p any more; after node p finds an empty link (i, p) slot, p turns off its radio to save energy during all link (i, p) slots; therefore, at most one time slice will be spent by node p for idle listening per sampling period for each directed link (i, p). While in the construction phase of the DAG structure, both the size and direction of the data flow on each link are uncertain. The invention conservatively considers that a node p will necessarily spend a time slice per sampling period, idle listening for each directed link (i, p).
Under the condition of considering idle listening, the modeling method for constructing the DAG with the optimal life cycle, which is described in the second step, comprises the following steps of:
Problem-MIP
maximize T
in order to be more uniform in form with the traditional maximum flow problem so as to be convenient to solve, the original problem is transformed: by usingForm of (1) in place of d ij And by another variableInstead of T, OPTDAG-MIP was converted to the following form:
Problem-MIP2
minimize q
the description method is different from other maximum flow problems in that the model is different: (a) The amount of data generated by each point is related to the data transmission probability of the node. (b) the cost of idle listening is taken into account. Since the integer programming problem is often an NP-hard problem in practice, without solutions in polynomial time, further transformed, the mixed integer linear programming problem is described as:
Problem-MILP
minimize q
εf ij ≤z ij ≤Mf ij ；
new variable f ij Indicating the number of packets transmitted from node i to node j during each sampling period; 0/1 variable z ij Relaxed to the common variables: ε f ij ≤z ij ≤Mf ij ；ε(0<ε<< 1) and M (M)>>, 1) represents a very small and a very large number, respectively. And (3) calculating to obtain an optimal solution by using the current most advanced general mathematical programming solution device CPLEX, GLP, gurobi or Mosek according to the mixed integer linear programming problem.
Drawings
Fig. 1 is a flowchart of a lifetime-optimized DAG construction method in a data-centric wireless sensor network according to an embodiment of the present invention.
FIG. 2 is an example of constructing a lifetime optimal tree provided by an embodiment of the present invention;
in the figure: (a) a network connection graph; (b) is a lifetime-optimal DAG; and (c) constructing the life-time optimal tree.
Fig. 3 is a network topology diagram of normalized 100 nodes provided by the embodiment of the present invention.
Fig. 4 is a data diagram of the first 5000 temperatures and solar radiation of a certain sensor provided by an embodiment of the invention.
FIG. 5 is a graph illustrating the percentage of sensor nodes transmitting temperature data and solar radiation data per sampling period as a function of different data fuzzy thresholds, according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
The application of the principles of the present invention will now be described in detail with reference to the accompanying drawings.
As shown in fig. 1, a method for constructing a lifetime-optimized DAG in a data-centric wireless sensor network according to an embodiment of the present invention includes the following steps:
s101, modeling a problem with the optimal DAG structure in the life period without considering the idle monitoring condition into a linear programming problem;
s102, incorporating energy for idle interception into the expression of a life-span optimization problem, and modeling the problem into an integer programming problem;
s103, transforming the Integer Programming problem into a solvable Mixed Linear Integer Programming MILP problem through mathematical transformation.
And S104, calculating by using the current most advanced general mathematical programming solution device CPLEX, GLP, gurobi or Mosek to obtain an optimal solution by contrasting the mixed integer linear programming problem.
The application of the principles of the present invention will now be described in further detail with reference to the accompanying drawings.
Such as the DAG routing structure shown in fig. 2. Fig. 2 (a) shows an example network, where each link represents a neighbor relation between nodes, and a fraction next to each node represents a packet transfer probability (probability of a node sending a packet to an aggregation node in a sampling period) of the node. A lifetime-optimized DAG structure is shown in fig. 2 (b). The number on each directed link represents the average number of packets sent on that link during each sampling period. In the DAG structure, node a and node B each receive 2 packets and transmit 2.5 packets in each sampling period, so that a and B are the most heavily loaded bottleneck nodes. In contrast, in the lifetime optimal tree shown in fig. 2 (c), the bottleneck node B receives 2.4 packets and sends 2.9 packets per sample period. The amount of node B load is too large for any a and B in the DAG structure. The DAG structure shown in fig. 2 (b) is therefore more efficient at balancing network load and extending lifetime than the optimal tree shown in fig. 2 (c).
The implementation of the method for constructing the optimal DAG in the lifetime in the wireless sensor network with data as the center provided by the embodiment of the invention specifically comprises the following steps:
in a first step, a network is arranged, and referring to fig. 3, 100 sensor nodes are randomly placed in a 1 × 1 square area, and in order to keep the whole network connected, the transmission radius of each node is set to 0.25 in a topological graph.
And secondly, selecting a data sequence and setting a threshold value. Referring to fig. 4, the method was tested using a sensor data sequence of temperature and solar radiation collected by the open source LEM project at washington university. Each data sequence contains over 3,000,000 sensor data, with two consecutive sensor data sampling intervals of 1 second. In order to control the deviation between the data collected by the base station and the real sensor data within e (which can be regarded as an error range), each node sets a threshold value [ u-e, u + e ] by taking the data reported last time as the center. In each sampling period, only when the data collected by each node exceeds the range of the threshold set by the node, the node needs to transmit the data to the base station and update the range of the threshold. Otherwise, the node does not need to submit anything. When the value of e is increased, the threshold range is correspondingly increased, and the data volume reported by each node is reduced.
And thirdly, setting node energy. Setting the energy supply of the base station to infinity, while the energy of the sensor node is limited, and the sensor transmitting one data packet consumes 1 unit of energy, while listening to the channel once would take 0.75 units of energy. The initial energy of the nodes is the same, set to 50,000 energy units. The lifetime of a network is defined as the time from the very beginning until the first node in the network is exhausted of energy.
And fourthly, estimating the data reporting probability of each node. And respectively setting different values e for the two data sequences of temperature and solar radiation, observing the data reporting condition of each node in a period of time, and normalizing the data reporting times to the period of time to be used as the reporting probability corresponding to the error range e.
And fifthly, constructing an optimal DAG structure in the life cycle by using the open source toolkit Mosek or CPLEX, and recording the time consumed for solving the optimal DAG under each group of error e values.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (7)
1. A method for constructing an optimal DAG (lifetime optimal DAG) in a data-centric wireless sensor network is characterized in that each node in the DAG network of the method for constructing the optimal DAG in the data-centric wireless sensor network is provided with a plurality of parent nodes and a plurality of child nodes, and each intermediate node can select any parent node to transmit a data packet locally generated by the intermediate node or received from the child nodes; the amount of data in the network changes dynamically: the set of wireless sensor nodes in the network that generate local data packets changes dynamically at each sampling period, which is determined only after the sensor nodes sense the data.
2. The method for constructing an optimal DAG for lifetime in a data-centric wireless sensor network as recited in claim 1, wherein the method for constructing an optimal DAG for lifetime in a data-centric wireless sensor network comprises the steps of:
modeling a problem with an optimal DAG structure in a life period without considering an idle monitoring condition to form a linear programming problem;
step two, incorporating the energy for idle interception into the expression of the life-span optimization problem, and modeling the problem into an integer programming problem;
step three, transforming the integer programming problem into a solvable mixed linear integer programming problem through mathematical transformation;
and step four, calculating by using the current most advanced general mathematical programming solution device CPLEX, GLP, gurobi or Mosek to obtain an optimal solution by contrasting the mixed integer linear programming problem.
3. The method of constructing a lifetime-optimal DAG in a data-centric wireless sensor network of claim 2, wherein the method of modeling the problem without considering idle listening:
Problem-LINEAR
maximizeT
condition (1) describes the restriction of flow, where p i T is the total number of packets generated at node i during the lifetime T; condition (2) indicates that the total energy cost of node i is given by the initial energy B during the time of the lifetime T i (ii) is limited; condition (3) specifies that the flow rate is positive.
4. The method for constructing an optimal DAG for lifetime in a data-centric wireless sensor network as recited in claim 2, wherein the second step specifically comprises: in each sampling period, all data packets sent by each sensor node i to each parent node p thereof are continuously distributed in all time slices of the link (i, p) from the first time slice of the link (i, p); if the node i does not send data in the time slice of a certain link (i, p), all the time slices of the following links (i, p) are set to be null, and the node i does not send data to the node p any more; after node p finds an empty link (i, p) slot, p turns off its radio to save energy during all link (i, p) slots; therefore, in each sampling period, the node p spends at most one time slice, and performs idle listening on each directed link (i, p); node p will necessarily spend a time slice per sample period, idle listening for each directed link (i, p).
5. The method of constructing a lifetime-optimized DAG in a data-centric wireless sensor network of claim 2, wherein, when considering energy of idle listening, the integer programming modeling method of the structure of the lifetime-optimized DAG is:
Problem-MIP
maximizeT
transforming the original problem: by usingForm of (2) instead of d ij And with another variableInstead of T, OPTDAG-MIP was converted into the following form:
Problem-MIP2
minimizeq
6. the method of constructing a lifetime optimal DAG in a data-centric wireless sensor network as recited in claim 2, wherein the modeling of the mixed integer linear programming problem is:
Problem-MILP
minimizeq
εf ij ≤z ij ≤Mf ij ；
new variable f ij Indicating the number of packets transmitted from node i to node j during each sampling period; 0/1 variable z ij Relaxed to the common variables: ε f ij ≤z ij ≤Mf ij ；ε(0<ε<< 1) and M (M)>> 1) represents a very small and a very large number, respectively; and (3) calculating to obtain an optimal solution by using the current most advanced common mathematical programming solution device CPLEX, GLP, gurobi or Mosek in contrast to the mixed integer linear programming problem.
7. A wireless sensor network applying the method for constructing a lifetime-optimized DAG in a data-centric wireless sensor network according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711455034.XA CN107911834B (en) | 2017-12-28 | 2017-12-28 | Method for constructing optimal DAG (demand oriented architecture) in lifetime in data-centered wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711455034.XA CN107911834B (en) | 2017-12-28 | 2017-12-28 | Method for constructing optimal DAG (demand oriented architecture) in lifetime in data-centered wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107911834A true CN107911834A (en) | 2018-04-13 |
| CN107911834B CN107911834B (en) | 2020-09-22 |
Family
ID=61871790
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711455034.XA Active CN107911834B (en) | 2017-12-28 | 2017-12-28 | Method for constructing optimal DAG (demand oriented architecture) in lifetime in data-centered wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107911834B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110968298A (en) * | 2018-09-30 | 2020-04-07 | 上海羚驭信息技术有限公司 | Management system and method applied to instantiation requirements |
| CN115630698A (en) * | 2022-12-08 | 2023-01-20 | 国家电网有限公司客户服务中心 | Knowledge graph visualization method and device based on force guide graph and electronic equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102170648A (en) * | 2011-01-28 | 2011-08-31 | 北京浩阳华夏科技有限公司 | Passive diagnosis method of wireless sensor network |
| CN102256369A (en) * | 2011-06-28 | 2011-11-23 | 武汉理工大学 | Task scheduling method for wireless sensor grid based on energy and communication overhead |
| WO2013118904A1 (en) * | 2012-02-11 | 2013-08-15 | Mitsubishi Electric Corporation | Avoiding broken links in smart meter networks for loop-free routing of packets |
| CN103416041A (en) * | 2011-03-08 | 2013-11-27 | 思科技术公司 | Remote stitched directed acyclic graphs |
| CN103648143A (en) * | 2013-12-23 | 2014-03-19 | 工业和信息化部电子工业标准化研究院 | Method and device for prolonging life of IPv6 (internet protocol version 6) wireless sensor network |
| CN106102114A (en) * | 2016-05-31 | 2016-11-09 | 哈尔滨工业大学 | Flight state monitoring radio sensing network construction method |
-
2017
- 2017-12-28 CN CN201711455034.XA patent/CN107911834B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102170648A (en) * | 2011-01-28 | 2011-08-31 | 北京浩阳华夏科技有限公司 | Passive diagnosis method of wireless sensor network |
| CN103416041A (en) * | 2011-03-08 | 2013-11-27 | 思科技术公司 | Remote stitched directed acyclic graphs |
| CN102256369A (en) * | 2011-06-28 | 2011-11-23 | 武汉理工大学 | Task scheduling method for wireless sensor grid based on energy and communication overhead |
| WO2013118904A1 (en) * | 2012-02-11 | 2013-08-15 | Mitsubishi Electric Corporation | Avoiding broken links in smart meter networks for loop-free routing of packets |
| CN103648143A (en) * | 2013-12-23 | 2014-03-19 | 工业和信息化部电子工业标准化研究院 | Method and device for prolonging life of IPv6 (internet protocol version 6) wireless sensor network |
| CN106102114A (en) * | 2016-05-31 | 2016-11-09 | 哈尔滨工业大学 | Flight state monitoring radio sensing network construction method |
Non-Patent Citations (1)
| Title |
|---|
| JINGJING FEI ET AL.: "Lifetime-Aware Data Collection in Wireless Sensor Networks", 《IEEE ONLINE CONFERENCE ON GREEN COMMUNICATIONS》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110968298A (en) * | 2018-09-30 | 2020-04-07 | 上海羚驭信息技术有限公司 | Management system and method applied to instantiation requirements |
| CN115630698A (en) * | 2022-12-08 | 2023-01-20 | 国家电网有限公司客户服务中心 | Knowledge graph visualization method and device based on force guide graph and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107911834B (en) | 2020-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mann et al. | Improved metaheuristic based energy-efficient clustering protocol for wireless sensor networks | |
| Peng et al. | Energy neutral clustering for energy harvesting wireless sensors networks | |
| Koosheshi et al. | Optimization energy consumption with multiple mobile sinks using fuzzy logic in wireless sensor networks | |
| Varshney et al. | Variants of LEACH routing protocol in WSN: A comparative analysis | |
| Mann et al. | Optimal node clustering and scheduling in wireless sensor networks | |
| CN107911834B (en) | Method for constructing optimal DAG (demand oriented architecture) in lifetime in data-centered wireless sensor network | |
| CN106954228B (en) | Method for constructing life-cycle optimization tree based on dynamic data pattern | |
| Padmanabhan et al. | Energy-efficient dynamic clustering protocol for wireless sensor networks | |
| Gogu et al. | Using dynamic programming to solve the wireless sensor network configuration problem | |
| Nithyakalyani et al. | Analysis of node clustering algorithms on data aggregation in wireless sensor network | |
| Ojoawo et al. | Energy efficient hierarchical cluster head election using exponential decay function prediction | |
| Wesnarat et al. | A power efficient algorithm for data gathering from wireless water meter networks | |
| Wang et al. | Optimal traffic distribution in minimum energy wireless sensor networks | |
| CN107911851B (en) | Life period optimal DAG decomposition method in data-centered wireless sensor network | |
| Aznaoui et al. | Energy efficient strategy for WSN technology using modified HGAF technique | |
| Zhao et al. | Constructing routing structures for sensor data collection with dynamic traffic patterns | |
| CN108076499B (en) | Heuristic construction method for optimal routing in life cycle | |
| Tomovic et al. | Energy efficient target coverage in partially deployed software defined wireless sensor network | |
| Israr et al. | Coverage based intercluster communication for load balancing in wireless sensor networks | |
| Katiyar et al. | Grey system theory-based energy map construction for wireless sensor networks | |
| Li et al. | A range-based sleep scheduling algorithm for desired area coverage in solar-powered wireless sensor networks | |
| Bindal et al. | PLDP: Possible Location Deployment Protocol for Energy Harvesting in WSNs | |
| Misalkar et al. | Increasing lifespan and achieving energy efficiency of wireless sensor network | |
| Prithibi et al. | Network lifetime aware routing algorithm for energy harvesting wireless sensor networks | |
| Priyadarshini et al. | Improving the Life of the Wireless Sensor Network using Energy Harvesting Clustering |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |