CN100591054C - A method for hierarchical energy power balance in wireless sensor network - Google Patents
A method for hierarchical energy power balance in wireless sensor network Download PDFInfo
- Publication number
- CN100591054C CN100591054C CN200810059850A CN200810059850A CN100591054C CN 100591054 C CN100591054 C CN 100591054C CN 200810059850 A CN200810059850 A CN 200810059850A CN 200810059850 A CN200810059850 A CN 200810059850A CN 100591054 C CN100591054 C CN 100591054C
- Authority
- CN
- China
- Prior art keywords
- class
- path
- node
- energy consumption
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- Y02B60/50—
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a classified energy consumption balancing method of a wireless sensor network, which comprises the following steps: a. All the sensor nodes relevant to perception are organizedto a class; a retransmission path in the class is established; b) the energy consumption balance of each node in the class is realized; c) a path between each class and other adjacent class is established; d) a base station uses a certain class head as a source node and selects a path with the longest life-span from a plurality of transmission paths as the best transmission path, thereby well realizing the energy consumption balance between classes based on a plurality of paths. Through a mixing transmission mode of combining hop-by-hop transmission and direct transmission and the data transmission between adjacent paths, the invention reduces the difference of energy consumption between nodes in the class and realizes the energy consumption balance between the classes through selecting the path with high residual energy from a plurality of paths; the method has the main advantages of effectively reducing the energy consumption difference of the whole wireless sensor network, therebyprolonging the life-span of the network.
Description
Technical field
The present invention relates to network energy consumption balance method, relate to a kind of method for hierarchical energy power balance in wireless sensor network specifically.
Background technology
Wireless sensor network is deployed in the inaccessible deathtrap of people usually, and it is very inconvenient that battery is replaced, and optimizes the network energy consumption and then prolongs the key technology that network life has become the wireless sensor network commercialization.The energy optimization of wireless sensor network is not only relevant with the energy consumption reduction of single node and the whole network, and depends on the balanced degree that energy consumption distributes at the whole network to a great extent.Therefore adopt in wireless sensor network that the energy consumption balance method is imperative efficiently.
Wireless sensor network energy consumption balance method mainly comprises at present: local energy consumption balance method and overall energy consumption balance method.Wherein local energy consumption balance method mainly adopts technology such as adaptive power control and class head rotate to realize the energy consumption balance between each node in a certain path or the zone.The technology such as multipath transmission and unequal cluster that mainly adopt overall situation energy consumption balance method realize the energy consumption balance between different paths or the zone.
Obviously, there are many deficiencies in above-mentioned prior art, specifically, local energy consumption balance method only can reduce the energy consumption difference between each node in a certain path or the zone, can't realize the energy consumption balance between heavy load and light load path or the zone, may cause a certain path or zone overheated, node is dead in advance, thereby shortens network life.And overall energy consumption balance method, though can effectively reduce the energy consumption difference between different paths or the zone, but owing to do not consider the energy consumption balance between each node in path or the zone, may cause some node, shorten network life equally because of overheated and dead.
Summary of the invention
At the problem of above-mentioned existence, the object of the present invention is to provide with the network life is a kind of method for hierarchical energy power balance in wireless sensor network that index is taken into account local and overall energy consumption balance simultaneously.
For achieving the above object, the technical solution used in the present invention is that it comprises the steps:
A) perception is relevant all the sensors groups of nodes is made into a class, and sets up transmission path in the class;
B) realize each node energy consumption balance in the class;
C) set up path between each class and its neighbours' class;
D) base station is that source node is selected the optimal transmission paths of the path of longest-lived as such from its many transmission paths with a certain class head, thereby has realized based on energy consumption balance between the class of multipath.
In the described step a), all the sensors node that perception is relevant is meant that all can detect the sensor node of a certain incident, and these sensor nodes have the spatial coherence of perception data and the temporal correlation of perception and forwarding operation.
In the described step a), transmission path is set up in the following way in the class, and the less Centroid of every other node average distance is the class head in election and the class, and other nodes are set up sense(-)class head's path along the direction that detected value increases in the class.
Described step b) comprises following steps:
B1) adopt forwarded hop-by-hop and the direct mixed transmission modes that combines of transmitting, reduce the energy consumption imbalance of different nodes on the interior transmission path of same class;
B2) when there is bigger energy consumption difference in adjacent transmission path, make many parent-offsprings node in the high energy consumption path by optional input link output data to low-energy consumption path;
B3) near class head's node by adopting forwarded hop-by-hop and directly transmitting the energy consumption balance that the mixed transmission modes that combines realizes itself and class head.
In the described step c), the path adopts camber line shape cutting in the more class radially path between class, thereby the energy consumption in path between class is shared path in each bar class.
In the described step d), the path life-span is meant the minimum value of all node residual amount of energy that this path comprises.
The beneficial effect that the present invention has is:
The present invention proposes a kind ofly by forwarded hop-by-hop with directly transmit the mixed transmission modes that combines and the data forwarding between adjacent path, reduce energy consumption difference between the class interior nodes; Realize the wireless sensor network energy consumption balance method of energy consumption balance between class by selecting high residual amount of energy path in the path between many classes.This energy consumption balance method has been considered regional interior local energy consumption balance and interregional overall energy consumption balance simultaneously, and it is compared with local energy consumption balance method, can reduce the energy consumption in heavy load zone effectively, reduces the influence of hot spot region to network life; Compare with overall energy consumption balance method, can reduce the energy consumption difference between the different nodes in the zone effectively, prevent that part of nodes is owing to the overheated dead in advance network life that shortens.The present invention by adopt forwarded hop-by-hop and directly transmit the mixed transport that combines, between adjacent path data forwarding and between many classes, select technology such as high residual amount of energy path in the path, alleviated the energy consumption in heavy load node and zone effectively, reduce part of nodes and zone owing to the overheated dead in advance network phenomenon of rupture that causes, thereby prolonged network life, had good availability and practicality.
Description of drawings
Fig. 1 is a method for hierarchical energy power balance in wireless sensor network flow chart of the present invention.
Fig. 2 is based on transmission path schematic diagram in the cluster of perceived relevance and the class in the embodiment of the invention.
Fig. 3 is based on path schematic diagram between a plurality of classes of perceived relevance and class.
Embodiment
The present invention is further illustrated below in conjunction with the drawings and specific embodiments.
Present embodiment is applied to the sensor node and the base station of wireless sensor network, is the method for hierarchical energy power balance that index realizes local and overall energy consumption balance simultaneously with the network life.As shown in Figure 1, it specifically comprises following steps:
The first, perception is relevant all the sensors groups of nodes is made into a class, and sets up transmission path in the class.
The sensor node of monitoring same event source has very strong perceived relevance, be embodied in the spatial coherence of adjacent sensors node perceived data and the temporal correlation of perception and forwarding operation, therefore that perception is relevant all the sensors groups of nodes is made into a class and will helps the abundant polymerization of perception data and the energy consumption balance in the class.
Be located at t constantly
n(n ∈ N) wireless sensor network has the individual event source of h (h ∈ N) to transfer activity to by dormancy, and then sensor node begins to collect data in this h zone.All can detect the sensor node of a certain incident and form a class based on perceived relevance, and the node detection value the closer to event source is big more, node detection value away from event source is more little more, with the equidistant or approaching equidistant node detection value approximately equal of event source.Thereby having formed with the event source is the center, is isopleth with the concentric circles, by interior detected value distribution pattern of successively decreasing step by step outward.Owing to the detected value of every other node in the class head node reception class, and the wireless transmission energy consumption increases with range index, and therefore the less Centroid of the interior every other node average distance of election and class helps reducing the total energy consumption of class for the class head.Other nodes are set up sense(-)class head's path along the direction that detected value increases in the class.Fig. 2 has provided based on transmission path schematic diagram in the cluster of perceived relevance and the class.H node representation class head wherein, rank and file in other node representation class.A series node constitutes Supreme Procuratorate's measured value isopleth node, and b series node constitutes time the Supreme People's Procuratorate's measured value isopleth node, and the rest may be inferred.The arrow starting point is a data transmitting node, and terminating point is a data reception node.The direction that rank and file's node increases along detected value in all arrow points central representation classes is set up the path of sense(-)class head H node.
If (sensor node among 0<l≤h) is S to regional l
L, i∈ N), and the difference of hypothesis between the measured value can be similar to during less than threshold value M and think that the two equates.Provided below based on transmission path method for building up in the cluster of perceived relevance and the class.
1) if S
L, iMeasured value greater than 0, S so
L, iBroadcast this measured value to its neighbours.Work as S
L, iAlmost measure when constantly perceiving 2 of varying in size or 2 above measured values, show that this node is positioned at the border or the boundary vicinity of 2 or 2 above classes, selects bigger measured value also this measured value to be broadcast to neighbours same.
2) S
L, mThe measured value that (m ∈ N) relatively receives and himself measured value are carried out different operating according to comparative result then.
2.1) if the measured value that receives greater than the measured value of himself, is put into father and mother generation tabulation to this neighbor node so.
2.2) if the measured value that receives less than the measured value of himself, is put into children's tabulation to this neighbor node so.
2.3) otherwise this neighbor node is put into brother's tabulation.
3) S
L, iState according to above-mentioned 3 tabulations is judged the role who oneself serves as.
3.1) if its father and mother generation tabulation is empty, and its children non-NULL of tabulating, then specifying it is candidate's class head.
3.2) if its children tabulation is empty, and its father and mother generation non-NULL of tabulating, then specifying it is class edge node; At the same measured value that constantly perceives more than 2 or 2 of measuring, show that this node also is the boundary node of 2 or 2 above classes simultaneously as fruit edge node.
3.3) all non-NULLs if its father and mother generation tabulation and children tabulate, then specifying it is via node.
4) if candidate's class head's brother tabulation is a non-NULL, several candidates' class head is arranged promptly.Candidate class head of random choose this moment is formal class head.If candidate's class head's brother tabulation is empty, this candidate's class head directly is designated as formal class head.Formal class head informs other final class head's election results of candidate's class head of all the sensors node in its children's tabulation and all, so that these sensor nodes are transmitted to same aggregation to measured value.
5) if S
L, iBe the member of other one or more classes, then claimed S
L, iThe frontier district node set that belongs to class l is designated as i ∈ Border, wherein
If comprise S
L, iThe class-mark of each class form set A ctive, then S
L, iThis measured value with from the historical greatest measurement { value of other event sources
L, i(j ∈ Active) all be transmitted to the class head.Class head compares and measures the size of value, if
Then claim
Boundary node for class l.
6), adopt a kind of node input link of part to count balance method for the energy consumption between the brotgher of node on the equilibrium isoline and reduce the control expense of energy consumption balance.If via node has a plurality of child nodes, wherein some child node only has a father and mother generation node, claims that these child nodes are single parent's child node, and claims that the input link from single parent's child node is essential input link; Some child node has the father and mother generation node more than 2 or 2, claims that then these child nodes are many parent-offsprings node, and claims that the input link from many parent-offsprings node is optional input link.
6.1) the input link number of each via node of initialization is the number of its essential input link.
6.2) each many parent-offsprings node adds up the current input link number of its each father and mother generation node, select father and mother generation node that current input link counts minimum to jump via node, and its input link number is added 1 for its next.
The second, realize each node energy consumption balance in the class.
Make the perception of class inner sensor node and transmit operation based on the cluster of perceived relevance to have very strong temporal correlation, each sensor node perception is also transmitted the energy consumption approximately equal of self measurement data.Yet because wireless sensor network generally adopts the multi-hop pass-through mode, the measurement data of class edge node need could arrive the class head through the relaying of a plurality of nodes, cause transmitting overload near class head's sensor node, it is lighter to transmit load away from class head's sensor node.Adopt forwarded hop-by-hop and directly transmit the mixed transmission modes that combines, reduce the energy consumption imbalance of different nodes on the interior transmission path of same class.When there is bigger energy consumption difference in adjacent transmission path, can make in the high energy consumption path many parent-offsprings node as far as possible by optional input link output data to low-energy consumption path, can transmit data volume by increasing gradually between this path during specific implementation, reduce the forwarding load in high energy consumption path, increase the forwarding load of low-energy consumption path simultaneously, energy consumption difference minimum until between adjacent path, thus realize the dynamic energy consumption balance between the path in the class.Though class head receives lot of data in the whole class, yet because it has carried out polymerizable functional, its output data quantity may be much smaller than the node on the contiguous transmission path, therefore can realize itself and class head's energy consumption balance by hybrid transmission technology near class head's node, thereby make the interior any internodal energy consumption difference of class be reduced to minimum value.
Three, set up path between each class and its neighbours' class.
On basis, set up the path between each class and its neighbours' class based on the cluster operation of perceived relevance.Poor in order to reduce between class in the path and other classes the energy consumption in path, the path adopts camber line shape to cut in the more class radially path between class, the energy consumption in path between class is shared path in each bar class, in class, adopt hybrid transmission technology to reduce in the class crossover node data load in path between path and class in the path as far as possible, thus the energy consumption balance of each node in the path in the class that realizes being cut.Fig. 3 has provided based on path schematic diagram between a plurality of classes of perceived relevance and class.Wherein each class all produces by the perceived relevance principle, path 1, path 2 and path 3 be path between the class of representation classes 2 and adjacent class 1, class 3, class 5 respectively, class 2 according to the selection of energy consumption equilibrium principle wherein a paths as optimal transmission paths to the base station transmits perception data.
As there being the edge node in the fruit, show that the class edge links to each other with the clear area, adopt path establishment method between following idle node cluster and class.Here idle node refers to never detect the sensor node of any incident source data.
1) path of each node of initialization self is ∞.Class edge node sends to neighbours and greets grouping, if neighbours' idle node has become idle class members, then carries out cluster again; Otherwise class edge node sends the initial probe grouping to neighbours, and surveying the path of dividing into groups to comprise is 1.Neighbours' idle node receives surveys grouping, if the path of himself is greater than 1, then this node self path is revised as 1, to survey the grouping sending node as a last hop node, and broadcast probe grouping, wherein survey the path of dividing into groups to comprise and increase to 2, otherwise abandon this grouping, do not carry out any operation.The rest may be inferred surveys grouping when idle node receives, and the path of himself is when surveying the path that grouping comprises, this node self path is revised as surveys the path that grouping comprises, to survey the grouping sending node as a last hop node, and broadcast probe grouping, wherein survey the path of dividing into groups to comprise and add 1, otherwise abandon this grouping, do not carry out any operation.Arrive the network edge node up to surveying grouping, return detection end along former road this moment, wherein comprises the sign of edge node.
2) class edge node is initiated the idle node cluster operation.If neighbours' idle node has become idle class members, then notify the class boundary node to initiate cluster operation by the class head; Otherwise along surveying informing network edge, the path node initiation cluster operation that grouping is set up.Class boundary node or network edge node send cluster and survey grouping, and its propagation rule is similar to the initial probe grouping.If have f bar boundary line or edge line, idle node to be clustered adds up to g, and ((path of 0<i≤f) is designated as length to idle node j for 0<j≤g) and sideline i
I, jIf
Then elect node j
1Class head for idle class.Class edge node becomes the boundary node of its affiliated class and this free time class.
3) idle class head initiates the path and set up to survey grouping, sets up himself and the interior path of the class of each class boundary node.Adopt then and above-mentioned general category between the path set up similar methods, set up path between the class of idle class and its neighbours' class.
Four, the base station is that source node is selected the optimal transmission paths of the path of longest-lived as such from its many transmission paths with a certain class head, thereby has realized preferably based on energy consumption balance between the class of multipath.
When each class and neighbours' class are set up between class after the path, class head reports to the base station with sign, neighbours' class sign and the residual amount of energy of self of this class, here hypothesis can obtain good energy consumption balance by hybrid transmission technology class interior nodes, represents the average residual complementary energy of this category node with class head's residual amount of energy.Because wireless senser energy consumption balance is a long-term relatively task, needn't keep the residual amount of energy of all nodes accurately to equate constantly, in order to reduce the number of times of residual amount of energy report, the residual amount of energy of node is quantized into several grades simultaneously, is called the residual amount of energy level of node.2 nodes are as long as the residual amount of energy level equates that promptly be considered to have equal residual amount of energy, class head is also only when the residual amount of energy level changes, just to the new residual amount of energy of base station report.
The base station receives after self identification, neighbours' class sign and the class residual amount of energy level of all classes, can derive with each class head is that source node is many transmission paths of destination node with the base station, here a grand node whole class being regarded as transmission path, therefore this transmission path claims the backbone transport path again; The base station is that source node is selected the optimal transmission paths of the path of longest-lived as such from its many transmission paths with a certain class head then, thereby has realized preferably based on energy consumption balance between the class of multipath.
The present invention provides following path life-span definition.
Definition 1: the path life-span is the minimum value of all node residual amount of energy of comprising of this path.
If P (l) is a certain transmission path, by on this transmission path, increasing the extensions path EP (l) that node can form original route.The base station receives after self identification, neighbours' class sign and the class residual amount of energy level of all classes, and need calculate in theory with each class head is that source node is the nearly all possible path of destination node with the base station.In order to reduce computational complexity, adopt the optimal transmission paths of calculating earlier near the internal layer class of base station, again based on these paths, carry out the principle of path expansion, progressively generate the optimal transmission paths of all classes of the whole network.Provide the definition of following n layer class.
Definition 2: the ground floor class is meant the class with the base station direct neighbor, second layer class is meant with ground floor class direct neighbor and the base station class of direct neighbor not, and n (n>2) layer class that the rest may be inferred is meant that with n-1 (n>2) layer class direct neighbor (the layer class of 0<m<n-1) be the class of direct neighbor not with any m.
Regulation is selected the less path of class of process when two paths life-spans equated, the selection of ground floor class is the optimal transmission paths of class to the path of base station without other class and directly, and the life-span of ground floor class optimal path is the residual amount of energy of class self.Provide the definition of n layer k priority class.
Definition 3: establish total m the class of n layer, long (0<the k<m+1) of certain class optimal transmission paths life-span k in n layer class wherein, perhaps the life-span of its optimal transmission paths k arranged side by side is long and class that optimal path comprises is less, claims that then such is a n layer k priority class.
On this basis, provide the definition of the adjacent k class of n layer.
Define in 4: the n layers with n-1 (n>1) layer k priority class direct neighbor that (priority class of 0<j<k) the not class of direct neighbor is the adjacent k class of n layer with any n-1 layer j.
We remember that the adjacent k class of n+1 layer is that (n+1, k), n+1 layer k priority class is that (n+1 k), provides the continuous extensions path of the adjacent k of n+1 layer, adjacent k j preferentially separates extensions path separates extensions path with the adjacent j of adjacent k definition to rnd further to nd.
Define adjacent k class of 5: the n+1 layers and n layer k priority class optimal transmission paths P
N, kThe extensions path of forming is called the continuous extensions path of the adjacent k of n+1 layer and is designated as CEP
N+1, k=nd (n+1, k) #P
N, kThe adjacent k class of n+1 layer crossed over some classes and n layer j priority class optimal transmission paths P
N, jThe extensions path of forming be called the adjacent k j of n+1 layer preferentially separate extensions path be designated as nd (n+1, k)~P
N, jThe adjacent k class of n+1 layer crossed over some classes and the continuous extensions path CEP of the adjacent j of n+1 layer
N+1, jThe extensions path of forming be called the adjacent j of the adjacent k of n+1 layer separate extensions path be designated as nd (n+1, k)~CEP
N+1, j
For the ease of the life-span in each path of relatively coming from same node, our definition does not comprise the pure life-span of the path life-span of source node for this path.If P (l) is a certain transmission path, then the pure life-span in this path is designated as PLf
P (l)
Its transmission path the best when neighbour's 1 class that easy proof is the 2nd layer selects the 1st layer of the 1st priority class to jump grand node as next.
Proof: establish the 1st a layer of total m class, wherein the 1st priority class optimal transmission paths life-span was such residual amount of energy E
Rnd (1,1), the optimal transmission paths life-span of other classes is the residual amount of energy E of respective class
Rnd (l, k)(0<k<m+1), the pure life-span of the 2nd layer of neighbour's 1 continuous extensions path is PLf
Nd (2,1) #rnd (1,1), the pure life-span that the 2nd layer of neighbour 1 k preferentially separates extensions path is PLf
Nd (2,1)~rnd (1, k)
Definition according to the k priority class has
E
rnd(1,1)≥E
rnd(1,k),(1)
PLf
nd(2,1)#rnd(1,1)=E
rnd(1,1),(2)
PLf
nd(2,1)~rnd(1,k)≤E
rnd(1,k)(3)
PLf
nd(2,1)#rnd(1,1)=E
rnd(1,1)≥E
rnd(1,k)≥PLf
nd(2,1)~rnd(1,k)。(4)
Its transmission path the best when promptly the 2nd layer of neighbour's 1 class selects the 1st layer of the 1st priority class to jump grand node as next.Card is finished.
If the second layer comprises q class, in like manner the pure life-span of the adjacent 2 continuous extensions paths of the second layer is not shorter than adjacent 2 k (2<k<q+1) preferentially separates extensions path, but may be shorter than adjacent 2 adjacent 1 separation extensions paths.We determine the selection of the 2nd layer of neighbour's 2 class optimal transmission paths according to the 2nd layer of neighbour 2 continuous extensions paths and the adjacent 2 adjacent 1 pure life-span sizes of separating extensions path.
PLf
nd(2,2)#rnd(1,2)=E
rnd(1,2),(5)
PLf
nd(2,2)~nd(2,1)#rnd(1,1)≤Lf
nd(2,1)#rnd(1,1)。(6)
(1) if E
Rnd (1,2)〉=Lf
Nd (2,1) #rnd (1,1), (7)
PLf then
Nd (2,2) #rnd (1,2)=E
Rnd (1,2)〉=Lf
Nd (2,1) #rnd (1,1)〉=PLf
Nd (2,2)~nd (2,1) #rnd (1,1), promptly the 2nd layer of neighbour's 2 continuous extensions path are better.
(2) if E
Rnd (1,2)<Lf
Nd (2,1) #rnd (1,1), (8)
Seek a paths between the 2nd layer of neighbour's 2 class and adjacent 1 class, this path is designated as nd (2,2)~nd (2,1).If there is a paths nd (2,2)~nd (2,1), make
PLf
nd(2,2)~nd(2,1)>E
rnd(1,2)。(9)
Because PLf
Nd (2,2)~nd (2,1) #rnd (1,1)=min (PLf
Nd (2,2)~nd (2,1), Lf
Nd (2,1) #rnd (1,1))>E
Rnd (1,2), (10)
Promptly the 2nd layer of neighbour's 2 adjacent 1 separation extensions path are better.
If instead, have following inequality for all path nd (2,2)~nd (2,1):
PLf
nd(2,2)~nd(2,1)≤E
rnd(1,2),(11)
PLf then
Nd (2,2)~nd (2,1) #rnd (1,1)=min (PLf
Nd (2,2)~nd (2,1), Lf
Nd (2,1) #rnd (1,1))=
PLf
nd(2,2)~nd(2,1)≤E
rnd(1,2)。(12)
Promptly the 2nd layer of neighbour's 2 continuous extensions path are better.
In order to reduce the complexity of seeking suitable path between adjacent 2 classes and adjacent 1 class, can limit the length in this path.
In like manner for the 2nd layer of adjacent k class, (0<j<k) separates the pure life-span size of extensions path, determines the selection of the 2nd layer of adjacent k class optimal transmission paths according to the 2nd layer of continuous extensions path of adjacent k and the adjacent j of adjacent k for we.After the 2nd layer of all class are finished the selection of optimal transmission paths, all kinds of optimal transmission paths life-span is sorted, obtain the 2nd layer of all kinds of priority number, this information can be used for the selection of the 3rd layer of all kinds of optimal transmission paths.The rest may be inferred, and all classes of the whole network all can be set up the optimal transmission paths based on the energy consumption balance.
Claims (1)
1, a kind of method for hierarchical energy power balance in wireless sensor network is characterized in that this method comprises the steps:
A) perception is relevant all the sensors groups of nodes is made into a class, and sets up transmission path in the class:
A1) all the sensors node that perception is relevant is meant that all can detect the sensor node of a certain incident, and these sensor nodes have the spatial coherence of perception data and the temporal correlation of perception and forwarding operation;
A2) transmission path is set up in the following way in the class, and the less Centroid of every other node average distance is the class head in election and the class, and other nodes are set up sense(-)class head's path along the direction that detected value increases in the class;
B) realize each node energy consumption balance in the class; Comprise following steps:
B1) adopt forwarded hop-by-hop and the direct mixed transmission modes that combines of transmitting, reduce the energy consumption imbalance of different nodes on the interior transmission path of same class;
B2) when there is bigger energy consumption difference in adjacent transmission path, make many parent-offsprings node in the high energy consumption path by optional input link output data to low-energy consumption path;
B3) near class head's node by adopting forwarded hop-by-hop and directly transmitting the energy consumption balance that the mixed transmission modes that combines realizes itself and class head;
C) set up path between each class and its neighbours' class:
The path adopts camber line shape cutting in the more class radially path between class, thereby the energy consumption in path between class is shared path in each bar class;
D) base station is that source node is selected the optimal transmission paths of the path of path longest-lived as such from its many transmission paths with a certain class head, thereby has realized based on energy consumption balance between the class of multipath; The path life-span is meant the minimum value of all node residual amount of energy that this path comprises.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200810059850A CN100591054C (en) | 2008-02-22 | 2008-02-22 | A method for hierarchical energy power balance in wireless sensor network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200810059850A CN100591054C (en) | 2008-02-22 | 2008-02-22 | A method for hierarchical energy power balance in wireless sensor network |
Publications (2)
Publication Number | Publication Date |
---|---|
CN101237414A CN101237414A (en) | 2008-08-06 |
CN100591054C true CN100591054C (en) | 2010-02-17 |
Family
ID=39920779
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN200810059850A Expired - Fee Related CN100591054C (en) | 2008-02-22 | 2008-02-22 | A method for hierarchical energy power balance in wireless sensor network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN100591054C (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8514760B2 (en) * | 2010-04-27 | 2013-08-20 | International Business Machiness Corporation | Adaptive wireless sensor network and method of routing data in a wireless sensor network |
US9357472B2 (en) | 2010-04-27 | 2016-05-31 | International Business Machines Corporation | Adaptive wireless sensor network and method of routing data in a wireless sensor network |
CN102647726A (en) * | 2012-02-17 | 2012-08-22 | 无锡英臻科技有限公司 | Balancing optimizing strategy for energy consumption of coverage of wireless sensor network |
CN107606745B (en) * | 2017-09-27 | 2019-09-27 | 南京中灿科技有限公司 | Metro Air conditioner season by when ring control energy consumption prediction technique |
CN109195192B (en) * | 2018-08-16 | 2022-04-01 | 全球能源互联网研究院有限公司 | Energy balance scheduling method, device and system for wireless sensor network and storage medium |
CN112367259B (en) * | 2021-01-15 | 2021-04-16 | 广州技象科技有限公司 | Internet of things data message distribution method and device |
-
2008
- 2008-02-22 CN CN200810059850A patent/CN100591054C/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
CN101237414A (en) | 2008-08-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN100591054C (en) | A method for hierarchical energy power balance in wireless sensor network | |
CN103781148B (en) | Stable cluster method for routing based on link-aware in vehicular ad hoc network | |
Varshney et al. | Variants of LEACH routing protocol in WSN: A comparative analysis | |
CN107360612B (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
Das et al. | Fuzzy based energy efficient multicast routing for ad-hoc network | |
CN105898764B (en) | Multi-level energy heterogeneous wireless sensor network deployment method | |
CN104320823A (en) | Wireless sensor network clustering method based on Sink trust value evaluation | |
CN107371188B (en) | Energy consumption balanced routing method capable of controlling cluster scale | |
CN1960331A (en) | Global energy balanced intellectualized algorism for routing wireless sensing network | |
CN104883301A (en) | Wireless sensor network clustering routing protocol based on residual energy and communication cost | |
CN109618368B (en) | Wireless sensor network data fusion scheduling algorithm for time delay and power consumption joint optimization | |
Bouhafs et al. | A semantic clustering routing protocol for wireless sensor networks. | |
CN104185237A (en) | Robustness optimization algorithm based on ant colony algorithm | |
CN112822746A (en) | Energy-efficient wireless sensor network clustering algorithm | |
CN102761881A (en) | Method for solving optimal coverage control set of static node in wireless sensor network | |
CN102238561B (en) | Based on the node deployment method of the layering cooperation overlay model of Energy Efficient | |
CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
CN107135155A (en) | A kind of opportunistic network routing method based on node social relationships | |
Peng et al. | LEACH protocol based two-level clustering algorithm | |
CN108366409B (en) | Reliable multipath aggregation routing method based on energy balance | |
CN102892189B (en) | Energy consumption balance-based method for constructing data fusion tree of wireless sensor network | |
CN102781059A (en) | Intelligent wireless sensor network routing method | |
Awaad et al. | Extending the WSN lifetime by Dividing the Network Area into a Specific Zones | |
Pengfei et al. | Sensor selection in wireless sensor networks for structural health monitoring | |
Subbaiah et al. | Mobile ad hoc network |
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 | ||
C17 | Cessation of patent right | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100217 Termination date: 20140222 |