CN103546948A - Method and system for scheduling node sleeping of energy capture sensor network based on graph theory - Google Patents
Method and system for scheduling node sleeping of energy capture sensor network based on graph theory Download PDFInfo
- Publication number
- CN103546948A CN103546948A CN201310498477.2A CN201310498477A CN103546948A CN 103546948 A CN103546948 A CN 103546948A CN 201310498477 A CN201310498477 A CN 201310498477A CN 103546948 A CN103546948 A CN 103546948A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- sensor network
- dormancy dispatching
- energy
- 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
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000005059 dormancy Effects 0.000 claims description 42
- 238000003306 harvesting Methods 0.000 claims description 24
- 230000000284 resting effect Effects 0.000 claims description 7
- 238000004040 coloring Methods 0.000 abstract 1
- 238000005265 energy consumption Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 240000007594 Oryza sativa Species 0.000 description 1
- 235000007164 Oryza sativa Nutrition 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 238000004134 energy conservation Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 235000009566 rice Nutrition 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
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
- Feedback Control In General (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and system for scheduling node sleeping of an energy capture sensor network based on a graph theory. The method comprises the steps that the weighted directed graph G equal to (V, S) of the energy capture sensor network is constructed in a monitor area; the weight of each link is calculated according to the weighted directed graph G equal to (V, S); the nodes forming the links are colored according to the weight values of the links, coloring is carried out in the sequence of the weight values of the links, and when the monitor area is completely covered with the colored nodes, the residual nodes are not colored, and the nodes which are not colored are in a sleeping state. The system achieved through the method can adapt to energy capture randomness and the dynamic change of a sensor network topological structure, captured energy can be used more effectively, and the system is suitable for multiple kinds of sensor network types and is more suitable for field monitor and other application environments with no power supplied and batteries hard to replace.
Description
Technical field
The present invention relates to sensor network technique field, be specifically related to a kind of energy harvesting sensor network nodes dormancy dispatching method and system based on graph theory.
Background technology
Sensor network is application oriented special wireless self-organization network, in fields such as Smart Home, intelligent transportation, industry monitoring, environmental monitoring, tele-medicine, battlefield surveillances, has potential using value.In sensor network, a large amount of microsensor node deployments are in observation area, image data and data are sent to fusion center in the mode of multi-hop.Sensor node powered battery, it is limited carrying energy, and battery is difficult to change.The characteristic feature of sensor network is energy constraint for this reason, and it is primary goal that the design of various algorithms, agreement all be take energy-conservation, and do the best balance quality and energy consumption.
Energy harvesting sensor network becomes the focus of domestic and international educational circles in recent years.In energy harvesting sensor network, node obtains energy (as solar energy) from the external world, has alleviated to a certain extent the energy constraint of self, has extended network lifecycle.But extraneous retrievable energy is unsettled, not to have in any moment, and can amount to obtain temporal evolution.In addition, the optimization utilization that the efficiency that solar energy transforms and energy spatial cache also have influence on solar energy.This just requires us when design energy is obtained the algorithm of sensor network and agreement, takes into full account the randomness of energy harvesting and the task of sensor network, improves efficiency as far as possible.Energy harvesting sensor network is particularly suitable for wild environment monitoring.When the energy content of battery that carries when sensor node is not enough, node obtains the new forms of energy such as solar energy, wind energy and they is converted into electric energy from the external world.
When sensor network is monitored for wild environment, node dormancy scheduling allows redundant node enter resting state to save energy while making sensor network occur covering redundancy, and all right like this balance node energy consumption, extends network lifecycle.The exemplary process of sensor network nodes dormancy dispatching has the dormancy dispatching method of dormancy dispatching method, the dormancy dispatching method based on nodal distance and jumping figure, the dormancy dispatching method covering based on angle, the dormancy dispatching method based on Voronoi figure, ensuring coverage degree and connectedness based on sub-clustering etc.These methods are the fixing sensor network of nodes oriented energy all, although extended network lifecycle, but the sensor network topological structure dynamic change of not considering the randomness of energy harvesting and causing thus, may cause the improper use of obtained energy.
Summary of the invention
For existing sensor network dormancy dispatching method, be not suitable for the situation of energy harvesting sensor network, the present invention proposes a kind of energy harvesting sensor network nodes dormancy dispatching method based on graph theory, and provide the dormancy dispatching system that realizes the method, adapted to the dynamic change of randomness and the sensor network topological structure of energy harvesting, can more effectively utilize obtained energy, be applicable to multiple sensors network type and be more suitable for that field monitoring etc. cannot be powered and be difficult to change the applied environment of battery.
Technical solution of the present invention is as follows:
An energy harvesting sensor network nodes dormancy dispatching method for graph theory, comprising:
In monitored area, construct the weighted digraph G=(V, S) of energy harvesting sensor network;
According to weighted digraph G=(V, S), calculate the weight of each link;
According to the weighted value of each link, to forming the node of link, carry out painted, painted order is carried out successively according to the weighted value size of each link, when monitored area is covered completely by painted node, remaining node does not carry out painted, and the node not being colored enters resting state;
According to the dormancy dispatching system of setting, start next round dormancy dispatching.
Wherein: V is the set of sensor node, S is the set of link between sensor node.
Described dormancy dispatching system, for when energy harvesting sensor network can not meet monitored area coverage requirement, starts next round dormancy dispatching.
Described link weight is obtained by following formula:
Wherein: λ
ijnode x
i(i=1,2,3 ...) and node x
jform the weight of link; Node x
jit is link crossed node; ε
inode x
idump energy; h
ijnode x
iwith node x
jbetween channel coefficients; d
ijnode x
iwith node x
jbetween distance; V is constant, v=2-4.
An energy harvesting sensor network nodes dormancy dispatching system for graph theory, comprising:
In monitored area, construct the device of the weighted digraph G=(V, S) of energy harvesting sensor network;
According to weighted digraph G=(V, S), calculate the device of the weight of each link;
According to the weighted value of each link, to forming the node of link, carry out painted, painted order is carried out successively according to the weighted value size of each link, when monitored area is covered completely by painted node, remaining node does not carry out painted, and the node not being colored enters the device of resting state;
According to the dormancy dispatching system of setting, start the device of next round dormancy dispatching.
Accompanying drawing explanation
Fig. 1 is the graph theory model of energy harvesting sensor network.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.
1. technical scheme is described:
(1) in energy harvesting sensor network, it is different that node obtains the moment of energy, and the energy value obtaining is also different.If have N node in sensor network, be designated as { x
1..., x
n.N node x
nprimary power be designated as E
n, 0(Jiao).At moment t
n,l(l=1 ..., L), x
nfrom the external world, obtain energy E
n,l(Jiao) (convenient for statement, establishing all nodes here, to obtain moment of energy identical).Every, take turns the moment that dormancy dispatching starts, according to node x
nprimary power and the energy that obtains from the external world dump energy ε that can calculate it
n(Jiao).
(2) data of sensor node collection send to fusion center in multi-hop mode, and the multi-hop Routing Protocol of the formation of link and employing is relevant.Structure weighted digraph G=(V, S), wherein V is the set of sensor node, S is the set of link between sensor node.Only consider the energy consumption of node communication, because the energy consumption of perception, calculating is conventionally much smaller.If two node x
iand x
jbetween there is a link, the weight λ of this link
ijand x
idump energy ε
i(Jiao), x
iand x
jbetween distance d
ij(rice) and x
iand x
jbetween channel coefficients h
ijrelevant, be expressed as λ
ij=f (ε
i, d
ij,h
ij), wherein
be a definite function, v is a constant.Function f () has been included the key parameters such as dump energy, communication distance and channel coefficients, and meets the following conditions: dump energy is more, and weight is larger; Distance is far away, and channel conditions is poorer, and weight is less.Because node obtains energy from the external world, the value of link weight is dynamic change.
(3) according to the painted theory of graph theory, carry out the node dormancy scheduling of energy harvesting sensor network.As a plurality of node x
1..., x
ithere is link to arrive x simultaneously
jtime, according to the weighted value of these links to node x
1..., x
icarry out painted.The node of weighted value maximum is colored at first, and then second largest node of weighted value is colored, and the rest may be inferred.When observation area is covered completely by painted node, remaining node is not colored, and enters resting state.Sensor network while starting to next round dormancy dispatching, re-constructs weighted digraph and link generation weight, then according to the painted theory of graph theory, carries out node dormancy scheduling, until can not meet region coverage requirement.
2. use concrete parametric description:
If there are 5 node x in sensor network
1..., x
5there is link to arrive node x simultaneously
6.Their primary power is all 1J, i.e. E
1,0=E
2,0=E
3,0=E
4,0=E
5,0=E
6,0=1.At moment t
n, 1, x
1..., x
6from the external world, obtain respectively energy 0.1J, 0.2J, 0.3J, 0.4J, 0.5J, 0.6J.Before dormancy dispatching starts, x
1..., x
6dump energy be respectively 1.1J, 1.2J, 1.3J, 1.4J, 1.5J, 1.6J.If x
1..., x
5to x
6distance be respectively 1m, 1.5m, 2m, 2.5m, 3m.Channel coefficients is obeyed the multiple Gaussian Profile that average is 0, variance is 1.If | h
16|
2=| h
26|
2=| h
36|
2=| h
46|
2=| h
56|
2=0.5.Link weight is
v=2 wherein.Obtaining thus the node that respective links weight sorts from big to small, is x
1..., x
5.When dormancy dispatching starts, first to x
1carry out painted, more successively to x
2, x
3, x
4carry out painted.If these four nodes cover observation area, so x completely
5to enter resting state.When next round dormancy dispatching starts, the dump energy according to the energy newly obtaining and when the first round, the work period finished recalculates the dump energy of node, then regenerates x
1..., x
5link weight and find out dormancy node according to painted theory.
Claims (6)
1. the energy harvesting sensor network nodes dormancy dispatching method based on graph theory, comprising:
In monitored area, construct the weighted digraph G=(V, S) of energy harvesting sensor network;
According to weighted digraph G=(V, S), calculate the weight of each link;
According to the weighted value of each link, to forming the node of link, carry out painted, painted order is carried out successively according to the weighted value size of each link, when monitored area is covered completely by painted node, remaining node does not carry out painted, and the node not being colored enters resting state;
Wherein: V is the set of sensor node, S is the set of link between sensor node.
2. dormancy dispatching method according to claim 1, wherein said link weight is obtained by following formula:
Wherein: λ
ijnode x
i(i=1,2,3 ...) and node x
jform the weight of link; Node x
jit is link crossed node; ε
inode x
idump energy; h
ijnode x
iwith node x
jbetween channel coefficients; d
ijnode x
iwith node x
jbetween distance; V is constant, v=2-4.
3. dormancy dispatching method according to claim 1 and 2, also comprises: according to the dormancy dispatching system of setting, start next round dormancy dispatching.
4. dormancy dispatching method according to claim 3, wherein said dormancy dispatching system be for when energy harvesting sensor network can not meet monitored area coverage requirement, beginning next round dormancy dispatching.
5. the energy harvesting sensor network nodes dormancy dispatching system based on graph theory, comprising:
In monitored area, construct the device of the weighted digraph G=(V, S) of energy harvesting sensor network;
According to weighted digraph G=(V, S), calculate the device of the weight of each link;
According to the weighted value of each link, to forming the node of link, carry out painted, painted order is carried out successively according to the weighted value size of each link, when monitored area is covered completely by painted node, remaining node does not carry out painted, and the node not being colored enters the device of resting state;
According to the dormancy dispatching system of setting, start the device of next round dormancy dispatching.
6. dormancy dispatching system according to claim 5, wherein said dormancy dispatching system be for when energy harvesting sensor network can not meet monitored area coverage requirement, beginning next round dormancy dispatching.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310498477.2A CN103546948B (en) | 2013-10-22 | 2013-10-22 | Energy harvesting sensor network nodes dormancy dispatching method based on graph theory and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310498477.2A CN103546948B (en) | 2013-10-22 | 2013-10-22 | Energy harvesting sensor network nodes dormancy dispatching method based on graph theory and system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103546948A true CN103546948A (en) | 2014-01-29 |
CN103546948B CN103546948B (en) | 2016-08-17 |
Family
ID=49969910
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310498477.2A Expired - Fee Related CN103546948B (en) | 2013-10-22 | 2013-10-22 | Energy harvesting sensor network nodes dormancy dispatching method based on graph theory and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103546948B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103906210A (en) * | 2014-04-09 | 2014-07-02 | 河海大学 | Dormancy scheduling method for sensor network node of distribution type photovoltaic power generation device |
CN104812036A (en) * | 2015-05-15 | 2015-07-29 | 桂林电子科技大学 | Sleep scheduling method and system for energy acquisition sensor network |
CN111836282A (en) * | 2020-06-28 | 2020-10-27 | 中南大学 | Three-dimensional WSN node scheduling method and storage medium |
CN111882158A (en) * | 2020-06-24 | 2020-11-03 | 东南大学 | Mixed public bicycle scheduling demand prediction method based on Voronoi diagram |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070097895A1 (en) * | 2005-10-31 | 2007-05-03 | Robert Bosch Gmbh | Node control in wireless sensor networks |
CN101951609A (en) * | 2010-08-30 | 2011-01-19 | 西安电子科技大学 | Method for allocating dynamic frequency spectrums of cognitive network based on inverse image description |
CN102932799A (en) * | 2012-11-15 | 2013-02-13 | 陈宏滨 | Cognition sensor network model and method for optimizing life cycle of cognition sensor network model |
CN103297927A (en) * | 2012-03-04 | 2013-09-11 | 山东大学威海分校 | Distributed graph coloring link dispatch of wireless sensor network |
-
2013
- 2013-10-22 CN CN201310498477.2A patent/CN103546948B/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070097895A1 (en) * | 2005-10-31 | 2007-05-03 | Robert Bosch Gmbh | Node control in wireless sensor networks |
CN101951609A (en) * | 2010-08-30 | 2011-01-19 | 西安电子科技大学 | Method for allocating dynamic frequency spectrums of cognitive network based on inverse image description |
CN103297927A (en) * | 2012-03-04 | 2013-09-11 | 山东大学威海分校 | Distributed graph coloring link dispatch of wireless sensor network |
CN102932799A (en) * | 2012-11-15 | 2013-02-13 | 陈宏滨 | Cognition sensor network model and method for optimizing life cycle of cognition sensor network model |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103906210A (en) * | 2014-04-09 | 2014-07-02 | 河海大学 | Dormancy scheduling method for sensor network node of distribution type photovoltaic power generation device |
CN103906210B (en) * | 2014-04-09 | 2017-06-20 | 河海大学 | A kind of distribution type photovoltaic power generation device sensor network nodes dormancy dispatching method |
CN104812036A (en) * | 2015-05-15 | 2015-07-29 | 桂林电子科技大学 | Sleep scheduling method and system for energy acquisition sensor network |
CN104812036B (en) * | 2015-05-15 | 2018-04-17 | 桂林电子科技大学 | A kind of dormancy dispatching method and system of energy harvesting sensor network |
CN111882158A (en) * | 2020-06-24 | 2020-11-03 | 东南大学 | Mixed public bicycle scheduling demand prediction method based on Voronoi diagram |
CN111836282A (en) * | 2020-06-28 | 2020-10-27 | 中南大学 | Three-dimensional WSN node scheduling method and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN103546948B (en) | 2016-08-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Bathre et al. | Review on an Energy Efficient, Sustainable and Green Internet of Things | |
CN105959987A (en) | Data fusion algorithm for improving energy utilization rate and service performance of wireless sensor network | |
CN107182063A (en) | A kind of Cluster-Based Routing Protocols for Wireless Sensor based on natural energy | |
CN107525904A (en) | Wireless water quality monitoring system | |
CN102612080B (en) | Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding | |
CN103546948A (en) | Method and system for scheduling node sleeping of energy capture sensor network based on graph theory | |
CN102769890B (en) | Wireless sensor network routing method based on uniform clustering and data aggregation | |
ITRM20110571A1 (en) | DISTRIBUTED MONITORING METHOD FOR ENERGY EFFICIENCY IN BUILDINGS AND APPARATUS FOR ITS IMPLEMENTATION | |
Faid et al. | IoT-based low cost architecture for smart farming | |
TWM631494U (en) | Intelligent Power Management Edge Estimation System | |
CN103037467B (en) | Method and device for fusing data of wireless sensor network | |
Ramya et al. | Energy efficient enhanced LEACH protocol for IoT based applications in wireless sensor networks | |
CN103237364B (en) | A kind of integrated wireless sensor network data collection mechanism | |
Sankar et al. | Efficient Data Transmission Technique for Transmitting the Diagnosed Signals and Images in WBSN | |
CN103369619A (en) | Degree-based self-adaptive dynamic aggregation tree adjusting method | |
Nithyakalyani et al. | Analysis of node clustering algorithms on data aggregation in wireless sensor network | |
CN101808383A (en) | Method for selecting matrix wireless sensor network-oriented random routing | |
Sedighimanesh et al. | Improving wireless sensor network lifetime using layering in hierarchical routing | |
Xu | Fastest adaptive estimation algorithms for topological structure errors in smart grid networks | |
MALLA et al. | Smart energy efficient techniques for IOT enabled wireless node | |
Andhare et al. | Design and implementation of wireless sensor network for environmental monitoring | |
Premkumar et al. | ASIS Edge Computing Model to Determine the Communication Protocols for IoT Based Irrigation. | |
CN105722173A (en) | Large-scale WSNs topology control method based on two-way attraction mechanism | |
Jangid et al. | Mobile Wireless ADHOC Networks Energy Consumption Monitoring and Quality of Service Analysis | |
Ghosal et al. | Digitized city with IoT |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for 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: 20160817 |
|
CF01 | Termination of patent right due to non-payment of annual fee |