CN103501529A - Method for reducing power consumption of wireless sensor network based on minimum density beam - Google Patents

Method for reducing power consumption of wireless sensor network based on minimum density beam Download PDF

Info

Publication number
CN103501529A
CN103501529A CN201310476472.XA CN201310476472A CN103501529A CN 103501529 A CN103501529 A CN 103501529A CN 201310476472 A CN201310476472 A CN 201310476472A CN 103501529 A CN103501529 A CN 103501529A
Authority
CN
China
Prior art keywords
node
time
space
wireless sensor
network
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
Application number
CN201310476472.XA
Other languages
Chinese (zh)
Other versions
CN103501529B (en
Inventor
李凡
银志圆
王昱
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Technology BIT
Original Assignee
Beijing Institute of Technology BIT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Technology BIT filed Critical Beijing Institute of Technology BIT
Priority to CN201310476472.XA priority Critical patent/CN103501529B/en
Publication of CN103501529A publication Critical patent/CN103501529A/en
Application granted granted Critical
Publication of CN103501529B publication Critical patent/CN103501529B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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)

Abstract

The invention provides a method for reducing power consumption of a wireless sensor network based on a density beam, which is used for solving the problem of the power consumption of the wireless sensor network composed of sensor nodes, the electric energy carried by the sensor nodes is limited, and the method belongs to the technical field of control of the wireless sensor network. A topological structure of the wireless sensor network is controlled, so that the whole wireless sensor network is connected within the specified time, and simultaneously, the sensor nodes in an active status are minimized, so that the overall power consumption of the network is minimum within the time range. The method is especially suitable for the large-scale and self-organizing wireless sensor network with random deployment and complex environment, the network connection status of the wireless sensor network can be predicted, or network connections of the wireless sensor network are periodically changed.

Description

