CN101350831A - Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination - Google Patents
Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination Download PDFInfo
- Publication number
- CN101350831A CN101350831A CNA2008101199214A CN200810119921A CN101350831A CN 101350831 A CN101350831 A CN 101350831A CN A2008101199214 A CNA2008101199214 A CN A2008101199214A CN 200810119921 A CN200810119921 A CN 200810119921A CN 101350831 A CN101350831 A CN 101350831A
- Authority
- CN
- China
- Prior art keywords
- node
- intersection point
- execution
- neighbor
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a covering and controlling method of the wireless sensor network which adopts the covering judgment of multiple intersection points. The method carries out the distributed type node dynamic sleep control on the wireless sensor network via a redundancy judgment rule of the covering degree of the multiple intersection points. At the initial period of the network operation, each node is at the working status and periodically broadcasts the working message to the neighboring node, simultaneously collects the working information of all neighboring nodes; when one node receives the information from the neighboring node, the node carries out the redundancy qualification judgment, and keeps or transforms the status according to the judgment result for realizing the distributed type node dynamic sleep control of the sensor network. The method judges the redundancy of the network node according to the necessary and sufficient condition for avoiding the occurrence of the blind spot of covering, simultaneously enables the number of the active nodes to decrease to the minimum, decreases the power consumption of the system, prolongs the service life of the network, and realizes the coverage-configurable network covering and controlling which has the advantages of completeness, reliability and high efficiency.
Description
Technical field
The present invention relates to a kind of wireless sensor network cover control method, more particularly say, be meant that a kind of multiplex intersection point coverage judgement method that adopts judges redundant node in the network, thereby realize wireless sensor network is carried out the overlapping control method of distributed node dynamic dormancy control.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) be exactly to form by being deployed in wireless sensers a large amount of in the monitored area, the network system (referring to shown in Figure 1) of the self-organizing of a multi-hop that forms by communication, its objective is the information of perceived object in perception collaboratively, collection and the processing network's coverage area, and send to the user.Each wireless senser is called a node in wireless sensor network, node that can UNICOM with this node is called the neighbor node of this node.Each node generally has two states, and the one, operating state (also claiming active state), the 2nd, resting state.
In the monitoring of wireless sensor network was used, target generally occurred whenever and wherever possible, and may have certain mobility, and therefore, wireless sensor network need be to monitored area N
L * M(this monitored area N
L * MBe to be the rectangular area of L, M with the length of side, length of side L, M can be the distances of 10m～1000m) keep certain covering quality (this covering quality include storage overhead, the covering algorithm of communication-cost, the covering algorithm of coverage K, node density, covering algorithm power consumption, cover the related content such as related with connection) could capture the state and the variation thereof of target timely.(O, r) generally be conceptualized as with oneself is the disk (referring to shown in Figure 2) of r (this sensing radius r can be the distance of 10m～100m) as center of circle O, sensing radius to the sensitive zones d of each node.A sensor node N
iSensitive zones be designated as D (N
i)={ p (x, y) | p (x, y) ∈ A ∧ (x-x
i)
2+ (y-y
i)
2≤ r
2, abbreviate node N as
iSensitive zones; Node N
iThe sensitive zones border be Db (N
i)={ p (x, y) | p (x, y) ∈ A ∧ (x-x
i)
2+ (y-y
i)
2=r
2.Monitored area N
L * MInterior arbitrfary point, be designated as p (x, y).
Coverage K is meant at monitored area N
L * MInterior any one target is minimum, and (O r) covers, and the network coverage degree that then is called this monitored area is K, abbreviates coverage K as by the sensitive zones d of K node.As the service quality of weighing the network monitor function, coverage K is high more, and monitored area N is described usually for coverage K
L * LThe effect that is capped is good more.
It is uneven that the deployment way at random of wireless sensor network causes node distribution, the sensitive zones of a plurality of nodes tends to overlap the overlay area (referring to shown in Figure 2, the band hatched example areas is arranged) among the figure, make that the coverage K of part sensitive zones is too high, redundancy appears in the wireless senser that causes being provided with in the wireless sensor network, causes the construction cost of wireless sensor network to increase.Otherwise the sensitive zones of a plurality of nodes is mutually non-intersect or then can omit target phenomenon (also claiming to owe to cover blind spot) at a distance of certain distance, does not reach monitored area N
L * MThe purpose of monitoring.
In actual applications, in order to reach the purpose to the monitored area monitoring, a lot of wireless sensor networks all adopt mode and the sensor node distribution comparatively dense of disposing at random, and the overlay area of adjacent node can overlap each other, thereby causes the generation of redundant node.Require under the K in certain coverage,, illustrate that then this node is a redundant node if each point in the sensitive zones of a node is all covered by the sensitive zones of all the other K neighbor node.Therefore, in actual applications, because the node energy is limited, the method that relies on the equal full work attendance work of all nodes to improve coverage is unpractical.So a major issue in the wireless sensor network research is exactly: how to control the state of sensor node, allow redundant node enter resting state, to guarantee but to safeguard higher covering quality under less sensor node working condition.
In general, it is least in power-consuming when node enters resting state, therefore pass through the state of node in rationalization's network, make redundant node enter the sleep state of low-power consumption, reduce the density of active node in the network, thereby reduce whole network energy consumption, to prolong network lifetime, this is called node scheduling mechanism, is also referred to as the Coverage Control agreement.
A basic demand to node scheduling can not reduce network coverage quality exactly behind the closed portion node, promptly remaining live-vertex must can be kept network coverage degree, can not occur owing to cover blind spot, and the node number that is in active state is minimized.In the Coverage Control agreement, whether monitored area how to judge a node is covered fully by its neighbor node is the key of rule, i.e. problem is differentiated in redundant node dormancy.
There is the agreement based on node density control Coverage Control in Wireless Sensor Networks agreement aspect at present, but this density control protocol can not guarantee coverage fully, and does not support configurable coverage; The most representative Coverage Control agreement comprises Ottawa agreement (by a kind of Coverage Control agreement that Ottawa university proposes, therefore gaining the name) and CCP (Coverage Configuration Protocol) agreement.The Ottawa agreement has only been considered a limited number of neighbor node, thereby still there is too much redundant node in the network, therefore the differentiation rule that adopted of Ottawa agreement be one fully but not necessary condition do not have effectively to reduce the network power consumption, and do not support configurable coverage.Whether the intersection point of the differentiation rule that the CCP agreement provides by judging adjacent sensitive zones is covered by K node and screens redundant node, but this rule can produce erroneous judgement and close non-redundant node, therefore thereby causing covering the appearance of blind spot, is necessity of redundant node but not adequate condition.
Summary of the invention
In view of this, the purpose of this invention is to provide a kind of distributed Coverage Control agreement that can judge the redundancy of network node with sufficient and necessary condition.This agreement is carried out the control of distributed node dynamic dormancy by multiplex intersection point coverage redundant differentiation rule (EOER rule) to wireless sensor network.Initial in the network operation, each node is all in running order, and regularly to neighbor node broadcasting message, collects the job information of all neighbor nodes simultaneously; When a node is received the message of neighbor node, carrying out redundant qualification differentiates, keep or change its state by the difference of differentiating the result, realizing the distributed node dynamic dormancy control of sensor network, and judge the redundancy of network node, the appearance of avoiding covering blind spot with sufficient and necessary condition, it is minimum that the live-vertex number is reduced to, reduce system power dissipation, prolong network life, realized the configurable complete reliably network coverage efficiently control of coverage.
A kind of wireless sensor network cover control method that adopts the multiplex intersection point coverage judgement of the present invention, the arbitrary node N in the sensor network
iInitially all in running order, and regularly to neighbor node broadcasting message, and when receiving that neighbor node message or timer overflow, carry out different treatment steps and come Control Node work or dormancy, carry out the following step:
Step 100: arbitrary node N
iWhether receive one from its neighbor node N
IjWork message AM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 101; Be not "No" then to continue execution in step 100 if receive;
Described work message AM (ij, (x
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 101: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 102; Be not combined into "No" if be inconsistent, then execution in step 100;
Step 102: start and withdraw from timer T
IW, and execution in step 103;
The described timer T that withdraws from
IWThe time interval that is provided with is 3s～5min;
Step 103: judge and withdraw from timer T
IWWhether overflow, be "Yes" if overflow, then execution in step 105; Be not "No" if overflow, then execution in step 104;
Step 104: judge arbitrary node N
iWhether receive from neighbor node N
IjWithdraw from message WM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 101; If do not receive to be "No", then execution in step 103;
Described message WM (the ij, (x of withdrawing from
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 105: arbitrary node N
iBroadcast one and withdraw from message WM (i, (x
i, y
i)), and execution in step 106;
Described message WM (the i, (x of withdrawing from
i, y
i)) in i represent node N
iIdentification number, (x
i, y
i) expression node N
iCoordinate position in wireless sensor network;
Step 106: arbitrary node N
iEnter resting state, and start dormancy timer T
s
Described dormancy timer T
sThe time interval that is provided with is 3s～5min;
Step 107: judge dormancy timer T
sWhether overflow, be "Yes" if overflow, then execution in step 108; Be not "No" if overflow, then execution in step 107;
Step 108: start and intercept timer T
l, and execution in step 109;
The described timer T that intercepts
lThe time interval that is provided with is 3s～5min;
Step 109: judge and intercept timer T
lWhether overflow, be "Yes" if overflow, then execution in step 106; Be not "No" if overflow, then execution in step 110;
Step 110: judge arbitrary node N
iWhether receive from neighbor node N
IjWork message AM (ij, (x
Ij, y
Ij)) or add message JM (ij, (x
Ij, y
Ij)) or withdraw from message WM (ij, (x
Ij, y
Ij)), be "Yes" if receive one of them, then execution in step 111; If all do not receive to be "No", then execution in step 109;
Step 111: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 108; Be not combined into "No" if be inconsistent, then execution in step 112;
Step 112: start adding timer T
j, and execution in step 113;
Described adding timer T
jThe time interval that is provided with is 3s～5min;
Step 113: judge to add timer T
jWhether overflow, be "Yes" if overflow, then execution in step 116; Be not "No" if overflow, then execution in step 114;
Step 114: judge arbitrary node N
iWhether receive from neighbor node N
IjAdding message JM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 115; If do not receive to be "No", then execution in step 112;
Described adding message JM (ij, (x
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 115: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 106; Be not combined into "No" if be inconsistent, then execution in step 112;
Step 116: arbitrary node N
iBroadcast one and add message JM (i, (x
i, y
i)), and execution in step 117;
Described adding message JM (i, (x
i, y
i)) in i represent node N
iIdentification number, (x
i, y
i) expression node N
iCoordinate position in wireless sensor network;
Step 117: arbitrary node N
iIn running order, and periodic broadcasting work message AM (i, (x
i, y
i));
At this moment, arbitrary node N
iFinished a Coverage Control bout from operating state-resting state-operating state.
The wireless sensor network cover control method of described employing multiplex intersection point coverage judgement is adopting the redundant differentiation of multiplex intersection point coverage rule to carry out node N
iRedundant qualification differentiate and have the following steps:
Step 21: node N
iBroadcast beacon messages, and set up neighbor node by the beacon message of collecting adjacent node and gather Neighbor
i
Described beacon message is meant and includes node N
iSelf identification number, node N
iCoordinate position in wireless sensor network; Node N
iThe beacon message of broadcasting comprises work message AM (i, (x
i, y
i)), add message JM (i, (x
i, y
i)) and withdraw from message WM (i, (x
i, y
i));
Step 22: inner intersection point collection obtains
In the scope of monitored area, obtain node N
iThe inside intersection point S set I_I (i) of all neighbor nodes of perception intra-zone;
Step 23: border intersection point collection obtains
In the scope of monitored area, obtain node N
iThe border intersection point S set I_B (i) of all neighbor nodes of perception zone boundary;
Step 24: regional intersection point collection obtains
Obtain node N
iThe regional intersection point S set I_E (i) on the border of perception zone boundary and monitored area=and p (x, y) | p (x, y) ∈ Db (N
i) ∧ p (x, y) ∈ Nb
L * M; In the formula, p (x, y) any physical points on the expression monitored area, Db (N
i) expression node N
iThe sensitive zones border, Nb
L * MExpression monitored area N
L * MThe border;
Step 25: calculate the intersection point coverage and come predicate node N
iRedundant qualification
(x, y), (x is y) by node N to calculate p to each the intersection point p among inner intersection point S set I_I (i), border intersection point S set I_B (i) and the regional intersection point S set I_E (i)
iThe coverage PCov (p (x that covers of neighbor node, y)), if (p (x, y)) requires K, then node N more than or equal to coverage to the coverage PCov of each intersection point among inner intersection point S set I_I (i), border intersection point S set I_B (i) and the regional intersection point S set I_E (i)
iHave redundant qualification, on the contrary node N
iDo not have redundant qualification.
The advantage of overlapping control method of the present invention is:
1. the redundant differentiation of the multiplex intersection point coverage that overlapping control method of the present invention adopted rule is to judge the completeness rule of redundant node, it is the sufficient and necessary condition whether decision node has redundant qualification, can accurately filter out all redundant nodes in the wireless sensor network, can not occur judging the covering blind spot that causes by accident yet, realize the complete reliable Coverage Control of network because of rule.
2. overlapping control method of the present invention can be controlled coverage accurately, even increase the total number of disposing node, also can keep the live-vertex number a stable level, thereby save the power consumption expense of redundant node to greatest extent, reduce system power dissipation, prolong network life.
3. this overlapping control method has solved: (1) distributed earth, predeterminable ground of network coverage degree Coverage Control problem; (2) proposed the sufficient and necessary condition that redundant node is judged, guaranteed that promptly redundancy eliminates fully and do not have a blind spot.
Description of drawings
Fig. 1 is the random distribution schematic diagram of arbitrary node in the wireless sensor network.
Fig. 2 is that the sensitive zones between the part of nodes covers overlapping schematic diagram in the wireless sensor network.
Fig. 3 is the flow chart of Coverage Control of the present invention.
Fig. 4 is the calculating schematic diagram that redundant node of the present invention is differentiated rule.
To be two kinds of different agreements differentiate the comparison diagram of the covering blind spot number that the erroneous judgement of rule causes because of employed redundant node to Fig. 5 A.
Fig. 5 B is the comparison diagram of the live-vertex number of three kinds of different agreements generations.
Fig. 5 C is the comparison diagram of the average coverage of network of two kinds of different agreements generations.
Embodiment
The present invention is further illustrated below in conjunction with accompanying drawing:
The present invention is the redundant differentiation of a kind of employing multiplex intersection point coverage rule (being called for short the EOER rule) is carried out the control of distributed node dynamic dormancy to wireless sensor network a overlapping control method, this overlapping control method is initial in the network operation, and the sensor node under each is in running order is collected the sign and the positional information of all neighbor nodes; When some nodes are received the message of neighbor node, carry out redundant qualification with the EOER rule and differentiate, be to keep operating state by the difference decision node of differentiating the result, or resting state; And with this EOER rule each node in the sensor network is carried out the distributed node dynamic dormancy and control the state exchange of realizing each node.Overlapping control method of the present invention is judged the redundancy of network node with sufficient and necessary condition, avoid covering the appearance of blind spot, make the number of nodes of operating state reduce to minimum simultaneously, thereby reduce the wireless sensor network power consumption, in the prolonging wireless sensor network life-span, realized the configurable complete reliably network coverage efficiently control of coverage.
In the present invention, when wireless sensor network was initial, each node in all wireless sensor networks was all in running order, and T at set intervals
aBroadcast a work message that includes the coordinate position in self identification number, the place wireless sensor network.Described T at set intervals
aBe meant be set in the wireless senser (network node), be used to write down network state and start a time value when finishing, can be set at 5min, 3s or 10s.Each node in the wireless sensor network carries out network coverage control in the bout mode.
Referring to shown in Figure 3, network cover control method of the present invention, the arbitrary node N in the sensor network
iInitially all in running order, and regularly to neighbor node broadcasting message, and when receiving that neighbor node message or timer overflow, carry out different treatment steps and come Control Node work or dormancy, carry out the following step:
Step 100: arbitrary node N
iWhether receive one from its neighbor node N
IjWork message AM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 101; Be not "No" then to continue execution in step 100 if receive;
Described work message AM (ij, (x
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 101: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 102; Be not combined into "No" if be inconsistent, then execution in step 100;
Step 102: start and withdraw from timer T
IW, and execution in step 103;
The described timer T that withdraws from
IWThe time interval that is provided with is 3s～5min;
Step 103: judge and withdraw from timer T
IWWhether overflow, be "Yes" if overflow, then execution in step 105; Be not "No" if overflow, then execution in step 104;
Step 104: judge arbitrary node N
iWhether receive from neighbor node N
IjWithdraw from message WM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 101; If do not receive to be "No", then execution in step 103;
Described message WM (the ij, (x of withdrawing from
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 105: arbitrary node N
iBroadcast one and withdraw from message WM (i, (x
i, y
i)), and execution in step 106;
Described message WM (the i, (x of withdrawing from
i, y
i)) in i represent node N
iIdentification number, (x
i, y
i) expression node N
iCoordinate position in wireless sensor network;
Step 106: arbitrary node N
iEnter resting state, and start dormancy timer T
s
Described dormancy timer T
sThe time interval that is provided with is 3s～5min;
Step 107: judge dormancy timer T
sWhether overflow, be "Yes" if overflow, then execution in step 108; Be not "No" if overflow, then execution in step 107;
Step 108: start and intercept timer T
l, and execution in step 109;
The described timer T that intercepts
lThe time interval that is provided with is 3s～5min;
Step 109: judge and intercept timer T
lWhether overflow, be "Yes" if overflow, then execution in step 106; Be not "No" if overflow, then execution in step 110;
Step 110: judge arbitrary node N
iWhether receive from neighbor node N
IjWork message AM (ij, (x
Ij, y
Ij)) or add message JM (ij, (x
Ij, y
Ij)) or withdraw from message WM (ij, (x
Ij, y
Ij)), be "Yes" if receive one of them, then execution in step 111; If all do not receive to be "No", then execution in step 109;
Step 111: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 108; Be not combined into "No" if be inconsistent, then execution in step 112;
Step 112: start adding timer T
j, and execution in step 113;
Described adding timer T
jThe time interval that is provided with is 3s～5min;
Step 113: judge to add timer T
jWhether overflow, be "Yes" if overflow, then execution in step 116; Be not "No" if overflow, then execution in step 114;
Step 114: judge arbitrary node N
iWhether receive from neighbor node N
IjAdding message JM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 115; If do not receive to be "No", then execution in step 112;
Described adding message JM (ij, (x
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 115: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 106; Be not combined into "No" if be inconsistent, then execution in step 112;
Step 116: arbitrary node N
iBroadcast one and add message JM (i, (x
i, y
i)), and execution in step 117;
Described adding message JM (i, (x
i, y
i)) in i represent node N
iIdentification number, (x
i, y
i) expression node N
iCoordinate position in wireless sensor network;
Step 117: arbitrary node N
iIn running order, and periodic broadcasting work message AM (i, (x
i, y
i)).
At this moment, arbitrary node N
iFinished a Coverage Control bout from operating state-resting state-operating state.
Other node in the wireless sensor network all carries out Coverage Control according to step 100 to step 117 to be handled and carries out redundant qualification and judge.
Referring to shown in Figure 4, in the present invention, adopt the redundant differentiation of multiplex intersection point coverage rule (being called for short the EOER rule) to carry out node N
iRedundant qualification differentiate and have the following steps:
Step 21: node N
iBroadcast beacon messages, and set up neighbor node by the beacon message of collecting adjacent node and gather Neighbor
i
Described beacon message is meant and includes node N
iSelf identification number, node N
iCoordinate position in wireless sensor network; Node N
iThe beacon message of broadcasting comprises work message AM (i, (x
i, y
i)), add message JM (i, (x
i, y
i)) and withdraw from message WM (i, (x
i, y
i)).
Step 22: inner intersection point collection obtains
In the scope of monitored area, obtain node N
iThe inside intersection point S set I_I (i) of all neighbor nodes of perception intra-zone;
Among the figure, at node N
iIn the perception zone there be S1 number the intersection point of all neighbor nodes; Be the element among the intersection point S set I_I (i) for S1 number.
Step 23: border intersection point collection obtains
In the scope of monitored area, obtain node N
iThe border intersection point S set I_B (i) of all neighbor nodes of perception zone boundary;
Among the figure, at node N
iThe borderline intersection point in perception zone has S2 number, S3 number, S4 number, S5 number, S6 number, S7 number, S9 number, and these numbers are the element among the intersection point S set I_B (i).Need to prove, though be for S8 number node N
iWith its neighbor node N
uThe intersection point on border, but because this intersection point not in the scope of monitored area, so ignore, does not add among the intersection point S set I_B (i).
Step 24: regional intersection point collection obtains
Obtain node N
iThe regional intersection point S set I_E (i) on the border of perception zone boundary and monitored area=and p (x, y) | p (x, y) ∈ Db (N
i) ∧ p (x, y) ∈ Nb
L * M; In the formula, p (x, y) any physical points on the expression monitored area, Db (N
i) expression node N
iThe sensitive zones border, Nb
L * MExpression monitored area N
L * MThe border.
Among the figure, at node N
iThe intersection point on the border of perception zone boundary and monitored area has S10 number, S11 number, and S10 number, S11 number are the element among the regional intersection point S set I_E (i).
Step 25: calculate the intersection point coverage and come predicate node N
iRedundant qualification
(x, y), (x is y) by node N to calculate p to each the intersection point p among inner intersection point S set I_I (i), border intersection point S set I_B (i) and the regional intersection point S set I_E (i)
iThe coverage PCov (p (x that covers of neighbor node, y)), if (p (x, y)) requires K, then node N more than or equal to coverage to the coverage PCov of each intersection point among inner intersection point S set I_I (i), border intersection point S set I_B (i) and the regional intersection point S set I_E (i)
iHave redundant qualification, on the contrary node N
iDo not have redundant qualification.
In the present invention, what the sensing model of each node adopted is boolean's sensor model, and promptly each node all has the sensing radius r of a fixed size, i.e. node N
iSensitive zones be designated as D (N
i)={ p (x, y) | p (x, y) ∈ A ∧ (x-x
i)
2+ (y-y
i)
2≤ r
2, abbreviate node N as
iSensitive zones; Node N
iThe sensitive zones border be Db (N
i)={ p (x, y) | p (x, y) ∈ A ∧ (x-x
i)
2+ (y-y
i)
2=r
2.Monitored area N
L * MInterior arbitrfary point, be designated as p (x, y).
In the present invention, obtaining of inner intersection point S set I_I (i) has the following steps in the step 22:
Step 22-A: from neighbor node set Neighbor
iIn select arbitrarily a neighbor node N
Ij
Step 22-B: from neighbor node set Neighbor
iOne of middle selection removes neighbor node N
IjAnother neighbor node N in addition
Im
Step 22-C: according to N
IjAnd N
ImCome calculation level set PI
i(j Θ m)=and p (x, y) | p (x, y) ∈ Db (N
Ij) ∧ p (x, y) ∈ Db (N
Im) ∧ p (x, y) ∈ Di (N
i) ∧ p (x, y) }, in the formula, p (x, y) any physical points in the expression monitored area, Db (N
Ij) expression neighbor node N
IjThe sensitive zones border, Db (N
Im) expression neighbor node N
ImThe border of sensitive zones, Di (N
i) expression node N
iThe inside of sensitive zones;
Step 22-D: will put set PI
iElement in (j Θ m) adds among the inner intersection point S set I_I (i), i.e. SI_I (i)=SI_I (i) ∪ PI
i(j Θ m);
Step 22-E: repeating step 22-B is to step 22-D, up to handling neighbor node set Neighbor
iIn node N
Im
Step 22-F: select neighbor node set Neighbor
iIn the another one neighbor node, repeating step 22-B is to step 22-E, up to the neighbor node set Neighbor that disposes
iIn all elements.
In the present invention, obtaining of border intersection point collection SI_B (i) has the following steps in the step 23:
Step 23-A: from neighbor node set Neighbor
iIn select arbitrarily a neighbor node N
Ij
Step 23-B: according to N
IjCome calculation level set PB
i(j Θ i)=and p (x, y) | p (x, y) ∈ Db (N
Ij) ∧ p (x, y) ∈ Db (N
i), in the formula, p (x, y) any physical points in the expression monitored area, Db (N
Ij) expression neighbor node N
IjThe border of sensitive zones, Db (N
i) expression node N
iThe border of sensitive zones;
Step 23-C: will put set PB
iElement in (j Θ i) adds among the border intersection point collection SI_B (i), i.e. SI_B (i)=SI_B (i) ∪ PB
i(j Θ i);
Step 23-D: select neighbor node set Neighbor
iIn the another one neighbor node, repeating step 23-B, step 23-C are up to the neighbor node set Neighbor that disposes
iIn all elements.
In the present invention, the determination processing step for step 25 is:
Step 25-A: the point that obtains in step 22, step 23 and the step 24 is added ingress N
iIntersection point collection InSet (N
i) in, change step 25-B over to;
Described InSet (N
i)=SI_I (i) ∪ SI_B (i) ∪ SI_E (i);
Step 25-B: select intersection point set InSet (N
i) in any 1 p (x
Ir, y
Ir), calculate p (x
Ir, y
Ir) coverage PCov (p (x
Ir, y
Ir)), change step 25-C over to;
Step 25-C: if PCov is (p (x
Ir, y
Ir))＜K, then node N
iDo not have redundant qualification, treatment step finishes; Otherwise, change step 25-D over to;
Step 25-D: select intersection point set InSet (N
i) in other arbitrfary point p (x
Ir, y
Ir), repeating step 25-B and step 25-C are up to handling intersection point set InSet (N
i) in all elements;
Step 25-E: node N
iHave redundant qualification, treatment step finishes.
Arbitrary node N
iIntersection point set in any 1 p (x, coverage y) be this p (x, y) be capped except that arbitrary node N
iNode number outside itself.
Be without loss of generality, if (x y) is removed node N to this any 1 p
iOutside q node cover, then claim this p (x, coverage y) is q, note is made PCov (p (x, y))=q;
In emulation experiment of the present invention and Performance Evaluation schematic diagram, the simulated environment of employing is CoverageSimulator.In the rectangular target zone of 50m * 50m, the sensing radius of node is 10m, by the number that changes coverage request K (default coverage K) and dispose node to the EOER rule of the present invention assessment that experimentizes.All experimental results all are the mean value that obtains after the operation on 10 networks that generate at random.Compared following experiment parameter with CCP rule and Ottawa rule in the experiment:
1. because the blind spot number that rule causes:
Efficient accurate node dormancy mechanism at first should be able to guarantee all standing to the target area, blind spot promptly can not occur covering, therefore because the blind spot quantity that rule causes is to weigh the key that a redundant node is differentiated the rule quality.
2. operating state interstitial content:
Under the prerequisite of guarantee to the covering quality of target area, can reduce whole network power consumption with minimum live-vertex number, prolong network lifecycle, so the operating state interstitial content also is to weigh a redundant important indicator of differentiating the rule quality.
3. the average coverage of network:
Under the prerequisite of guarantee to the covering quality of target area, average coverage is more little, shows that redundant node is few more, and the power consumption of whole network is just low more, the network longer service life, and therefore, the average coverage of network also is commonly used to weigh the redundant quality of differentiating rule.
In Fig. 5 A, the redundant node that has contrasted under CCP rule, the EOER rule is differentiated the covering blind spot number that causes.This figure shows, when disposing interstitial content less than 50, no matter coverage request K is 1,2 still to be 3, and all more by the blind spot number that the CCP rule causes, coverage hole can reach 1% to 5% of target area, and this is difficult to tolerate for network monitor; Yet under the EOER rule, no matter coverage request K is 1,2 still to be 3, and the blind spot number that the EOER rule causes is 0.Particularly when disposing node more after a little while, many more by the erroneous judgement that the CCP rule causes, the blind spot number that causes is many more; And the EOER rule is when disposing interstitial content more after a little while, can not cause because the blind spot that the rule erroneous judgement causes occurs yet, this is to be mistaken for the situation that can enter dormancy because the EOER rule has been eliminated the node that should work that insufficient condition of CCP brings, and prove that the EOER rule is a complete reliable redundancy node differentiation rule.
In Fig. 5 B, tested coverage request K respectively and be 1 and at 2 o'clock, the working node number that CCP rule and EOER rule produce, and and the working node number that produces of Ottawa rule compare that (the Ottawa rule is not supported configurable coverage request, its purpose is to guarantee to strive eliminating all redundant nodes under the situation that the zone covers).This figure shows: 1) the EOER rule is lacked than the working node number that the Ottawa rule produces, and when disposing interstitial content above 50, be under 1 and 2 the situation in the coverage request, the working node number that the EOER rule calculates is all basicly stable, remain on respectively about 20 and 35, and the Ottawa rule is always with disposing that interstitial content increases and the live-vertex number that calculates increases, therefore under the situation that ensures covering quality, agreement of the present invention can calculate than Ottawa agreement node still less and finish covering connection task, more effective minimizing network power consumption prolongs network useful life; 2) the EOER rule increases 1% to 3% than the active node number of CCP rule calculating, this is because the CCP rule is the differentiation rule of an insufficient dormancy, this rule can will much not answered the node erroneous judgement (thereby causing more blind spot) of dormancy, and the EOER rule has been eliminated this erroneous judgement, especially when the deployment interstitial content was less than 100, this situation was more obvious.So whether EOER rule decision node should work or dormancy is more accurate, erroneous judgement can not occur.
In Fig. 5 C, contrasted the average coverage of network that produces under Ottawa rule, the EOER rule.This figure shows, be that the average coverage to network that utilization EOER rule obtains is 2 under 1 the situation as coverage request K, and the average coverage size that the Ottawa rule calculates is between 5 or 6.Usually, differentiate the approaching more request coverage of the average coverage of network that produces under the rule, show that the redundant node in the wireless sensor network of dispatching by this rule is few more, the power consumption of whole network is just low more, and network is just longer useful life.By this experiment as can be seen, the average coverage of EOER rule more near coverage request K, shows that EOER differentiates better effects if than the average coverage of Ottawa rule.
Claims (5)
1, a kind of wireless sensor network cover control method that adopts the multiplex intersection point coverage judgement is characterized in that: the arbitrary node N in the sensor network
iInitially all in running order, and regularly to neighbor node broadcasting message, and when receiving that neighbor node message or timer overflow, carry out different treatment steps and come Control Node work or dormancy, carry out the following step:
Step 100: arbitrary node N
iWhether receive one from its neighbor node N
IjWork message AM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 101; Be not "No" then to continue execution in step 100 if receive;
Described work message AM (ij, (x
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 101: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 102; Be not combined into "No" if be inconsistent, then execution in step 100;
Step 102: start and withdraw from timer T
IW, and execution in step 103;
The described timer T that withdraws from
IWThe time interval that is provided with is 3s～5min;
Step 103: judge and withdraw from timer T
IWWhether overflow, be "Yes" if overflow, then execution in step 105; Be not "No" if overflow, then execution in step 104;
Step 104: judge arbitrary node N
iWhether receive from neighbor node N
IjWithdraw from message WM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 101; If do not receive to be "No", then execution in step 103;
Described message WM (the ij, (x of withdrawing from
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 105: arbitrary node N
iBroadcast one and withdraw from message WM (i, (x
i, y
i)), and execution in step 106;
Described message WM (the i, (x of withdrawing from
i, y
i)) in i represent node N
iIdentification number, (x
i, y
i) expression node N
iCoordinate position in wireless sensor network;
Step 106: arbitrary node N
iEnter resting state, and start dormancy timer T
s
Described dormancy timer T
sThe time interval that is provided with is 3s～5min;
Step 107: judge dormancy timer T
sWhether overflow, be "Yes" if overflow, then execution in step 108; Be not "No" if overflow, then execution in step 107;
Step 108: start and intercept timer T
l, and execution in step 109;
The described timer T that intercepts
lThe time interval that is provided with is 3s～5min;
Step 109: judge and intercept timer T
lWhether overflow, be "Yes" if overflow, then execution in step 106; Be not "No" if overflow, then execution in step 110;
Step 110: judge arbitrary node N
iWhether receive from neighbor node N
IjWork message AM (ij, (x
Ij, y
Ij)) or add message JM (ij, (x
Ij, y
Ij)) or withdraw from message WM (ij, (x
Ij, y
Ij)), be "Yes" if receive one of them, then execution in step 111; If all do not receive to be "No", then execution in step 109;
Step 111: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 108; Be not combined into "No" if be inconsistent, then execution in step 112;
Step 112: start adding timer T
j, and execution in step 113;
Described adding timer T
jThe time interval that is provided with is 3s～5min;
Step 113: judge to add timer T
jWhether overflow, be "Yes" if overflow, then execution in step 116; Be not "No" if overflow, then execution in step 114;
Step 114: judge arbitrary node N
iWhether receive from neighbor node N
IjAdding message JM (ij, (x
Ij, y
Ij)), if receive and be "Yes", then execution in step 115; If do not receive to be "No", then execution in step 112;
Described adding message JM (ij, (x
Ij, y
Ij)) in ij represent neighbor node N
IjIdentification number, (x
Ij, y
Ij) expression neighbor node N
IjCoordinate position in wireless sensor network;
Step 115: arbitrary node N
iUtilize the EOER rule to judge whether oneself meets redundant qualification, be "Yes" if meet, then execution in step 106; Be not combined into "No" if be inconsistent, then execution in step 112;
Step 116: arbitrary node N
iBroadcast one and add message JM (i, (x
i, y
i)), and execution in step 117;
Described adding message JM (i, (x
i, y
i)) in i represent node N
iIdentification number, (x
i, y
i) expression node N
iCoordinate position in wireless sensor network;
Step 117: arbitrary node N
iIn running order, and periodic broadcasting work message AM (i, (x
i, y
i));
At this moment, arbitrary node N
iFinished a Coverage Control bout from operating state-resting state-operating state.
2, the wireless sensor network cover control method of employing multiplex intersection point coverage judgement according to claim 1 is characterized in that: the redundant differentiation of described employing multiplex intersection point coverage rule is carried out node N
iRedundant qualification differentiate and have the following steps:
Step 21: node N
iBroadcast beacon messages, and set up neighbor node by the beacon message of collecting adjacent node and gather Neighbor
i
Described beacon message is meant and includes node N
iSelf identification number, node N
iCoordinate position in wireless sensor network; Node N
iThe beacon message of broadcasting comprises work message AM (i, (x
i, y
i)), add message JM (i, (x
i, y
i)) and withdraw from message WM (i, (x
i, y
i));
Step 22: inner intersection point collection obtains
In the scope of monitored area, obtain node N
iThe inside intersection point S set I_I (i) of all neighbor nodes of perception intra-zone;
Step 23: border intersection point collection obtains
In the scope of monitored area, obtain node N
iThe border intersection point S set I_B (i) of all neighbor nodes of perception zone boundary;
Step 24: regional intersection point collection obtains
Obtain node N
iThe regional intersection point S set I_E (i) on the border of perception zone boundary and monitored area=and p (x, y) | p (x, y) ∈ Db (N
i) ∧ p (x, y) ∈ Nb
L * M; In the formula, p (x, y) any physical points on the expression monitored area, Db (N
i) expression node N
iThe sensitive zones border, Nb
L * MExpression monitored area N
L * MThe border;
Step 25: calculate the intersection point coverage and come predicate node N
iRedundant qualification
(x, y), (x is y) by node N to calculate p to each the intersection point p among inner intersection point S set I_I (i), border intersection point S set I_B (i) and the regional intersection point S set I_E (i)
iThe coverage PCov (p (x that covers of neighbor node, y)), if (p (x, y)) requires K, then node N more than or equal to coverage to the coverage PCov of each intersection point among inner intersection point S set I_I (i), border intersection point S set I_B (i) and the regional intersection point S set I_E (i)
iHave redundant qualification, on the contrary node N
iDo not have redundant qualification.
3, the wireless sensor network cover control method of employing multiplex intersection point coverage judgement according to claim 2 is characterized in that obtaining of inner intersection point S set I_I (i) has the following steps in the step 22:
Step 22-A: from neighbor node set Neighbor
iIn select arbitrarily a neighbor node N
Ij
Step 22-B: from neighbor node set Neighbor
iOne of middle selection removes neighbor node N
IjAnother neighbor node N in addition
Im
Step 22-C: according to N
IjAnd N
ImCome calculation level set PI
i(j Θ m)=and p (x, y) | p (x, y) ∈ Db (N
Ij) ∧ p (x, y) ∈ Db (N
Im) ∧ p (x, y) ∈ Di (N
i) ∧ p (x, y) }, in the formula, p (x, y) any physical points in the expression monitored area, Db (N
Ij) expression neighbor node N
IjThe sensitive zones border, Db (N
Im) expression neighbor node N
ImThe border of sensitive zones, Di (N
i) expression node N
iThe inside of sensitive zones;
Step 22-D: will put set PI
iElement in (j Θ m) adds among the inner intersection point S set I_I (i), i.e. SI_I (i)=SI_I (i) ∪ PI
i(j Θ m);
Step 22-E: repeating step 22-B is to step 22-D, up to handling neighbor node set Neighbor
iIn node N
Im
Step 22-F: select neighbor node set Neighbor
iIn the another one neighbor node, repeating step 22-B is to step 22-E, up to the neighbor node set Neighbor that disposes
iIn all elements.
4, the wireless sensor network cover control method of employing multiplex intersection point coverage judgement according to claim 2 is characterized in that obtaining of border intersection point collection SI_B (i) has the following steps in the step 23:
Step 23-A: from neighbor node set Neighbor
iIn select arbitrarily a neighbor node N
Ij
Step 23-B: according to N
IjCome calculation level set PB
i(j Θ i)=and p (x, y) | p (x, y) ∈ Db (N
Ij) ∧ p (x, y) ∈ Db (N
i), in the formula, p (x, y) any physical points in the expression monitored area, Db (N
Ij) expression neighbor node N
IjThe border of sensitive zones, Db (N
i) expression node N
iThe border of sensitive zones;
Step 23-C: will put set PB
iElement in (j Θ i) adds among the border intersection point collection SI_B (i), i.e. SI_B (i)=SI_B (i) ∪ PB
i(j Θ i);
Step 23-D: select neighbor node set Neighbor
iIn the another one neighbor node, repeating step 23-B, step 23-C are up to the neighbor node set Neighbor that disposes
iIn all elements.
5, the wireless sensor network cover control method of employing multiplex intersection point coverage judgement according to claim 2 is characterized in that the determination processing step of step 25 is:
Step 25-A: the point that obtains in step 22, step 23 and the step 24 is added ingress N
iIntersection point collection InSet (N
i) in, change step 25-B over to;
Described InSet (N
i)=SI_I (i) ∪ SI_B (i) ∪ SI_E (i);
Step 25-B: select intersection point set InSet (N
i) in any 1 p (x
Ir, y
Ir), calculate p (x
Ir, y
Ir) coverage PCov (p (x
Ir, y
Ir)), change step 25-C over to;
Step 25-C: if PCov is (p (x
Ir, y
Ir))＜K, then node N
iDo not have redundant qualification, treatment step finishes; Otherwise, change step 25-D over to;
Step 25-D: select intersection point set InSet (N
i) in other arbitrfary point p (x
Ir, y
Ir), repeating step 25-B and step 25-C are up to handling intersection point set InSet (N
i) in all elements;
Step 25-E: node N
iHave redundant qualification, treatment step finishes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101199214A CN101350831B (en) | 2008-09-10 | 2008-09-10 | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101199214A CN101350831B (en) | 2008-09-10 | 2008-09-10 | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101350831A true CN101350831A (en) | 2009-01-21 |
| CN101350831B CN101350831B (en) | 2011-04-06 |
Family
ID=40269405
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101199214A Expired - Fee Related CN101350831B (en) | 2008-09-10 | 2008-09-10 | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101350831B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101951615A (en) * | 2010-08-03 | 2011-01-19 | 北京航空航天大学 | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree |
| CN101730260B (en) * | 2009-11-06 | 2011-11-30 | 华中科技大学 | Media access control method based on gradient partition |
| CN102438299A (en) * | 2012-01-17 | 2012-05-02 | 电子科技大学 | Energy saving method and dormancy decision making system for wireless sensor network |
| CN102547907A (en) * | 2012-01-16 | 2012-07-04 | 上海金网通信技术发展有限公司 | Joint node network equipment used for mobile broadband multi-hop Ad Hoc network |
| CN103167519A (en) * | 2011-12-16 | 2013-06-19 | 江南大学 | High-efficiency and energy-saving visual sensor network target covering algorithm |
| CN104284453A (en) * | 2014-10-30 | 2015-01-14 | 扬州大学 | Networking method for wireless sensor network with few redundant links |
| CN105657774A (en) * | 2016-03-24 | 2016-06-08 | 无锡士康通讯技术有限公司 | Building method and system for self-adaptive core forwarding network in wireless self-organized network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100399772C (en) * | 2005-08-26 | 2008-07-02 | 电子科技大学 | Ad hot network subsequent multi-path route method based on load balance |
| CN100466857C (en) * | 2007-02-02 | 2009-03-04 | 南京邮电大学 | Network reprogramming method of wireless sensor network based on priority cluster |
| CN101241177B (en) * | 2008-03-11 | 2010-11-03 | 北京航空航天大学 | Wireless sensor network positioning system facing to three dimensional space |
-
2008
- 2008-09-10 CN CN2008101199214A patent/CN101350831B/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101730260B (en) * | 2009-11-06 | 2011-11-30 | 华中科技大学 | Media access control method based on gradient partition |
| CN101951615A (en) * | 2010-08-03 | 2011-01-19 | 北京航空航天大学 | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree |
| CN101951615B (en) * | 2010-08-03 | 2013-01-30 | 北京航空航天大学 | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree |
| CN103167519A (en) * | 2011-12-16 | 2013-06-19 | 江南大学 | High-efficiency and energy-saving visual sensor network target covering algorithm |
| CN102547907A (en) * | 2012-01-16 | 2012-07-04 | 上海金网通信技术发展有限公司 | Joint node network equipment used for mobile broadband multi-hop Ad Hoc network |
| CN102438299A (en) * | 2012-01-17 | 2012-05-02 | 电子科技大学 | Energy saving method and dormancy decision making system for wireless sensor network |
| CN102438299B (en) * | 2012-01-17 | 2014-08-13 | 电子科技大学 | Energy saving method and dormancy decision making system for wireless sensor network |
| CN104284453A (en) * | 2014-10-30 | 2015-01-14 | 扬州大学 | Networking method for wireless sensor network with few redundant links |
| CN104284453B (en) * | 2014-10-30 | 2018-10-23 | 扬州大学 | A kind of networking method of wireless sensor network of less redundant link |
| CN105657774A (en) * | 2016-03-24 | 2016-06-08 | 无锡士康通讯技术有限公司 | Building method and system for self-adaptive core forwarding network in wireless self-organized network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101350831B (en) | 2011-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101350831B (en) | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination | |
| Liu et al. | Approximate coverage in wireless sensor networks | |
| Wang et al. | A network lifetime enhancement method for sink relocation and its analysis in wireless sensor networks | |
| Gui et al. | Power conservation and quality of surveillance in target tracking sensor networks | |
| Han et al. | BRTCO: A novel boundary recognition and tracking algorithm for continuous objects in wireless sensor networks | |
| Jaggi et al. | Energy-efficient connected coverage in wireless sensor networks | |
| CN112486053B (en) | Industrial park environment monitoring and management system based on block chain | |
| CN104113892B (en) | Management method, system and the gateway of sensor node in a kind of sensor network | |
| Abdulzahra et al. | Optimizing energy consumption in WSN-based IoT using unequal clustering and sleep scheduling methods | |
| Boulanouar et al. | Energy-aware object tracking algorithm using heterogeneous wireless sensor networks | |
| CN104080154B (en) | Industrial wireless sensor network node dormancy method based on cellular automaton | |
| Yu et al. | CWSC: Connected k-coverage working sets construction algorithm in wireless sensor networks | |
| Jamali et al. | Coverage aware scheduling in wireless sensor networks: An optimal placement approach | |
| Sun et al. | Integrated connectivity and coverage techniques for wireless sensor networks | |
| Liu et al. | Diffusion distance-based predictive tracking for continuous objects in industrial wireless sensor networks | |
| Lei et al. | The research of coverage problems in wireless sensor network | |
| Jia et al. | Wireless sensor network monitoring algorithm for partial discharge in smart grid | |
| Jones et al. | Tasking distributed sensor networks | |
| Habib et al. | A coverage restoration scheme for wireless sensor networks within simulated annealing | |
| CN110087293B (en) | Low-energy-consumption distributed event detection wireless sensor network construction method | |
| Wang et al. | Coverage based irregular sensing model in wireless sensor networks | |
| Toumi et al. | Dynamic Clustering Algorithm for Tracking Target with High and Variable Celerity | |
| Pazand et al. | Minimum dominating sets for solving the coverage problem in wireless sensor networks | |
| Bari | Relay nodes in wireless sensor networks: A survey | |
| Jaggi et al. | Utility maximizing node activation policies in networks of partially rechargeable sensors |
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: 20110406 Termination date: 20140910 |
|
| EXPY | Termination of patent right or utility model |