# Smart Power Management and Delay Reduction for Target Tracking in Wireless Sensor Networks

Authors: Juan Feng; Baowang Lian; Hongwei Zhao
Journal: Journal of Electrical and Computer Engineering
 (2014)

---

## Abstract

Energy efficiency and data transmission delay are critical issues for mobile target tracking wireless sensor networks, in which abundant sensor nodes are deployed to collect the target information from the sensing field. At present, many existing works have been concentrated on extending network lifetime, while less emphasis was placed on both transmission delay reduction and the adaptive sleep of sensor nodes considering the application constraints. In this paper, we propose a smart power management and delay reduction approach for target tracking based on a grid network structure, where sensor nodes adjust their sleep intervals according to the distance between the node and the moving target. Sensor nodes can distributedly decide their sleeping time using the information from their neighbors. Furthermore, we propose a real-time chain to relay the sensed data for transmission delay reduction. The proposed approach allows sensor nodes that are far away from the target to sleep more and make the target information forward to the sink in time. Experimental results verify that, in contrast to adaptive coordinate and local power management protocols, the proposed approach achieves a significant energy saving while maintaining a short transmission delay.


---

## Body

## 1. Introduction

Wireless sensor networks (WSNs) have emerged as an attractive technology which can gather information by the collective effort of numerous small sizes, low-cost, and wirelessly connected sensor nodes. Due to many attractive characteristics of sensor nodes, WSNs have very extensive applications. One of the important applications is target tracking, such as vehicle tracking and migration behaviour of animals tracking. In such application scenarios, the sensor nodes collectively monitor the path of moving targets in the sensing area. To inform the sink as quickly as possible when the target occurs, the data transmission delay should be short. Since enormous sensor nodes are always deployed in unattended environment, it is very difficult to replace their battery after the deployment. Therefore, balancing the transmission delay and energy consumption to meet the requirement of the application is the most critical issue.There are some proposals that also consider these issues, such as [1–4], which propose some power management (PM) approaches. The main idea of PM is dynamically getting nodes to sleep to reduce energy consumption since the power consumption in sleep state is usually much smaller than that in the active or idle mode. Thus, the sensor nodes may be put into a sleep mode as long as possible in order to conserve energy. In order to devise a more efficient PM mechanism, the application constraints should be considered. For instance, in target tracking application, a target moves randomly. We do not know the next position of the target. If we blindly turn the sensor node off during each idling time, we will miss some events. In detail, the existing works are not efficient for target tracking because the sleep time is not adjusted in accordance with the position of the target. Most of the time the nodes consume more energy in active or idle mode, but they do not detect any target.Moreover, the data transmission delay, which is defined as the time between the moment a source sends a packet and the moment a sink receives the packet, is also a critical issue to be considered in target tracking WSNs. If all the sensor nodes adopt an appropriate sleep time according to the position of the target, each node has the asynchronous wake-up instant. When a node wants to send data, it has to wait until the relay nodes wake up from the sleep mode so that there will be a long data transmission delay. In [5, 6], the authors adopt chain-based network architecture to transmit sensed data. It is an efficient way for data gathering and achieves high energy efficiency since every node just communicates with its closest neighbours. However, it is not fit for the target tracking because it involves all the sensor nodes in the chain for the data gathering so that long data transmission delay is brought, whereas just the nodes around the target need to report their sensed data in the target tracking application. Lots of unnecessary nodes should be moved to reduce the transmission delay.Based on the these concepts, we propose a smart power management and delay reduction approach (SPM/DR) that considers the application constraints to exploit sleep and idle states. Our main goal is to choose an optimal sleep time for each node so as to make the system adaptive and energy-efficient without degrading the system performance. This paper is based on a grid network structure where a node is selected as grid head (GH) in each grid and we assumed that a sleep node cannot be communicated with or woken up so that the sleep duration has to be determined based on all the available information when the sensor node goes to sleep. We proposed a real-time chain for transmitting sensed data. In a time instant, small parts of GHs in the chain are kept active to relay data and the other GHs are still in sleep to save energy. The information of the target can be transmitted through the chain without delay. In tracking course, only GHs instead of all the sensor nodes send the PM information to their neighbouring GHs, which improves the distributed and coordinated approaches in the existing work. Then each GH weighs the received information according to the distance between itself and its neighbor GH to calculate the sleep time for its grid members (GMs). Therefore, this way decreases the network traffic of PM information transmission and has the better balance between the transmission delay and energy efficiency.Moreover, in [7], hierarchically coordinated PM is adopted which divides the network into hierarchical layers. Just one layer is in tracking state in one time instance and the others are in sleep state to save energy. This paper improves the approach proposed in [7] from the following aspects: (1) this paper proposed a real-time chain for transmitting sensed data in order to have the better balance between the transmission delay and energy efficiency; (2) for the sleep strategy, this paper adopts the distributed approach instead in which the central sink controls the type of hierarchical layer and sleep strategy in each hierarchical layer, in which the information of moving target needs to be transmitted to the sink in time in order to make decision. Nevertheless, in SPM/DR, each GH decides its sleep interval by the information from its neighbour GHs; (3) SPM/DR approach improves the sleep strategy of GHs by allowing GHs to have a fixed sleep interval with local sleep strategy.The rest of this paper is organized as follows. Section2 reviews the related work. Section 3 specifies the energy consumption and management model. In Section 4, SPM/DR approach is described in detail. Then, Section 5 shows the experimental results of SPM/DR compared with the state-of-the-art approaches. Finally, we conclude the paper in Section 6.


## 2. Related Works