The method of the reduction wireless sensor network power consumption based on the minimum density bundle
Technical field
The invention belongs to wireless sensor network control technology field, be specifically related to wireless sensor network topology control method, for reducing the power consumption of whole wireless sensor network.
Background technology
At present, in wireless sensor network, generally use can not spontaneous electric power battery the signal transmission is provided and receives required energy for the network sensor node.For the wireless sensor network formed for the sensor node limited by carried charge, some sensor nodes on network backbone can be used up self electric quantity very soon, and then may from whole network, break away from away, cause may no longer connecting between each sensor node of whole network.In wireless sensor network, a large amount of electric quantity consumption of sensor node becomes the bottleneck problem that maintaining network connects.Therefore, how to control the topological structure of wireless sensor network, thereby reduce the electric quantity consumption of whole network, become the more popular research direction in this field.
Mainly rely on the wireless sensor network of the self-contained electric energy maintenance work of sensor node for this class, the technical staff can ignore the Topology Structure Design of network self usually, or applies at random some simple static topological methods.There is not yet a kind of method that effectively by dynamic control network topology structure, reduces whole network power consumption.
Summary of the invention
The objective of the invention is for solve self the power consumption problem of the wireless sensor network that forms of the limited sensor node of the electric energy of taking, a kind of method that reduces the wireless sensor network power consumption is proposed.By the topological structure to wireless sensor network, controlled, when making whole wireless sensor network keep connected state at the appointed time, sensor node in active state is minimized, make network whole power consumption minimum in this time range.This method is particularly useful on a large scale, self-organizing, random placement, circumstance complication and network connection state is predictable or network connects the cyclic variation wireless sensor network.
The inventive method comprises the following steps:
Step 1, obtain wireless sensor network at the appointed time in scope continuous time section work state information.Described operating state comprises that wireless senser receives the electric weight of the required consumption of packet, sends the electric weight of the required consumption of packet within each time period, and within each time period the correspondence between the different sensors node.
Step 2, the work state information obtained according to step 1, set up the space-time diagram of interior this network of scope at the appointed time.
Step 3, the space-time diagram that step 2 is obtained are processed, and obtain its period of the day from 11 p.m. to 1 a.m empty graph H.Wherein, period of the day from 11 p.m. to 1 a.m empty graph need to meet following requirement: in scope, in period of the day from 11 p.m. to 1 a.m empty graph, at least there are a directed walk in any one node and other all nodes at the appointed time; Simultaneously, compare original space-time diagram and will reduce total electric weight expense.
Step 4, according to space-time diagram H, the topological structure of wireless sensor network is arranged, sensor node in the real network that in period of the day from 11 p.m. to 1 a.m empty graph H, each node is corresponding is opened, thereby at utmost reduced whole network power consumption under the prerequisite that guarantees the network normal operation.
Beneficial effect
The present invention, by proposing the network topology structure control method based on space-time diagram, advances control to the limited wireless sensor network of self institute's electric weight of taking.By dynamic topology design method, space-time diagram is controlled, according to the topological structure obtained, determined the at the appointed time open and-shut mode of section of sensor node.On the basis of network connectivty, close as much as possible the sensor node of greater number in satisfied scope at the appointed time, thus the optimized network topological structure, and the life span that extends network, significantly reduce the network power expense.
The accompanying drawing explanation
Fig. 1 is wireless sensor network at the communications status of section sometime.
Fig. 2 is that wireless sensor network changes at the communications status of four different time sections.
Fig. 3 is for being divided into 4 continuous time periods at whole time range T() in, a packet is from node v 1be sent to node v 5the directed walk (black thick line mean) of process.
Fig. 4 is the schematic diagram of bundle.
Fig. 5 is to the handling process schematic diagram of space-time diagram ζ in the specific embodiment of the invention.
Fig. 6 is GrdLDB, and the performance of GrdLDB ' on the network node selection rate embodies.
Fig. 7 is GrdLDB, and the performance of GrdLDB ' on network power efficiency embodies.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further details.
A kind of method that reduces the wireless sensor network power consumption, can guarantee that whole wireless sensor network keeps connected state at the appointed time, and in scope, minimum in the sensor node of active state at this moment, make network whole power consumption minimum in this time range.
For achieving the above object, the specific implementation process of the inventive method comprises the following steps:
Step 1, obtain wireless sensor network at the appointed time in scope continuous time section work state information.Described work state information comprises that sensor node receives the electric weight of the required consumption of packet, sends the electric weight of the required consumption of packet within each time period, and within each time period the correspondence between the different sensors node.
Concrete, described stipulated time scope T is divided into to section set continuous time, T={1,, t}, wherein t is integer, represents the time period; V={v 1,, v nmeaning the wireless sensor node set, n is integer.Fig. 1 has showed at time period 1(t=1) time concrete wireless sensor network in the correspondence of each sensor node.Fig. 2 has showed the different communication state of certain wireless sensor network within continuous four time periods ( time period 1,2,3,4).
Simultaneously, for any one sensor node in wireless sensor network in section t sometime (i is integer, 1≤i≤n),
Figure BDA0000395012160000032
mean that this node sends the electric weight of the required consumption of packet within this time period;
Figure BDA0000395012160000033
mean that this node receives the electric weight of the required consumption of packet within this time period;
Figure BDA0000395012160000034
mean wireless sensor node v ipower consumption in the t time period is weights.
In addition, can also use about node degree in space-time diagram ζ
Figure BDA0000395012160000035
node is set
Figure BDA0000395012160000036
weights
Figure BDA0000395012160000037
c ′ ( v i t ) = c ( v i t ) / d ( v i t ) , d ( v i t ) = v i t The node out-degree
Figure BDA00003950121600000310
the node in-degree.
Figure BDA00003950121600000311
meaned node average power consumption at t each degree of time period is weights.
Step 2, the work state information obtained according to step 1, set up the space-time diagram of interior this network of scope T at the appointed time.
At first, make G t=(V t, E t) mean the correspondence figure of wireless sensor network in certain time period t.Wherein, limit
Figure BDA00003950121600000312
be illustrated in time period t sensor node v ito sensor node v jtransmit packet, i, j are integer, represent the numbering of wireless sensor node, 1≤i≤n, 1≤j≤n.In this way, finally obtain in stipulated time scope T network communication of wireless sensor graph of a relation set { G t| t=1, T}.
Then, will gather { G t| t=1, T} is converted to space-time diagram ζ.ζ=(υ, ε) means a space-time diagram, the temporal information that has comprised node and communicate status information.For decision node
Figure BDA00003950121600000313
whether need in certain time period t, open or close, suppose and have node in network in time period t
Figure BDA00003950121600000314
with order
Figure BDA00003950121600000316
Figure BDA00003950121600000317
simultaneously, add two dummy nodes
Figure BDA00003950121600000318
with wherein, use
Figure BDA00003950121600000320
mean v iat the state zero hour of whole time range T, use
Figure BDA00003950121600000321
mean v iat the state finish time of whole time range T.
At the appointed time in scope T, any a pair of node pair in space-time diagram ζ at least there is a directed walk.Fig. 3 has meaned to be divided into 4 continuous time periods at whole time range T() in, the correspondence between each transducer, thick lines wherein represent that certain packet is from node v 1be sent to node v 5the directed walk of process.
In space-time diagram ζ, always have 2 (T+1) row node, wherein a time period is shown in every two lists; Each shows n node, adds up to the individual node of 2n (T+1).In space-time diagram ζ, there are three kinds of limits: time limit, limit, space, virtual limit.Wherein, time limit
Figure BDA0000395012160000042
the dactylus point
Figure BDA0000395012160000043
on the limit of time period t, be illustrated in this node in t time period and carry packet but do not send; The limit, space
Figure BDA0000395012160000044
finger is v in time period t ito node v jlimit, be illustrated in time period t interior nodes v ito node v jsend packet; Virtual limit
Figure BDA0000395012160000045
refer to node
Figure BDA0000395012160000046
from time period t to the formed limit of time period t+1.Example as shown in Figure 4.
Step 3, the space-time diagram ζ that step 2 is obtained are processed, and obtain the period of the day from 11 p.m. to 1 a.m empty graph H of space-time diagram ζ.Wherein, period of the day from 11 p.m. to 1 a.m empty graph H need to meet following requirement:
At the appointed time in scope T, any a pair of node pair in space-time diagram H
Figure BDA0000395012160000047
at least there is a directed walk; Simultaneously, compare space-time diagram ζ and reduce total electric weight expense.
In space-time diagram ζ, each sensor node needs to consume the normal operation that electric energy maintains whole wireless network, and total electric weight expense of all nodes of space-time diagram ζ is c (ζ)=Σ v ∈ ζc (v).
Make X be carved into T+1 node pair set constantly at all 0 o'clock
Figure BDA0000395012160000048
if any the some nodes pair in one group of Path Connection X, and this shared stretch footpath, group path, claim that the union in this group path is bundle, with symbol, B means.C (B) means the weight of this bundle,
Figure BDA0000395012160000049
d (B) means the density d (B) of this bundle=c (B)/l, and l means the number that this bundle connected node is right.In space-time diagram ζ, the minimal-overhead connection table of node u and v is shown to the minimal-overhead path P ζ(u, v), P ζthe computing formula of (u, v) expense is c ( P ζ ( u , v ) ) = Σ v ∈ P ζ ( u , v ) c ( v ) .
As shown in Figure 4, one group of Path Connection node is arranged to (u 1, w 1), (u 1, w 2), (u 1, w 3), (u 2, w 1), (u 2, w 2), (u 2, w 3), (u 3, w 1), (u 3, w 2), (u 3, w 3), and this shared one section path from node p to node q, group path, the union in this group path is bundle.
Processing procedure to space-time diagram ζ is as follows:
1), make period of the day from 11 p.m. to 1 a.m empty graph H for empty, make X be carved into T+1 node pair set constantly at all 0 o'clock { ( v i 0 , v j T + 1 ) | 1 ≤ i , j ≤ n } ;
2), judge whether X is empty, if be not empty, goes to step 3, empty if, go to step 5;
3), calculate all possible bundle, then select the bundle of density minimum, suppose that this bundle is B, goes to step 4;
4), the node in B is reached to the limit be connected with node and add in period of the day from 11 p.m. to 1 a.m empty graph H, and the node that this bundle is connected goes to step 2 to deleting from X;
5), return to period of the day from 11 p.m. to 1 a.m empty graph H.
Detailed process as shown in Figure 5.
Step 4, according to period of the day from 11 p.m. to 1 a.m empty graph H, the topological structure of wireless sensor network is arranged, thereby at utmost reduced whole network power consumption under the prerequisite that guarantees the network normal operation.
Concrete setting up procedure is: the sensor node in the real network that in period of the day from 11 p.m. to 1 a.m empty graph H, each node is corresponding is opened.For example, the node vit in period of the day from 11 p.m. to 1 a.m empty graph H means i sensor node is set as opening t time period.
Embodiment
Impact energy of wireless sensor network consumed in order to test the present invention has been arranged 30 sensor nodes in the random network that utilizes classical stochastic model to generate, and test specification is divided into to 10 time periods.This random networks generation model with Probability p at two node v i, v jbetween add to connect, p can control the density of network, the p more density of macroreticular is larger, being illustrated in each time period network when p=1.0 is full the connection.According to the random network of continuous 10 time periods that generate, build space-time diagram ζ.Experiment has generated and has built 30 different space-time diagrams at random, moves the mean value that the experiment acquired results is the present invention's operation result on these 30 space-time diagrams on each space-time diagram.
It is input of the present invention that experiment arranges space-time diagram ζ, and space-time diagram H is output of the present invention, and n (H) means the number of node in space-time diagram H, and n (ζ) means the number of node in space-time diagram ζ, and c (H) means the total electric quantity consumption of space-time diagram H, mean the total electric quantity consumption of space-time diagram ζ,
Figure BDA0000395012160000052
The Performance Ratio of the present invention under two kinds of different node weighting schemes more as shown in Figure 5, Figure 6.In figure, GrdLDB means to using the inventive method of c (v) mode as the node weights, and GrdLDB ' means to using c'(v) mode is as the inventive method of node weights.
GrdLDB shown in Fig. 6 and the GrdLDB ' change curve under heterogeneous networks Connection Density p.The Connection Density p that in figure, abscissa is network, p respectively from 0.2 to 1.0, and ordinate is the node selection rate, node selection rate=n (H)/n (ζ).The node selection rate is lower, means that in network, the actual number of nodes used is fewer.As seen from the figure, GrdLDB and GrdLDB ' can both reduce the quantity of utilizing of node effectively, even when network density p is 0.2, the node selection rate of GrdLDB is about 58%, can save approximately 42% node and the node selection rate of GrdLDB ' and be about 35%, can save approximately 65% node, and, along with the increase of density p, their node selection rate constantly reduces.This experimental result shows, GrdLDB and GrdLDB ', under the prerequisite that meets the wireless network proper communication, can significantly reduce each time period and use the quantity of sensor node.
Shown in Fig. 7, the Connection Density that abscissa is sensor network, ordinate is network energy efficiency, energy efficiency=c (H)/c (ζ), ratio is less, saves energy more.As seen from the figure, continuous increase along with the network Connection Density, GrdLDB and GrdLDB ' are under the prerequisite that guarantees the wireless sensor network normal operation, can effectively save the energy of wireless sensor network, when the network Connection Density is 0.2, the energy efficiency of GrdLDB is about 56%, saved approximately 44% electric weight, the energy efficiency of GrdLDB ' is about 27%, saved approximately 73% electric weight and, along with the increase of network density, the continuous reduction of energy efficiency saves the ratio of electric weight also in continuous increase simultaneously.
In sum, the Topology control scheme based on minimum density bundle thought that the present invention proposes, be applicable to network simultaneously and connect sparse and network and connect wireless sensor network closely, can effectively reduce the electric quantity consumption of whole network under the prerequisite that guarantees the wireless sensor network normal operation.
Above-described instantiation is further to explain to of the present invention, and the protection range be not intended to limit the present invention is all within principle of the present invention and spirit, the change of doing and to be equal to replacement should be all within protection scope of the present invention.

Claims (2)

1. the method for the reduction wireless sensor network power consumption based on the minimum density bundle, is characterized in that, comprises the following steps:
Step 1, obtain wireless sensor network at the appointed time in scope continuous time section work state information; Described work state information comprises that sensor node receives the electric weight of the required consumption of packet, sends the electric weight of the required consumption of packet within each time period, and within each time period the correspondence between the different sensors node;
Concrete, described stipulated time scope T is divided into to section set continuous time, T={1,, t}, wherein t is integer, represents the time period; V={v 1,, v nmeaning the wireless sensor node set, n is integer; Simultaneously, for any one sensor node in wireless sensor network in section t sometime
Figure FDA0000395012150000011
i is integer, 1≤i≤n,
Figure FDA0000395012150000012
mean that this node sends the electric weight of the required consumption of packet within this time period;
Figure FDA0000395012150000013
mean that this node receives the electric weight of the required consumption of packet within this time period; mean wireless sensor node v ipower consumption in the t time period is weights;
Step 2, the work state information obtained according to step 1, set up the space-time diagram of interior this network of scope T at the appointed time;
At first, make G t=(V t, E t) mean the correspondence figure of wireless sensor network in certain time period t; Wherein, limit
Figure FDA0000395012150000015
be illustrated in time period t sensor node v ito sensor node v jtransmit packet, i, j are integer, represent the numbering of wireless sensor node, 1≤i≤n, 1≤j≤n; Finally obtain in stipulated time scope T network communication of wireless sensor graph of a relation set { G t| t=1, T};
Then, will gather { G t| t=1, T} is converted to space-time diagram ζ; ζ=(υ, ε) means a space-time diagram, the temporal information that has comprised node and communicate status information; For decision node
Figure FDA0000395012150000016
whether need in certain time period t, open or close, suppose and have node in network in time period t
Figure FDA0000395012150000017
with
Figure FDA0000395012150000018
order
Figure FDA0000395012150000019
simultaneously, add two dummy nodes
Figure FDA00003950121500000110
with
Figure FDA00003950121500000111
wherein, use
Figure FDA00003950121500000112
mean v iat the state zero hour of whole time range T, use
Figure FDA00003950121500000113
mean v iat the state finish time of whole time range T;
At the appointed time in scope T, any a pair of node pair in space-time diagram ζ
Figure FDA00003950121500000114
at least there is a directed walk;
In space-time diagram ζ, always have 2 (T+1) row node, wherein a time period is shown in every two lists; Each shows n node, adds up to the individual node of 2n (T+1); In space-time diagram ζ, there are three kinds of limits: time limit, limit, space, virtual limit; Wherein, time limit
Figure FDA00003950121500000115
the dactylus point
Figure FDA00003950121500000116
on the limit of time period t, be illustrated in this node in t time period and carry packet but do not send; The limit, space
Figure FDA00003950121500000117
finger is v in time period t ito node v jlimit, be illustrated in time period t interior nodes v ito node v jsend packet; Virtual limit
Figure FDA00003950121500000118
refer to node
Figure FDA0000395012150000021
from time period t to the formed limit of time period t+1;
Step 3, the space-time diagram ζ that step 2 is obtained are processed, and obtain the period of the day from 11 p.m. to 1 a.m empty graph H of space-time diagram ζ; Wherein, period of the day from 11 p.m. to 1 a.m empty graph H need to meet following requirement:
At the appointed time in scope T, any a pair of node pair in space-time diagram H
Figure FDA0000395012150000022
at least there is a directed walk; Simultaneously, compare space-time diagram ζ and reduce total electric weight expense;
In space-time diagram ζ, each sensor node needs to consume the normal operation that electric energy maintains whole wireless network, and total electric weight expense of all nodes of space-time diagram ζ is c (ζ)=Σ v ∈ ζc (v);
Make X be carved into T+1 node pair set constantly at all 0 o'clock
Figure FDA0000395012150000023
if any the some nodes pair in one group of Path Connection X, and this shared stretch footpath, group path, claim the union in this group path for bundle, with symbol B, mean; C (B) means the weight of this bundle,
Figure FDA0000395012150000024
d (B) means the density d (B) of this bundle=c (B)/l, and l means the number that this bundle connected node is right; In space-time diagram ζ, the minimal-overhead connection table of node u and v is shown to the minimal-overhead path P ζ(u, v), P ζthe computing formula of (u, v) expense is c ( P ς ( u , v ) ) = Σ v ∈ P ς ( u , v ) c ( v ) ;
Processing procedure to space-time diagram ζ is as follows:
1) make period of the day from 11 p.m. to 1 a.m empty graph H for empty, make X be carved into T+1 node pair set constantly at all 0 o'clock { ( v i 0 , v j T + 1 ) | 1 ≤ i , j ≤ n } ;
2) judge that whether X is empty, if be not empty, goes to step 3), empty if, go to step 5);
3) calculate all possible bundle, then select the bundle of density minimum, suppose that this bundle is B, goes to step 4);
4), the node in B is reached to the limit be connected with node and add in period of the day from 11 p.m. to 1 a.m empty graph H, and the node that this bundle is connected goes to step 2 to deleting from X);
5), return to period of the day from 11 p.m. to 1 a.m empty graph H.
2. the method for a kind of reduction wireless sensor network power consumption of deleting based on greed as claimed in claim 1, is characterized in that, in described step 1, adopts node degree in space-time diagram ζ node is set
Figure FDA0000395012150000028
weights
Figure FDA0000395012150000029
c ′ ( v i t ) = c ( v i t ) / d ( v i t ) , d ( v i t ) = v i t The node out-degree the node in-degree,
Figure FDA00003950121500000213
mean node
Figure FDA00003950121500000214
average power consumption at t each degree of time period is weights.
CN201310476472.XA 2013-10-13 2013-10-13 Based on the method for the reduction wireless sensor network power consumption of minimum density bundle Expired - Fee Related CN103501529B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310476472.XA CN103501529B (en) 2013-10-13 2013-10-13 Based on the method for the reduction wireless sensor network power consumption of minimum density bundle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310476472.XA CN103501529B (en) 2013-10-13 2013-10-13 Based on the method for the reduction wireless sensor network power consumption of minimum density bundle