The lifetime of a sensor network depends highly on the power consumption performed at each sensor node. Recently, many target tracking and sensed data gathering approaches have been proposed for WSNs to achieve satisfactory network lifetime and data transmission delay. In [8, 9], the authors design energy efficient communication process at hardware and system levels. In [1, 10], dynamic power management schemes have been proposed to reduce the power consumption.In [2, 11], the authors introduce some local PM policies, in which nodes reduce the power consumption by selectively shutting down idle components. Each node keeps a timer recording how long no event has been detected and goes to sleep after this timer times out. After a fixed sleep time, the node returns to active state. The authors in [3] use an adaptive learning tree scheme such that the quality of the shutdown control algorithm depends on the knowledge of the user behaviors. However, these policies are intended for general networks. They do not consider the characteristics of target tracking and use the application constraints in a DPM scheme.For target tracking in WSN, the authors in [8] propose an adaptive coordinate PM policy, which extends the local PM decision to include the timeout values of the neighbours in the network. Once a timeout occurs within a node, it piggybacks a “timeout” message onto its other regularly scheduled messages for wireless broadcast. The receiving nodes strip this timeout message from the packet and forward the packet to subsequent nodes if necessary. In this way, nodes will be aware of the timeout status of their neighbours and can enter into low-power mode if it and each of its neighbours are simultaneously in a timeout state. In [9], a voting PM policy is proposed, in which each node broadcasts periodically a summary of target detection information. Each node collects this summary from its neighbors. If enough of the neighbors vote that there is no event being detected, then the node can enter the low power state. However, due to the dense nodes in WSN, the nodes in an adjacent area have the similar detecting information. If every node broadcasts its detecting information to its neighbours, it will result in more transmission energy consumption and information redundancy. In addition, when nodes make a PM decision, they do not consider different effect of each neighbor. Because of random network distribution, each neighbor has different distance to the current node so that each neighbor has different effect on the current node. In [10], the authors dynamically change the sleep schedule of sensor nodes considering how many hops from the node to the target. However, when a node far from the sink detects a target, it has to wait until the nodes which are far from the target and close to the sink wake up from sleep mode to transmit data. Thus, there will be a long transmission delay for sensed data.Moreover, in [12], the authors switch off the idle nodes based on the prediction algorithms which predict the next position of the target by the current data from the sensor node to track the target movement. Nevertheless, the prediction algorithms always have high computation complexity and communication energy cost and need to be implemented on the sink after the sink receives all the sensed data.


## 3. Energy Model

The energy models of data transmitting are similar to that in [5], which is described in (1). E
T
x
(
k
,
d
) and E
R
x
(
k
) represent energy consumption of transmitting and receiving k bits data over a distance d
(1)
E
T
x
(
k
,
d
)
=
(
E
T
x
-elec
+
ε
amp
*
d
α
)
*
k
,
E
R
x
(
k
)
=
E
R
x
-elec
*
k
,
where E
T
x
-elec and E
R
x
-elec are distance independent terms that take into account overheads of transmitter and receiver electronics. ε
amp
[
Joule
/
(
bit
·
m
α
)
] is a constant which represents the energy needed to transmit one bit to achieve an acceptable signal-to-noise ratio over a distance d, and α is path loss exponent (
2
≤
α
≤
5
) which depends on the channel characteristics. According to [5] we assume that E
T
x
-elec
=
E
R
x
-elec
=
E
elec.Sensor node has several sleep states because the components of the nodes can be turn on or shut off. In target tracking, if a target will appear within the sensing area of a node, the node should be awake in advance to sense the target and transmit data. For the other nodes, they remain in the sleep states
k most of the time and switch to active state s
0 at specified time slots to check if there are sensing or relay tasks in the next time instant. Therefore, if sensor nodes cannot change their states in time, the energy will be wasted or the tracking performance is reduced. Now, the problem is how to formulate a policy for sensor node to transfer between these sleep states to maximize the lifetime of the network.Each sleep states
k has power consumption P
k. The transition times to it from active state and back are denoted by τ
d
,
k and τ
u
,
k, respectively [1]. We define the node sleep states as i
>
j, P
j
>
P
i, τ
d
,
i
>
τ
d
,
j, and τ
u
,
i
>
τ
u
,
j. From that we can see deeper sleep state has less power consumption but incurs a longer latency and a higher energy to awaken. We assume an event is detected by N
i at some time. N
i finishes processing the event at time t
1 and predicts that the next event occurs at time t
2
=
t
1
+
t
i
+
τ
u
,
k. At time t
1, N
i decides if it transfers to sleep. So a sleep time threshold T
th
,
k is utilized to avoid losing event
(2)
T
th
,
k
=
τ
d
,
k
+
τ
u
,
k
.If(
t
2
-
t
1
)
>
T
th
,
k, N
i can go to sleep state s
k at time t
1 and wake up at t
2. Otherwise, when (
t
2
-
t
1
)
⩽
T
th
,
k, N
i should not go to the sleep state. So the saving energy from a state transition can be calculated as follows:
(3)
E
save
,
k
=
P
0
(
t
i
+
τ
u
,
k
)
-
P
0
+
P
k
2
(
τ
d
,
k
+
τ
u
,
k
)
-
P
k
(
t
i
-
τ
d
,
k
)
=
P
0
-
P
k
2
(
2
t
i
-
τ
d
,
k
+
τ
u
,
k
)
.
The energy saving makes sense when E
save
,
k
>
E
c, where E
c is the additional energy consumption for the sleep states transition. So we can find out the threshold,
(4)
T
th
,
k
=
1
2
(
τ
d
,
k
-
τ
u
,
k
)
+
E
c
P
0
-
P
k
.
Then, it is clear that the node should get into a sleep state only when its idle period will be long enough. In this paper, the nodes can estimate their idle period more accurately by information and weights from its neighbours.


## 4. Smart Power Management and Delay Reduction

Our idea is to exploit the long intervals when there is no target in sensing regions and offer the more sleep time to sensor nodes without degrading the system performance. We divide the PM approach into two subapproaches. First, only fringe nodes are kept alert while interior nodes have more sleep time in surveillance stage. Second, each GH adjusts the sleep time for its GMs in light of the information from its neighbour GHs in tracking stage, and the sensed data is sent to the sink through a real-time chain in order to reduce the transmission delay.


### 4.1. Network Initialization

We consider a static WSN which is composed of one sink and some randomly distributed sensor nodesN
i, i
∈
[
1
,
P
] in a two-dimensional sensing field, where P is the number of the deployed nodes. The sink has an infinite power supply, and it gathers the sensed information from sensor nodes. The distribution of sensor nodes is mutually independent with density λ
=
P
/
S
sensing, where S
sensing is the area of the sensing field. We assume each node is aware of its location after deployment (e.g., using some localization techniques). Let X
i
(
x
i
,
y
i
), 1
≤
i
≤
P be the location of node N
i.Furthermore, the whole sensing field is divided into small equal size grids and in each grid one node which has the most energy is selected as the GH. In the definition of virtual grid, each pair of nodes in neighbour and diagonal grids can communicate directly with each other [1, 11]. Assume that the transmission range of sensor node is R
t. We size each grid as a α
×
α square. In order to meet the definition of virtual grid, in any two adjacent grids, the distance between two possible farthest nodes must not be larger than R
t. Therefore, we get
(5)
(
2
α
)
2
+
(
2
α
)
2
≤
R
t
2
or
α
≤
R
t
2
2
.Initially, all the sensor nodes are in idle state and they have the same initial energy. One node in each grid is selected as the GH randomly by broadcasting an announcement (carrying its position and grid ID) after waiting for a random time periodR
(
T
ran
), which is a discrete random variable with the uniform distribution in [
0
,
T
ran
]. The node who first broadcasts its GH announcement in one grid will be the GH. After the process, there is one GH in each grid. In addition, each grid has a grid ID, and the nodes in one grid have the same grid ID. A sensor node can calculate its grid ID (
u
,
v
) from its location X
i
(
x
i
,
y
i
) as
(6)
u
=
[
x
i
-
x
0
α
]
,
v
=
[
y
i
-
y
0
α
]
,
where [
] is a symbol which stands for the integer part of the number in it. (
x
0
,
y
0
) is the location of the network origin, which is a system parameter set in the network initialization stage. For simplicity, we assume that u and v are positive. Through the initial process, each node can learn the information about other nodes in the same grid and maintains the information, for example, the location, and so on.