Publications (2)

Publication Number Publication Date
CN103501529A true CN103501529A (en) 2014-01-08
CN103501529B CN103501529B (en) 2016-03-30

Family

ID=49866678

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310476472.XA Expired - Fee Related CN103501529B (en) 2013-10-13 2013-10-13 Based on the method for the reduction wireless sensor network power consumption of minimum density bundle

Country Status (1)

Country Link
CN (1) CN103501529B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107710827A (en) * 2015-06-30 2018-02-16 三菱电机株式会社 estimating device and wireless system
CN110319836A (en) * 2019-04-09 2019-10-11 华东理工大学 A kind of path planning control method and device with the minimum target of energy loss

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100302953A1 (en) * 2009-05-27 2010-12-02 Xiaoyun Li Method of coverage evaluation and optimization using triangulation model
CN102413180A (en) * 2011-11-15 2012-04-11 河海大学 Wireless sensor network for monitoring irrigation area and communication protocol of wireless sensor network
CN102695249A (en) * 2011-03-23 2012-09-26 北京天地互连信息技术有限公司 Energy saving method for IPv6 wireless sensor network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100302953A1 (en) * 2009-05-27 2010-12-02 Xiaoyun Li Method of coverage evaluation and optimization using triangulation model
CN102695249A (en) * 2011-03-23 2012-09-26 北京天地互连信息技术有限公司 Energy saving method for IPv6 wireless sensor network
CN102413180A (en) * 2011-11-15 2012-04-11 河海大学 Wireless sensor network for monitoring irrigation area and communication protocol of wireless sensor network

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107710827A (en) * 2015-06-30 2018-02-16 三菱电机株式会社 estimating device and wireless system
CN110319836A (en) * 2019-04-09 2019-10-11 华东理工大学 A kind of path planning control method and device with the minimum target of energy loss
CN110319836B (en) * 2019-04-09 2021-02-09 华东理工大学 Path planning control method and device with lowest energy loss as target