### 4.2. A Real-Time Chain for Transmitting Sensed Data

For target tracking application, another important factor to be considered is the detecting delay. Clearly, when any sensor node detects a target, it needs to report to the sink through multihop routing in time. However, increased energy savings generally come with a penalty of increased detecting delay. To resolve this problem, we consider an important characteristic of the tracking scenario in which once a target is detected, the detecting sensor nodes need to continuously send the move information of the target to the sink. As a result, each detecting node has to calculate the routing for data transmission per round, and it has to wait for the next routing node to be in active mode in order to transmit data. That involves an amount of calculations and long delay.We propose a real-time chain for transmitting the sensed data. When a target appears, the node who detects the target first will broadcast a message “found_target” to other nodes including its GH in SS. Then the GH broadcasts the “found_target” message to its neighbour GHs to inform them to get ready for detection. The receiving GHs forward the message to the subsequent GHs until all the GHs receive the message. Then a real-time chain from the first detected node to the sink is formed using any routing algorithm (such as some routing protocol in [13]) as Figure 1 shows. The GHs in this transmission chain should keep in active mode to guarantee the short delay for sensed data transmission. Otherwise, the other GHs keep synchronization and use the local PM policy, which keep a timer recording how long no event has been detected and goes to sleep after this timer times out. After a fixed sleep time, they return to active state. If they detect a target, they keep active at the next time instant. Thus, only the nodes around the target and GHs in the real-time chain should keep active and other nodes can sleep adaptively to save energy. Moreover, the sink can estimate the target position by received data. If the moving distance of the target is larger than a threshold T
d, the sink will inform the GHs in the real-time chain and the adjacent GHs to reform a chain. In this way, the sensed data can be sent to the sink with minimum delay. In addition, a lot of energy is saved because computational costs and the changing frequency between sleep and active modes of routing nodes are reduced.Figure 1
A real-time chain for transmitting sensed data.


### 4.3. Sleep Policy in Tracking Stage

For tracking stage, the position of the moving target in this time instant has strong correlation with that in next time instant. Therefore, to more effectively make PM decisions and estimate if the target will be in itself sensing area in the next instant, each node can use the results of the motion detection from its neighbors in a coordinate way. As Figure2 (on the left side) shows, each node broadcast its detected information to its neighbors periodically. When the current node N
c decides if it should go to sleep state, it will use the detected information from its neighbors. However, due to the dense nodes in WSN, the nodes in an adjacent area have the similar detected information. If every node broadcasts its detected information periodically, it will result in more transmission energy consumption and information redundancy. In our approach (on the right side in Figure 2), only the GH who detects a target or receives the target information from its GMs broadcasts the detected information to their neighboring GHs. Each GH can decide if the sleep time of its GMs needs to be changed based on the information it received. If it needs to be changed, the GH recalculates the sleep time for its GMs and informs them in the next active instant, which reduce the energy consumption of the detected information transmission.Figure 2
The transmission of the target detecting information.


#### 4.3.1. One Hop Neighbors Coordination