Also Published As

Publication number Publication date
CN103501529B (en) 2016-03-30

Similar Documents

Publication Publication Date Title
Nayak et al. Energy efficient clustering algorithm for multi-hop wireless sensor network using type-2 fuzzy logic
CN101790251B (en) Wireless sensor node alliance generating method based on improved particle swarm optimization algorithm
Zhang et al. Optimal operation of multi-reservoir system by multi-elite guide particle swarm optimization
Das et al. Fuzzy based energy efficient multicast routing for ad-hoc network
Natarajan et al. A fuzzy based predictive cluster head selection scheme for wireless sensor networks
Liu et al. An approach of distributed joint optimization for cluster-based wireless sensor networks
Alqahtani et al. Modified power line system-based energy efficient routing protocol to improve network life time in 5G networks
Singh et al. An energy efficient approach for clustering in WSN using fuzzy logic
Aissa et al. On feasibility of multichannel reconfigurable wireless sensor networks under real-time and energy constraints
CN105451292A (en) Grid structure-based hierarchical network charging method and system in WRSNs
CN103501529A (en) Method for reducing power consumption of wireless sensor network based on minimum density beam
CN103533625A (en) Method for reducing power consumption of wireless sensor network based on minimum cost path
El-Sayed et al. Chain based leader selection using neural network in wireless sensor networks protocols
CN103501546A (en) Method for reducing power consumption of wireless sensor network based on minimum cost spanning tree
Guo et al. A novel cluster-head selection algorithm based on hybrid genetic optimization for wireless sensor networks
CN103491616A (en) Method for reducing electricity consumption of wireless sensor network based on greedy addition
CN103501523A (en) Method for reducing power consumption of wireless sensor network based on greedy deletion
Es-Sabery et al. Evaluation and comparative study of the both algorithm LEACH and PEGASIS based on energy consumption
Rani et al. SSE Path Routing Protocol for WSN IOT Using Fuzzy Mean Weighted Code and Enthalpy ANN-GOA
CN105894114A (en) Solar energy prediction method based on dynamic condition Boltzmann machine
Rathee et al. Developed distributed energy-efficient clustering (DDEEC) algorithm based on fuzzy logic approach for optimizing energy management in heterogeneous WSNs
Babu et al. Intelligent Energy Management System for Smart Grids Using Machine Learning Algorithms
CN108076499B (en) Heuristic construction method for optimal routing in life cycle
Indora et al. Sleep-distance based sleep-awake mechanisms in wireless sensor network
Sinha et al. Energy-efficient communication: understanding the distribution of runs in binary strings

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: 20160330

Termination date: 20161013

CF01 Termination of patent right due to non-payment of annual fee