One hop neighbors coordination means when a GH makes PM decisions, it just considers the detected information from its immediate neighbor GHs. The detected information broadcasted by a GH includes the location of the sender and the distance between the sender and the target. It can be estimated by the strength of the sensing signal. A GH calculates the sleep time for its GMs in three different cases.The first case is that the GH neither detects any target nor receives any target information from others during an active time period. The maximum sleep time is decided by the following equation:(7)
max
⁡
t
sleep
tk
=
(
(
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
)
η
,
where α is the side length of the grid and η is the success ratio of detecting required by application.The second case is that the target is detected by the GH or its GMs. The GH keeps active until the target moves out of sensing area of its grid, and it decides the sleep time of its GMst
sleep
tk
=
0. Then the GH broadcasts a detected information message to its neighbour GHs so that they can prepare to track the target at the next moment.The third case is that the GH receives the target information from its neighbors. Thus, the GH can calculate the maximum sleep time for its GMs by the following equation:(8)
max
⁡
t
sleep
tk
=
(
(
min
⁡
{
d
GMs
,
d
e
t
e
c
t
N
o
d
e
}
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
)
η
,
where min
⁡
{
d
GMs
,
d
e
t
e
c
t
N
o
d
e
} is the minimum distance between the GMs of the current grid and the node who detects the target. Similarly, to overlap the active parts of GMs and their GH so that GMs and their GH communicate with each other, we get
(9)
t
sleep
tk
′
=
[
max
⁡
t
sleep
tk
T
GH
]
T
GH
-
τ
u
,
sp
,
where T
GH is the period of GHs. The sleep time of GM is set to the integer multiple of T
GH to overlap the active parts of GMs and their GH so that the GMs can send their sensing data to their GHs or receive the PM information from their GHs to adjust their sleep time accordingly. When t
sleep
tk
′
>
T
t
h
1 and t
sleep
tk
′
>
T
t
h
2  hold, the sleep time of the GMs in tracking stage t
sleep
tk can be set as min
⁡
{
t
sleep
tk
′
,
t
sleep
sur
}, in which t
sleep
sur is the sleep time of the GMs in the surveillance stage, otherwise t
sleep
tk
=
0. When there is change on the sleep time value of GMs, the GH informs its GMs about the updated sleep time. The GMs receive a new sleep time from their GH and adjust the current sleep mode. The sleep state transition of the GM is shown in Figure 3.The sleep state transition of the GM.
(a)
No target occurs
(b)
GM receives a new sleep time from its GH
(c)
GM detects a targetIn this way, sensor nodes will get the target movement information from the GHs in neighboring area and accurately estimate the sleep state and time interval. In addition, transmitting the target information only among GHs instead of that among all the sensor nodes can reduce the communication cost and information redundancy.


#### 4.3.2. Multihop Policy Considerations

In our aforementioned policies, when GHs make the PM decisions, they consider the detected information from the immediate neighbor GHs. We can also increase the coordination to the neighbor GHs located multihop away from the current GH. This requires a balance between the energy consumption of the detected information transmitted to multihops and the energy saving of GMs that can sleep more. We assume that the energy consumption of detected information sending and receiving isE
br and E
re, respectively. When GHs consider the detected information only from the immediate neighbor GHs, the energy consumption of the detected information transmission is
(10)
E
cons
h
=
1
=
E
br
+
8
E
re
,
when the detected information is transmitted to the neighbors which are h
=
H hops far away from the current node
(11)
E
cons
h
>
1
=
E
cons
h
=
1
+
∑
h
=
2
H
(
8
h
-
8
)
E
br
+
∑
h
=
2
H
8
h
E
re
.
When h
=
1, the energy saving by GMs sleeping is
(12)
E
save
h
=
1
=
[
(
P
i
-
P
s
)
t
sleep
t
k
+
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
i
-
P
t
r
2
)
τ
u
,
sp
]
×
N
CMs
,
where N
CMs is the number of the GMs in the current grid. Similar to h
=
1, when h
=
H, the sleep time of GMs is
(13)
t
sleep
m
l
-
h
′
=
[
(
H
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
η
T
GH
]
T
GH
-
τ
u
,
sp
,
and when h
=
H, the energy saving by GMs sleeping is
(14)
E
save
h
>
1
=
[
(
P
i
-
P
s
)
t
sleep
m
l
-
h
′
+
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
i
-
P
t
r
2
)
τ
u
,
sp
]
×
N
CMs
;
therefore, when h
=
H, we can obtain the energy saving as follows:
(15)
E
save
h
>
1
-
E
cons
h
>
1
=
(
P
i
-
P
s
)
N
CMs
[
(
H
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
η
T
GH
]
T
GH
-
4
H
2
(
E
br
+
E
re
)
-
4
H
(
E
re
-
E
br
)
+
C
,
where C is a constant which is not related to H,
(16)
C
=
N
CMs
[
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
s
-
P
t
r
2
)
τ
u
,
sp
]
-
E
br
.
To optimize the energy saving, the value of E
save
h
>
1
-
E
cons
h
>
1 needs to be the maximum. Since P
i
-
P
s
>
0, N
CMs
>
0 and τ
d
,
sp
,
τ
u
,
sp
,
T
GH, and η are all the constants. Thus, when the value of y in (17) is maximized, we can get the maximum value of E
save
h
>
1
-
E
cons
h
>
1:
(17)
y
=
(
P
i
-
P
s
)
N
CMs
α
v
max
⁡
H
-
4
H
2
(
E
br
+
E
re
)
-
4
H
(
E
re
-
E
br
)
+
C
.
To find the maximum y, H is differentiated as
(18)
∂
y
∂
H
=
(
P
i
-
P
s
)
N
CMs
α
v
max
⁡
-
8
H
(
E
br
+
E
re
)
-
4
(
E
re
-
E
br
)
;
thus, when ∂
y
/
∂
H
=
0, we have the maximum y and get H as follows:
(19)
H
=
(
P
i
-
P
s
)
N
CMs
(
α
/
v
max
⁡
)
+
4
(
E
br
-
E
re
)
8
(
E
br
+
E
re
)
;
therefore, the maximum saving energy is
(20)
E
s
=
max
⁡
{
(
E
save
h
=
1
-
E
cons
h
=
1
)
,
(
E
save
h
>
1
-
E
cons
h
>
1
)
}
.
We can select appropriate H to obtain the optimal energy saving policy according to the network parameters. When t
sleep
m
l
-
h
′
≥
T
t
h
1 and t
sleep
m
l
-
h
′
>
T
t
h
2  hold, the sleep time of the GMs in tracking stage with multihop GHs coordination can be set as min{
t
sleep
m
l
-
h
′
,
t
sleep
sur
}.


### 4.4. Grid Maintenance

To avoid energy overfull consuming on GH, if the energy of any GH is lower than a thresholdT
e, the GH will broadcast a message “req-replace” to its GMs. Then the nodes in the same grid reselect the GH. A node with more remaining energy is expected to become a new GH.The pseudo code of the GH selection is shown in Algorithm1. When GM receives “req-replace” message, it waits a random time to broadcast “finish_election” message to compete the GH election. For each GM the residual energy E
residual
i is converted to a waiting time T
i (line 4). More residual energy leads to a shorter T
i. Therefore, the GM with the most E
residual
i waits for the shortest time before sending “finish_election” message to others. Therefore, it can be selected as GH (line 8 and 12). The other nodes stop waiting and give up the GH election as soon as they receive the message. T
i is calculated by the following equation:
(21)
T
i
=
T
min
⁡
+
(
T
max
⁡
-
T
min
⁡
)
(
1
-
E
residual
i
E
initial
i
)
+
R
(
T
ran
)
,
where T
min
⁡ and T
max
⁡ are two design parameters, which are used to control the waiting time in a reasonable range. E
residual
i and E
initial
i are the residual and initial energy of node, respectively. E
residual
i is divided by E
initial
i in order to avoid the case that a node waits too much time when its residual energy becomes very low. Two nodes might have the same residual energy and communication costs and therefore have the same T
i. To avoid this a random time R
(
T
ran
) is added. R
(
T
ran
) is a discrete random variable with the uniform distribution in [
0
,
T
ran
], which is an order of magnitude smaller than T
max
⁡.Algorithm 1:Selecting GH in one grid.
(1)   while (after initiating or received “req-replace”)
(2)  do
(3)  node N
i set a timer
(4)
T
i
← CalculateWaitTime (E
residual
i)
(5)  Wait (T
i)
(6)  if wait time expired
(7)      Broadcast (“finish_election”)
(8)      select N
i as GH
(9)   end if
(10)  if received (“finish_election” from N
j)
(11)     cancel wait ( )
(12)     select N
j as GH
(13)
end if
(14)
end if
(15) end whileIf GH election failed, maybe due to the loss of the broadcast messages, the old GH will continue its role and broadcast the reelection request periodically. For reliability purpose, when a GM fails to send data to its GH for several times (e.g., a GH dies suddenly), it will send a GH reelection request to the GMs.


## 4.1. Network Initialization

We consider a static WSN which is composed of one sink and some randomly distributed sensor nodesN
i, i
∈
[
1
,
P
] in a two-dimensional sensing field, where P is the number of the deployed nodes. The sink has an infinite power supply, and it gathers the sensed information from sensor nodes. The distribution of sensor nodes is mutually independent with density λ
=
P
/
S
sensing, where S
sensing is the area of the sensing field. We assume each node is aware of its location after deployment (e.g., using some localization techniques). Let X
i
(
x
i
,
y
i
), 1
≤
i
≤
P be the location of node N
i.Furthermore, the whole sensing field is divided into small equal size grids and in each grid one node which has the most energy is selected as the GH. In the definition of virtual grid, each pair of nodes in neighbour and diagonal grids can communicate directly with each other [1, 11]. Assume that the transmission range of sensor node is R
t. We size each grid as a α
×
α square. In order to meet the definition of virtual grid, in any two adjacent grids, the distance between two possible farthest nodes must not be larger than R
t. Therefore, we get
(5)
(
2
α
)
2
+
(
2
α
)
2
≤
R
t
2
or
α
≤
R
t
2
2
.Initially, all the sensor nodes are in idle state and they have the same initial energy. One node in each grid is selected as the GH randomly by broadcasting an announcement (carrying its position and grid ID) after waiting for a random time periodR
(
T
ran
), which is a discrete random variable with the uniform distribution in [
0
,
T
ran
]. The node who first broadcasts its GH announcement in one grid will be the GH. After the process, there is one GH in each grid. In addition, each grid has a grid ID, and the nodes in one grid have the same grid ID. A sensor node can calculate its grid ID (
u
,
v
) from its location X
i
(
x
i
,
y
i
) as
(6)
u
=
[
x
i
-
x
0
α
]
,
v
=
[
y
i
-
y
0
α
]
,
where [
] is a symbol which stands for the integer part of the number in it. (
x
0
,
y
0
) is the location of the network origin, which is a system parameter set in the network initialization stage. For simplicity, we assume that u and v are positive. Through the initial process, each node can learn the information about other nodes in the same grid and maintains the information, for example, the location, and so on.


## 4.2. A Real-Time Chain for Transmitting Sensed Data

For target tracking application, another important factor to be considered is the detecting delay. Clearly, when any sensor node detects a target, it needs to report to the sink through multihop routing in time. However, increased energy savings generally come with a penalty of increased detecting delay. To resolve this problem, we consider an important characteristic of the tracking scenario in which once a target is detected, the detecting sensor nodes need to continuously send the move information of the target to the sink. As a result, each detecting node has to calculate the routing for data transmission per round, and it has to wait for the next routing node to be in active mode in order to transmit data. That involves an amount of calculations and long delay.We propose a real-time chain for transmitting the sensed data. When a target appears, the node who detects the target first will broadcast a message “found_target” to other nodes including its GH in SS. Then the GH broadcasts the “found_target” message to its neighbour GHs to inform them to get ready for detection. The receiving GHs forward the message to the subsequent GHs until all the GHs receive the message. Then a real-time chain from the first detected node to the sink is formed using any routing algorithm (such as some routing protocol in [13]) as Figure 1 shows. The GHs in this transmission chain should keep in active mode to guarantee the short delay for sensed data transmission. Otherwise, the other GHs keep synchronization and use the local PM policy, which keep a timer recording how long no event has been detected and goes to sleep after this timer times out. After a fixed sleep time, they return to active state. If they detect a target, they keep active at the next time instant. Thus, only the nodes around the target and GHs in the real-time chain should keep active and other nodes can sleep adaptively to save energy. Moreover, the sink can estimate the target position by received data. If the moving distance of the target is larger than a threshold T
d, the sink will inform the GHs in the real-time chain and the adjacent GHs to reform a chain. In this way, the sensed data can be sent to the sink with minimum delay. In addition, a lot of energy is saved because computational costs and the changing frequency between sleep and active modes of routing nodes are reduced.Figure 1
A real-time chain for transmitting sensed data.


## 4.3. Sleep Policy in Tracking Stage

For tracking stage, the position of the moving target in this time instant has strong correlation with that in next time instant. Therefore, to more effectively make PM decisions and estimate if the target will be in itself sensing area in the next instant, each node can use the results of the motion detection from its neighbors in a coordinate way. As Figure2 (on the left side) shows, each node broadcast its detected information to its neighbors periodically. When the current node N
c decides if it should go to sleep state, it will use the detected information from its neighbors. However, due to the dense nodes in WSN, the nodes in an adjacent area have the similar detected information. If every node broadcasts its detected information periodically, it will result in more transmission energy consumption and information redundancy. In our approach (on the right side in Figure 2), only the GH who detects a target or receives the target information from its GMs broadcasts the detected information to their neighboring GHs. Each GH can decide if the sleep time of its GMs needs to be changed based on the information it received. If it needs to be changed, the GH recalculates the sleep time for its GMs and informs them in the next active instant, which reduce the energy consumption of the detected information transmission.Figure 2
The transmission of the target detecting information.


### 4.3.1. One Hop Neighbors Coordination

One hop neighbors coordination means when a GH makes PM decisions, it just considers the detected information from its immediate neighbor GHs. The detected information broadcasted by a GH includes the location of the sender and the distance between the sender and the target. It can be estimated by the strength of the sensing signal. A GH calculates the sleep time for its GMs in three different cases.The first case is that the GH neither detects any target nor receives any target information from others during an active time period. The maximum sleep time is decided by the following equation:(7)
max
⁡
t
sleep
tk
=
(
(
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
)
η
,
where α is the side length of the grid and η is the success ratio of detecting required by application.The second case is that the target is detected by the GH or its GMs. The GH keeps active until the target moves out of sensing area of its grid, and it decides the sleep time of its GMst
sleep
tk
=
0. Then the GH broadcasts a detected information message to its neighbour GHs so that they can prepare to track the target at the next moment.The third case is that the GH receives the target information from its neighbors. Thus, the GH can calculate the maximum sleep time for its GMs by the following equation:(8)
max
⁡
t
sleep
tk
=
(
(
min
⁡
{
d
GMs
,
d
e
t
e
c
t
N
o
d
e
}
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
)
η
,
where min
⁡
{
d
GMs
,
d
e
t
e
c
t
N
o
d
e
} is the minimum distance between the GMs of the current grid and the node who detects the target. Similarly, to overlap the active parts of GMs and their GH so that GMs and their GH communicate with each other, we get
(9)
t
sleep
tk
′
=
[
max
⁡
t
sleep
tk
T
GH
]
T
GH
-
τ
u
,
sp
,
where T
GH is the period of GHs. The sleep time of GM is set to the integer multiple of T
GH to overlap the active parts of GMs and their GH so that the GMs can send their sensing data to their GHs or receive the PM information from their GHs to adjust their sleep time accordingly. When t
sleep
tk
′
>
T
t
h
1 and t
sleep
tk
′
>
T
t
h
2  hold, the sleep time of the GMs in tracking stage t
sleep
tk can be set as min
⁡
{
t
sleep
tk
′
,
t
sleep
sur
}, in which t
sleep
sur is the sleep time of the GMs in the surveillance stage, otherwise t
sleep
tk
=
0. When there is change on the sleep time value of GMs, the GH informs its GMs about the updated sleep time. The GMs receive a new sleep time from their GH and adjust the current sleep mode. The sleep state transition of the GM is shown in Figure 3.The sleep state transition of the GM.
(a)
No target occurs
(b)
GM receives a new sleep time from its GH
(c)
GM detects a targetIn this way, sensor nodes will get the target movement information from the GHs in neighboring area and accurately estimate the sleep state and time interval. In addition, transmitting the target information only among GHs instead of that among all the sensor nodes can reduce the communication cost and information redundancy.


### 4.3.2. Multihop Policy Considerations

In our aforementioned policies, when GHs make the PM decisions, they consider the detected information from the immediate neighbor GHs. We can also increase the coordination to the neighbor GHs located multihop away from the current GH. This requires a balance between the energy consumption of the detected information transmitted to multihops and the energy saving of GMs that can sleep more. We assume that the energy consumption of detected information sending and receiving isE
br and E
re, respectively. When GHs consider the detected information only from the immediate neighbor GHs, the energy consumption of the detected information transmission is
(10)
E
cons
h
=
1
=
E
br
+
8
E
re
,
when the detected information is transmitted to the neighbors which are h
=
H hops far away from the current node
(11)
E
cons
h
>
1
=
E
cons
h
=
1
+
∑
h
=
2
H
(
8
h
-
8
)
E
br
+
∑
h
=
2
H
8
h
E
re
.
When h
=
1, the energy saving by GMs sleeping is
(12)
E
save
h
=
1
=
[
(
P
i
-
P
s
)
t
sleep
t
k
+
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
i
-
P
t
r
2
)
τ
u
,
sp
]
×
N
CMs
,
where N
CMs is the number of the GMs in the current grid. Similar to h
=
1, when h
=
H, the sleep time of GMs is
(13)
t
sleep
m
l
-
h
′
=
[
(
H
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
η
T
GH
]
T
GH
-
τ
u
,
sp
,
and when h
=
H, the energy saving by GMs sleeping is
(14)
E
save
h
>
1
=
[
(
P
i
-
P
s
)
t
sleep
m
l
-
h
′
+
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
i
-
P
t
r
2
)
τ
u
,
sp
]
×
N
CMs
;
therefore, when h
=
H, we can obtain the energy saving as follows:
(15)
E
save
h
>
1
-
E
cons
h
>
1
=
(
P
i
-
P
s
)
N
CMs
[
(
H
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
η
T
GH
]
T
GH
-
4
H
2
(
E
br
+
E
re
)
-
4
H
(
E
re
-
E
br
)
+
C
,
where C is a constant which is not related to H,
(16)
C
=
N
CMs
[
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
s
-
P
t
r
2
)
τ
u
,
sp
]
-
E
br
.
To optimize the energy saving, the value of E
save
h
>
1
-
E
cons
h
>
1 needs to be the maximum. Since P
i
-
P
s
>
0, N
CMs
>
0 and τ
d
,
sp
,
τ
u
,
sp
,
T
GH, and η are all the constants. Thus, when the value of y in (17) is maximized, we can get the maximum value of E
save
h
>
1
-
E
cons
h
>
1:
(17)
y
=
(
P
i
-
P
s
)
N
CMs
α
v
max
⁡
H
-
4
H
2
(
E
br
+
E
re
)
-
4
H
(
E
re
-
E
br
)
+
C
.
To find the maximum y, H is differentiated as
(18)
∂
y
∂
H
=
(
P
i
-
P
s
)
N
CMs
α
v
max
⁡
-
8
H
(
E
br
+
E
re
)
-
4
(
E
re
-
E
br
)
;
thus, when ∂
y
/
∂
H
=
0, we have the maximum y and get H as follows:
(19)
H
=
(
P
i
-
P
s
)
N
CMs
(
α
/
v
max
⁡
)
+
4
(
E
br
-
E
re
)
8
(
E
br
+
E
re
)
;
therefore, the maximum saving energy is
(20)
E
s
=
max
⁡
{
(
E
save
h
=
1
-
E
cons
h
=
1
)
,
(
E
save
h
>
1
-
E
cons
h
>
1
)
}
.
We can select appropriate H to obtain the optimal energy saving policy according to the network parameters. When t
sleep
m
l
-
h
′
≥
T
t
h
1 and t
sleep
m
l
-
h
′
>
T
t
h
2  hold, the sleep time of the GMs in tracking stage with multihop GHs coordination can be set as min{
t
sleep
m
l
-
h
′
,
t
sleep
sur
}.


## 4.3.1. One Hop Neighbors Coordination

One hop neighbors coordination means when a GH makes PM decisions, it just considers the detected information from its immediate neighbor GHs. The detected information broadcasted by a GH includes the location of the sender and the distance between the sender and the target. It can be estimated by the strength of the sensing signal. A GH calculates the sleep time for its GMs in three different cases.The first case is that the GH neither detects any target nor receives any target information from others during an active time period. The maximum sleep time is decided by the following equation:(7)
max
⁡
t
sleep
tk
=
(
(
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
)
η
,
where α is the side length of the grid and η is the success ratio of detecting required by application.The second case is that the target is detected by the GH or its GMs. The GH keeps active until the target moves out of sensing area of its grid, and it decides the sleep time of its GMst
sleep
tk
=
0. Then the GH broadcasts a detected information message to its neighbour GHs so that they can prepare to track the target at the next moment.The third case is that the GH receives the target information from its neighbors. Thus, the GH can calculate the maximum sleep time for its GMs by the following equation:(8)
max
⁡
t
sleep
tk
=
(
(
min
⁡
{
d
GMs
,
d
e
t
e
c
t
N
o
d
e
}
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
)
η
,
where min
⁡
{
d
GMs
,
d
e
t
e
c
t
N
o
d
e
} is the minimum distance between the GMs of the current grid and the node who detects the target. Similarly, to overlap the active parts of GMs and their GH so that GMs and their GH communicate with each other, we get
(9)
t
sleep
tk
′
=
[
max
⁡
t
sleep
tk
T
GH
]
T
GH
-
τ
u
,
sp
,
where T
GH is the period of GHs. The sleep time of GM is set to the integer multiple of T
GH to overlap the active parts of GMs and their GH so that the GMs can send their sensing data to their GHs or receive the PM information from their GHs to adjust their sleep time accordingly. When t
sleep
tk
′
>
T
t
h
1 and t
sleep
tk
′
>
T
t
h
2  hold, the sleep time of the GMs in tracking stage t
sleep
tk can be set as min
⁡
{
t
sleep
tk
′
,
t
sleep
sur
}, in which t
sleep
sur is the sleep time of the GMs in the surveillance stage, otherwise t
sleep
tk
=
0. When there is change on the sleep time value of GMs, the GH informs its GMs about the updated sleep time. The GMs receive a new sleep time from their GH and adjust the current sleep mode. The sleep state transition of the GM is shown in Figure 3.The sleep state transition of the GM.
(a)
No target occurs
(b)
GM receives a new sleep time from its GH
(c)
GM detects a targetIn this way, sensor nodes will get the target movement information from the GHs in neighboring area and accurately estimate the sleep state and time interval. In addition, transmitting the target information only among GHs instead of that among all the sensor nodes can reduce the communication cost and information redundancy.


## 4.3.2. Multihop Policy Considerations

In our aforementioned policies, when GHs make the PM decisions, they consider the detected information from the immediate neighbor GHs. We can also increase the coordination to the neighbor GHs located multihop away from the current GH. This requires a balance between the energy consumption of the detected information transmitted to multihops and the energy saving of GMs that can sleep more. We assume that the energy consumption of detected information sending and receiving isE
br and E
re, respectively. When GHs consider the detected information only from the immediate neighbor GHs, the energy consumption of the detected information transmission is
(10)
E
cons
h
=
1
=
E
br
+
8
E
re
,
when the detected information is transmitted to the neighbors which are h
=
H hops far away from the current node
(11)
E
cons
h
>
1
=
E
cons
h
=
1
+
∑
h
=
2
H
(
8
h
-
8
)
E
br
+
∑
h
=
2
H
8
h
E
re
.
When h
=
1, the energy saving by GMs sleeping is
(12)
E
save
h
=
1
=
[
(
P
i
-
P
s
)
t
sleep
t
k
+
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
i
-
P
t
r
2
)
τ
u
,
sp
]
×
N
CMs
,
where N
CMs is the number of the GMs in the current grid. Similar to h
=
1, when h
=
H, the sleep time of GMs is
(13)
t
sleep
m
l
-
h
′
=
[
(
H
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
η
T
GH
]
T
GH
-
τ
u
,
sp
,
and when h
=
H, the energy saving by GMs sleeping is
(14)
E
save
h
>
1
=
[
(
P
i
-
P
s
)
t
sleep
m
l
-
h
′
+
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
i
-
P
t
r
2
)
τ
u
,
sp
]
×
N
CMs
;
therefore, when h
=
H, we can obtain the energy saving as follows:
(15)
E
save
h
>
1
-
E
cons
h
>
1
=
(
P
i
-
P
s
)
N
CMs
[
(
H
α
/
v
max
⁡
)
-
τ
d
,
sp
-
τ
u
,
sp
η
T
GH
]
T
GH
-
4
H
2
(
E
br
+
E
re
)
-
4
H
(
E
re
-
E
br
)
+
C
,
where C is a constant which is not related to H,
(16)
C
=
N
CMs
[
(
P
i
-
P
t
r
1
)
τ
d
,
sp
+
(
P
s
-
P
t
r
2
)
τ
u
,
sp
]
-
E
br
.
To optimize the energy saving, the value of E
save
h
>
1
-
E
cons
h
>
1 needs to be the maximum. Since P
i
-
P
s
>
0, N
CMs
>
0 and τ
d
,
sp
,
τ
u
,
sp
,
T
GH, and η are all the constants. Thus, when the value of y in (17) is maximized, we can get the maximum value of E
save
h
>
1
-
E
cons
h
>
1:
(17)
y
=
(
P
i
-
P
s
)
N
CMs
α
v
max
⁡
H
-
4
H
2
(
E
br
+
E
re
)
-
4
H
(
E
re
-
E
br
)
+
C
.
To find the maximum y, H is differentiated as
(18)
∂
y
∂
H
=
(
P
i
-
P
s
)
N
CMs
α
v
max
⁡
-
8
H
(
E
br
+
E
re
)
-
4
(
E
re
-
E
br
)
;
thus, when ∂
y
/
∂
H
=
0, we have the maximum y and get H as follows:
(19)
H
=
(
P
i
-
P
s
)
N
CMs
(
α
/
v
max
⁡
)
+
4
(
E
br
-
E
re
)
8
(
E
br
+
E
re
)
;
therefore, the maximum saving energy is
(20)
E
s
=
max
⁡
{
(
E
save
h
=
1
-
E
cons
h
=
1
)
,
(
E
save
h
>
1
-
E
cons
h
>
1
)
}
.
We can select appropriate H to obtain the optimal energy saving policy according to the network parameters. When t
sleep
m
l
-
h
′
≥
T
t
h
1 and t
sleep
m
l
-
h
′
>
T
t
h
2  hold, the sleep time of the GMs in tracking stage with multihop GHs coordination can be set as min{
t
sleep
m
l
-
h
′
,
t
sleep
sur
}.


## 4.4. Grid Maintenance

To avoid energy overfull consuming on GH, if the energy of any GH is lower than a thresholdT
e, the GH will broadcast a message “req-replace” to its GMs. Then the nodes in the same grid reselect the GH. A node with more remaining energy is expected to become a new GH.The pseudo code of the GH selection is shown in Algorithm1. When GM receives “req-replace” message, it waits a random time to broadcast “finish_election” message to compete the GH election. For each GM the residual energy E
residual
i is converted to a waiting time T
i (line 4). More residual energy leads to a shorter T
i. Therefore, the GM with the most E
residual
i waits for the shortest time before sending “finish_election” message to others. Therefore, it can be selected as GH (line 8 and 12). The other nodes stop waiting and give up the GH election as soon as they receive the message. T
i is calculated by the following equation:
(21)
T
i
=
T
min
⁡
+
(
T
max
⁡
-
T
min
⁡
)
(
1
-
E
residual
i
E
initial
i
)
+
R
(
T
ran
)
,
where T
min
⁡ and T
max
⁡ are two design parameters, which are used to control the waiting time in a reasonable range. E
residual
i and E
initial
i are the residual and initial energy of node, respectively. E
residual
i is divided by E
initial
i in order to avoid the case that a node waits too much time when its residual energy becomes very low. Two nodes might have the same residual energy and communication costs and therefore have the same T
i. To avoid this a random time R
(
T
ran
) is added. R
(
T
ran
) is a discrete random variable with the uniform distribution in [
0
,
T
ran
], which is an order of magnitude smaller than T
max
⁡.Algorithm 1:Selecting GH in one grid.
(1)   while (after initiating or received “req-replace”)
(2)  do
(3)  node N
i set a timer
(4)
T
i
← CalculateWaitTime (E
residual
i)
(5)  Wait (T
i)
(6)  if wait time expired
(7)      Broadcast (“finish_election”)
(8)      select N
i as GH
(9)   end if
(10)  if received (“finish_election” from N
j)
(11)     cancel wait ( )
(12)     select N
j as GH
(13)
end if
(14)
end if
(15) end whileIf GH election failed, maybe due to the loss of the broadcast messages, the old GH will continue its role and broadcast the reelection request periodically. For reliability purpose, when a GM fails to send data to its GH for several times (e.g., a GH dies suddenly), it will send a GH reelection request to the GMs.


## 5. Simulations and Analysis

### 5.1. Experiment Environment

We assume that there are 400 sensor nodes distributed randomly over an area of 150 m by 150 m. And the sensing range of each sensor node isr
=
15m. We also assume each node has an initial energy of 100 J (Joules).We setT
e
=
1
/
3 (initial energy) to avoid energy overfull consuming on GH. T
d is set to 30 m. If the moving distance of the target is larger than T
d, the real-time chain will be adjusted or reformed. The bandwidth of wireless channel is 2.4 Kbps, and the data packet size is 512 bytes.


### 5.2. Simulation Results

To compare the performance of SPM/DR with other schedules, we implemented the other three approaches, namely, (1) No PM approach (nodes are always on), (2) local PM approach (all the nodes sleep periodically if they did not detect any event in 2 s and the fixed sleep time is also set as 2 s), and (3) adaptive coordinate PM approach.Figure4 shows the average percentage of time when nodes are in active mode in surveillance stage. It can be seen that most of the nodes in SPM/DR approach are in sleep mode because we just keep the network border nodes alert and the other nodes have a lot of sleep time.Figure 4
Average percentage of time nodes are active.Figure5 shows the average energy changed with simulation time of the approaches in our simulation. It can be seen that SPM/DR approach can save about 35% more energy compared to adaptive coordinate PM approach in the surveillance stage. No PM approach network consumes the most energy because nodes are always active.Figure 5
Average energy consumption in surveillance stage.Next, we assume the target enters the field at a random location and moves at a constant speed of 5 m/s. Figure6 shows the average energy comparison of three approaches. Here, x-axis displays the time of simulation and y-axis displays the average energy consumption of every node at the corresponding time. It can be seen that SPM/DR saves about 15% more energy compared to adaptive coordinate PM approach.Figure 6
Average energy consumption in tracking stage.We can see that adaptive coordinate PM approach consumes more energy than SPM/DR due to more communication cost among neighbor nodes. The local PM approach also has more energy consumption because the nodes far from the target cannot have more sleep time. However our SPM/DR approach consumes the least energy because the sensor nodes in our approach have adaptive sleep time which allowed the nodes far from the target sleep longer.Table1 shows the average transmission delay in different approaches. From that we can see no PM approach has the shortest transmission delay since all the nodes are always in active mode. SPM/DR approach performs better than the other two approaches because the GHs in the real-time chain keep active for the sensed data transmission.Table 1
Average transmission delay.
PM approach
Delay
SPM/DR
0.76 ms
Adaptive coordinate PM
0.93 ms
local PM
1.25 ms
No PM
0.59 msIn a word, SPM/DR approach can conserve more energy for target tracking WSN. Moreover, it did not degrade tracking performance since we evaluated sleep time adaptively by target move information before the target comes up.


## 5.1. Experiment Environment

We assume that there are 400 sensor nodes distributed randomly over an area of 150 m by 150 m. And the sensing range of each sensor node isr
=
15m. We also assume each node has an initial energy of 100 J (Joules).We setT
e
=
1
/
3 (initial energy) to avoid energy overfull consuming on GH. T
d is set to 30 m. If the moving distance of the target is larger than T
d, the real-time chain will be adjusted or reformed. The bandwidth of wireless channel is 2.4 Kbps, and the data packet size is 512 bytes.


## 5.2. Simulation Results

To compare the performance of SPM/DR with other schedules, we implemented the other three approaches, namely, (1) No PM approach (nodes are always on), (2) local PM approach (all the nodes sleep periodically if they did not detect any event in 2 s and the fixed sleep time is also set as 2 s), and (3) adaptive coordinate PM approach.Figure4 shows the average percentage of time when nodes are in active mode in surveillance stage. It can be seen that most of the nodes in SPM/DR approach are in sleep mode because we just keep the network border nodes alert and the other nodes have a lot of sleep time.Figure 4
Average percentage of time nodes are active.Figure5 shows the average energy changed with simulation time of the approaches in our simulation. It can be seen that SPM/DR approach can save about 35% more energy compared to adaptive coordinate PM approach in the surveillance stage. No PM approach network consumes the most energy because nodes are always active.Figure 5
Average energy consumption in surveillance stage.Next, we assume the target enters the field at a random location and moves at a constant speed of 5 m/s. Figure6 shows the average energy comparison of three approaches. Here, x-axis displays the time of simulation and y-axis displays the average energy consumption of every node at the corresponding time. It can be seen that SPM/DR saves about 15% more energy compared to adaptive coordinate PM approach.Figure 6
Average energy consumption in tracking stage.We can see that adaptive coordinate PM approach consumes more energy than SPM/DR due to more communication cost among neighbor nodes. The local PM approach also has more energy consumption because the nodes far from the target cannot have more sleep time. However our SPM/DR approach consumes the least energy because the sensor nodes in our approach have adaptive sleep time which allowed the nodes far from the target sleep longer.Table1 shows the average transmission delay in different approaches. From that we can see no PM approach has the shortest transmission delay since all the nodes are always in active mode. SPM/DR approach performs better than the other two approaches because the GHs in the real-time chain keep active for the sensed data transmission.Table 1
Average transmission delay.
PM approach
Delay
SPM/DR
0.76 ms
Adaptive coordinate PM
0.93 ms
local PM
1.25 ms
No PM
0.59 msIn a word, SPM/DR approach can conserve more energy for target tracking WSN. Moreover, it did not degrade tracking performance since we evaluated sleep time adaptively by target move information before the target comes up.


## 6. Conclusions

This paper proposed a novel smart power management and delay reduction approach (SPM/DR) for tracking target in WSN. It can reduce energy consumption and increase the network lifetime with short data transmission delay. SPM/DR outperforms the other PM approaches by allowing more nodes to have longer sleep intervals and tracks the target by dynamically changing the schedule. Moreover, we use a real-time chain for transmitting the sensed data so that the transmission delay can be reduced. Simulation results proved that SPM/DR performs better than local and adaptive coordinate PM approach for target tracking.



---

*Source: 641720-2014-03-11.xml*