# Efficient and Adaptive Node Selection for Target Tracking in Wireless Sensor Network

Authors: Juan Feng; Hongwei Zhao; Baowang Lian
Journal: Journal of Sensors
 (2016)

---

## Abstract

In target tracking wireless sensor network, choosing the proper working nodes can not only minimize the number of active nodes, but also satisfy the tracking reliability requirement. However, most existing works focus on selecting sensor nodes which are the nearest to the target for tracking missions and they did not consider the correlation of the location of the sensor nodes so that these approaches can not meet all the goals of the network. This work proposes an efficient and adaptive node selection approach for tracking a target in a distributed wireless sensor network. The proposed approach combines the distance-based node selection strategy and particle filter prediction considering the spatial correlation of the different sensing nodes. Moreover, a joint distance weighted measurement is proposed to estimate the information utility of sensing nodes. Experimental results show that EANS outperformed the state-of-the-art approaches by reducing the energy cost and computational complexity as well as guaranteeing the tracking accuracy.


---

## Body

## 1. Introduction

Wireless Sensor Networks (WSNs) consist of a large amount of small, low-cost, and wirelessly connected sensor nodes deployed in an unattended natural environment. Since the sensor nodes are usually battery-powered and it is infeasible to replenish energy via replacing their battery after deployment, therefore optimization of energy consumption is essential in all aspects of WSN to prolong the network lifetime.In WSNs, an important application of target tracking has received significant attention in recent years [1]. In this application, the sensor nodes collectively monitor the roaming path of moving objects in the area of deployment. Nevertheless, in target tracking, the user is only interested in the occurrence of a certain event, like movement of an intruder or enemy tanks in battle. Since sensor nodes are deployed densely in WSNs, a single target is recorded by many nodes while normally these records are spatially correlated. The degree of this correlation is inversely proportional to the distance among these nodes. In order to save energy, a smaller number of sensors in the event area rather than the whole number of the sensors are used to take the tracking tasks. Thus, dynamically choosing the best nodes for tracking task can balance the energy consumption of each sensor node and improve the lifetime of networks. Hence, it is crucial to select the optimization set of sensor nodes with the minimum cost and quality tracking performance. To solve the node selection problem, entropy-based information utility measurements were proposed, which are implemented with Bayesian Filter, such as [2]. Although they achieve good tracking accuracy, these methods are computationally expensive. In [3], the authors propose a weighted distance-based information utility measurement which needs less computation but can reach competitive tracking accuracy. Unfortunately, this method does not consider the spatial correlation of the sensed reports by different sensors. So far, the existing works can not meet all the goals of the target tracking WSNs.With these motivations, we propose an efficient and adaptive node selection (EANS) strategy to dynamically choose the best set of sensor nodes for target tracking in WSNs. EANS combines the distance-based node selection strategy and particle filter prediction. The major objective of EANS is to keep reliable object tracking with minimum energy consumption. More precisely, the main contributions of this paper include the following:(i)
This paper proposed a novel spatial-correlated node selection strategy, called EANS, which selects the node with more residual energy and considers the spatial correlation of the sensors located at the different positions within the sensing range. Thus, EANS can balance energy consumption and guarantee the tracking reliability with the optimal set of sensor nodes and minimize working nodes so as to decrease the energy consumption significantly.
(ii)
This paper proposed a joint distance weighted information utility measurement, in which the joint information utility can be presented as the overlap area of the sight lines of the possible sensors and the covariance-related ellipses. In this way, EANS evaluates the usefulness of a sensor node’s observation without the complex entropy calculation and the a posteriori distribution estimation. Therefore, EANS can reduce the computational complexity and save the computational cost.
(iii)
EANS considers not only the virtual range between sensors and target, but also the parallel degree of sensor’s sight line to the target. In other words, it also considers the effect of angular diversity of sight lines so that the sensing range of the nodes in EANS is more reliable.The rest of this paper is organized as follows: Section2 gives an overview of related work. Then, the proposed efficient and adaptive node selection approach is presented in detail in Section 3. The experimental results are shown in Section 4. Finally, we conclude the paper in Section 5.


## 2. Related Works

Recently, the problem of selecting the best nodes for tracking a target in distributed WSNs has been attracting much research attention.The simplest approach (such as [4]) is selecting the closest nodes which have the shortest distance to the target for tracking mission. This kind of methods has simple calculations but low tracking accuracy. To improve the tracking accuracy, a combination of the distance and utility function was proposed in [5], in which each node extracts a priority value based on its utility function, which is related to the distances of targets from that node. Nodes with less priority reduce their sensing range before their neighbors. Then, nodes that cannot cover any target or whose nearby targets are covered by neighbor nodes are not assigned the task and they are turned off. However, the approach required the location information of all the nodes.In [6], the authors proposed a decentralized estimation method, which only needs to use local node information to achieve node selection. Furthermore, the number of active sensors is adaptively determined based on the absolute local innovations vector in [6]. In [7], posterior Cramer-Rao lower bound (PCRLB) was used as a criterion for sensor selection and exhaustive enumeration was adopted to search all possible combinations to seek for the minimum value of PCRLB. Unfortunately, the enumeration search would be a huge computational burden even when the density of a sensor network is just medium. In order to reduce complexity, the conditional posterior Cramer-Rao lower bound (C-PCRLB) in [8] was proposed as a sensor selection metric, which had a constraint on the total number of selected sensors to observe the target over a time window. These methods take the number of the selected nodes into account, but they did not consider the residual energy of each node and did not consider which nodes are more proper for the tracking mission. Moreover, there was also large computational burden.In [9], the authors proposed a node selection scheme within the framework of particle filter, which uses clustering network architecture for collaborative tracking. This work considered the remaining energy of sensor node and achieved energy saving efficiently as well as required tracking reliability. However, the cluster head always consumes extra energy because of controlling the tracking. And the node selection also neglects the angular diversity of nodes. In [10], an energy-efficient node selection algorithm for bearings-only sensors was proposed. The residual energy of a node was incorporated into the objective function to make a new criterion for node selection. However, all nodes in the paper needed time synchronized, which was difficult to implement in practice. In [11], a user selection scheme is proposed to minimize the overhead energy consumed by cooperative spectrum sensing. This method can conserve energy and achieve reasonably sensing accuracy, but it only focuses on the sensor node with a cognitive radio.In [2], an entropy-based sensor selection heuristic approach is proposed. It is implemented with Bayesian Filter. The main idea of entropy-based approaches is to optimize an information utility function using the defined metrics. In [12], a mutual-information based sensor selection (MISS) algorithm was implemented for involvement in the mixture procedure. MISS allowed the sensor nodes with the highest mutual information about the target state to transfer data so that the energy ingestion was reduced while the preferred target position estimation accuracy was met. In [13], the authors proposed a light-weight sensing node selection scheme, which solved the sensing node selection problem by adopting a composite function in which information utility measure and energy consumption measure carry different weights. Although these approaches achieve good tracking accuracy, these methods all take the information utility brought by nodes as the objective function and have high computational complexity and expensive cost on computation.In [14], the node selection is formulated as a subset selection problem which is shown to have a complexity that is NP-hard. At each step of the tracking task, the active nodes are selected from all sensors within the sensing range to minimize residue energy variations. In [15], the authors proposed a Fixed-Tree Relaxation-Based Algorithm (FTRA) and a very efficient Iterative Distributed Algorithm (IDA) to jointly optimize both sensor selection and routing structure and obtain the best possible estimation performance at a given querying node, for a given total power budget. However, these methods selected one sensor node for the tasks at each step and did not consider the locations correlations of the sensing nodes. Because the different combinations of the nodes within the sensing range can obtain the different tracking performance and different residue energy variations, the node selection problem should be considered completely. Besides, in [3], the authors proposed a weighted distance-based node selection method for bearings-only sensors in WSN. The sensor with the minimum weighted distance is activated for tracking mission. Although weighted distance method needs less computation comparing with entropy-based sensor selection method, it chooses only one sensor to track the target each time and does not consider the spatial correlations of sensor nodes.


## 3. Efficient and Adaptive Node Selection

### 3.1. Network Model

In this paper, we consider a static WSN which is composed of one sink andp randomly distributed sensor nodes n
i, i
∈
[
1
,
p
] in a two-dimensional sensing field, where p is the number of the deployed nodes. Our sensor network model has the following properties and assumptions:(i)
The sink is fixed and has an infinite power supply. And it gathers the information sensed by sensor nodes.
(ii)
The distribution of sensor nodes is mutually independent. Every node is homogeneous and energy constrained.
(iii)
Each node knows its position by using GPS or any localization algorithm. LetX
i
(
x
i
,
y
i
) be the location of node n
i.Sensor nodes have three states, that is, active, sleep, and idle state. They remain in the sleep state most of the time and switch to the active state at specified time slots scheduled by the sink. In the active time slots, sensor nodes receive the assignment messages from the sink and check if there are sensing or relaying tasks in the next time instant. If there are tasks, they will keep active; otherwise they will sleep in next sensing instant. Afterward, the sink node predicts the next position of target by received data using particle filter algorithm. Then, the sink chooses the best nodes for the next task according to the joint distance weighted information utility measurement.The goal of our work is to select the best subset of nodes for the next tracking task. Moreover, we decide which subset of nodes is the best according to two factors: (1) a joint distance weighted information utility and (2) the successful detection probability and residual energy of the candidate nodes. Therefore, given any timet, when a target’s location L
t
=
(
x
,
y
), the target can be reliably detected with less and balanced energy consumption.


### 3.2. Prediction Target Position Based on Particle Filter

In target tracking research field, particle filter (PF) has become a very effective algorithm because of its potential of coping with difficult nonlinear or non-Gaussian problems. PF with parallel structure is based on Monte Carlo simulation and Bayesian sampling estimation theories [16]. And it is a sequential importance sampling method which is flexible and easy to be implemented.As the sink node can obtain the collaborative sensing result of target positions, the PF algorithm is performed on the sink node to predict the target position in the next sensing instant. The schematic diagram of PF algorithm is shown in Figure1.Figure 1
Schematic diagram of particle filter algorithm.The steps of PF are outlined as follows.(
1) Initialization. Assuming the initial target position probability distribution is p
(
X
(
0
)
), the particle set is shown as follows:(1)
X
i
0
,
i
=
1
,
…
,
N
s
~
p
X
0
,where N
s is the number of particles. X
(
0
) is the target position estimation in the initial sensing instant. Thus, X
i
(
k
)
=
[
x
i
(
k
)
,
y
i
(
k
)
] is the estimated target position by particle i. In addition, the initial importance weight of particle i is set as(2)
w
i
0
=
1
N
s
.(
2) Iterations. The importance weight of k
+
1 time instant is calculated as follows:(3)
w
k
+
1
i
=
w
k
i
p
Z
k
+
1
∣
X
k
+
1
i
p
X
k
+
1
i
∣
X
k
i
q
X
k
+
1
i
∣
X
k
i
,
Z
k
+
1
=
w
k
i
p
Z
k
+
1
∣
X
k
+
1
i
,where Z
k
+
1 is the observation of target position in the t
+
1 sensing instant.(
3) Resampling. When the variance of the importance weights becomes excessive, the particle needs to be resampled. The effective sample size is defined as(4)
N
e
f
f
=
N
s
1
+
V
a
r
w
i
k
,where V
a
r is the variance function. When N
e
f
f drops below threshold N
t
h, resample N
s samples according to p
X
i
k
∣
Z
k and set importance weight of particle i as(5)
w
i
k
=
1
N
s
.Thus, the state of target position is updated as(6)
X
k
+
1
=
∑
i
=
1
N
s
X
i
k
+
1
w
i
k
+
1
.In each sensing instant, the sink node can obtain a prior state of target position for the next sensing instant.


### 3.3. Efficient and Adaptive Node Selection

Dynamically choosing the best set of sensor nodes for tracking task can reduce the energy consumption of the network and improve tracking accuracy. As Figure2 shows, there are many sensor nodes in the sensing area. However, tracking a target does not need so many sensor nodes. Generally, we should select sensor nodes which can bring more information among the candidate nodes in this area. The sink is required to decide which nodes should be active for the next task and which nodes should be kept sleeping to save energy.Figure 2
Node selection in target tracking WSNs.In the entropy-based method, the entropy is used as information utility measure. The information utility of nodeN
i is calculated by(7)
U
t
i
l
i
t
y
N
i
=
-
H
p
X
t
+
1
∣
Z
¯
t
+
1
=
∑
P
X
t
+
1
∣
Z
¯
t
+
1
log
⁡
P
X
t
+
1
∣
Z
¯
t
+
1
,where P
X
t
+
1
∣
Z
¯
t
+
1 is the posterior distribution of the target’s state. More details of entropy-based information utility measure can be found in [2].According to Section3.2, we have the knowledge of target state predicted by PF algorithm. From that, we can obtain the predicted location of the target as (
x
¯
′
,
y
¯
′
) and a covariance matrix as (8)
C
o
v
′
=
D
x
′
2
D
x
′
D
y
′
r
D
x
′
D
y
′
r
D
y
′
2
,where D
x
′ and D
y
′ are deviations along x
′- and y
′-axes, respectively, and r is the correlation coefficient. Then a new coordinate system, whose origin is at (
x
¯
′
,
y
¯
′
) and whose axes are along the direction of the eigenvectors of C
o
v
′, can be established [3]. In the new coordinate system, the predicted belief is represented by zero-mean Gaussian density function with covariance: (9)
C
o
v
=
σ
x
2
0
0
σ
y
2
,where σ
x
2 and σ
y
2 are the largest and smallest eigenvalue of C
o
v
′, respectively. Then, the state uncertainty of the target can be represented by an ellipse whose major axis and minor axis are 3
σ
x
2 and 3
σ
y
2, respectively, as Figure 3 shows. Choosing 3 sigma is because, within the region covered by a 3 sigma ellipse, the target, whose state follows a Gaussian distribution, will appear by the chance of 98.89% [17].Figure 3
Illustration of information utility measure in weighted distance method.Assuming the measurement errorΔ
δ
i is known, the location (
x
i
,
y
i
) of node N
i can be denoted by the polar coordinates (
δ
i
,
R
i
). Then, the information utility in weighted distance method is defined as(10)
Utility
N
i
=
-
A
r
e
a
a
b
c
d
.That is, the information utility in the weighted distance method can be approximated as the intersected area of the sight lines of a candidate node and the ellipse, as Figure 3 shows. The smaller the area is, the more the information is provided by the node.Unfortunately, because the locations of sensing nodes can affect each other on the estimation of target’s state and position, just considering one sensor node each time is not enough when node selecting algorithm is implemented. As shown in Figure4, nodes N
i, N
j, and N
s are three of candidate sensing nodes. The area enclosed by nodes N
i and N
j (Figure 4(a)) is much larger than the area enclosed by nodes N
i and N
s (Figure 4(b)). That is, if we both choose two sensor nodes to track, choosing nodes N
i and N
s can obtain more certainty of the target’s state than that of choosing nodes N
i and N
j. Therefore, when nodes are selected, the correlation of location of sensor nodes should be considered. And we proposed a joint distance weighted information utility measurement to effectively select nodes for tracking mission. It can be represented as follows:(11)
J
o
i
n
t
_
u
t
i
l
i
t
y
N
i
,
N
j
=
-
C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j
,where C
_
A
r
e
a
N
i is the certainty area enclosed by the sight lines of node N
i and the ellipse (such as Figure 3). Consider C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j is the overlapped area of the certainty area of nodes N
i and N
j. The smaller the area C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j is, the more the certainty by using the node’s information will be there.Figure 4
Effect of node’s location on information utility measure.
(a)
(b)The equation of the uncertainty ellipse is known as(12)
x
2
3
σ
x
2
+
y
2
3
σ
y
2
=
1
.In order to obtain the joint distance weighted information utility, we just need to calculate the equation of the sight lines of the sensor node. The process of calculation is as follows (taking Figure 3 as an example).(1)
The line crossed nodeN
i and the origin is represented as (13)
x
x
i
=
y
y
i
.
Thus, the distance from nodeN
i to the origin is(14)
x
i
2
+
y
i
2
.
(2)
Calculating the degree of the angle∠
1 is(15)
∠
1
=
arcsin
⁡
y
i
x
i
2
+
y
i
2
.
(3)
Calculating the distance from nodeB to node A is(16)
d
B
A
=
tan
⁡
π
2
-
θ
-
arcsin
⁡
y
i
x
i
2
+
y
i
2
y
i
,where θ is the angle of sight lines of node N
i. Therefore, we get d
O
B
=
x
i
-
d
B
A and the line equation of B
N
i is obtained. Accordingly, we can get equations of the other line and calculate the certainty area. For simplicity, C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j can be approximately calculated as the number of the valid points. Suppose n
a points are generated in the ellipse evenly and randomly; then the fallen points in the area of C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j are called valid points. In this way, the complex entropy calculation is converted to the simple comparing operation. Moreover, we can control the computational complexity and accuracy by choosing proper n
a. In our work, we set n
a
=
10
3.When the sink obtains the estimated position of the target(
x
¯
′
,
y
¯
′
), it needs to select and awake the sensor nodes to track for next time instant. All the nodes whose sensed range includes (
x
¯
′
,
y
¯
′
) are regarded as candidate nodes and the corresponding area is called the sensing area. The sink first chooses one node N
f which has the most residual energy in the sensing area. Then, the joint information utility of N
f and the other candidate nodes is calculated, respectively. And choose the node which has the largest joint information utility as the tracking node. This procedure is continued until enough tracking nodes are selected. It can be depicted in Algorithm 1.Algorithm 1:EANS node selection algorithm.
(1)   input set of candidate nodes CN
=
{
N
1
⋯
N
u
}, u
∈
[
1
,
U
]
(2)   set of selected nodes SN
=
{
N
1
⋯
N
m
}, m
∈
[
1
,
M
]
(3)   i
=
1
(4)   Max_residual_energy = 0
(5)   while (i
<
U)
(6)    for each (
N
i
∈
CN
)
(7)      if (residual_energy(N
i) > Max_residual_energy)
(8)       Max_residual_energy = residual_energy(N
i)
(9)       Max_residual_energy_N = N
i
(10)    end if
(11)   end for
(12)   i
=
i
+
1
(13)  end while
(14)  N
f = Max_residual_energy_N
(15)  add (N
f) to SN
(16)  i
=
1, n
=
1
(17)  Max_utility = 0
(18)  while (i
<
U && n
<
M)
(19)   for each (
N
i
∈
CN
-
SN
)
(20)  calculate
J
o
i
n
t
_
u
t
i
l
i
t
y
(
N
i
,
N
f
), N
i
∈
CN && N
i
≠
N
f
(21)    if (J
o
i
n
t
_
u
t
i
l
i
t
y
(
N
i
,
N
f
) > Max_utility)
(22)     Max_utility = J
o
i
n
t
_
u
t
i
l
i
t
y
(
N
i
,
N
f
)
(23)     add (N
i) to SN
(24)    end if
(25)  end for
(26) end while
(27) N
f
=
N
i  goto line (16)
(28) output SN


## 3.1. Network Model

In this paper, we consider a static WSN which is composed of one sink andp randomly distributed sensor nodes n
i, i
∈
[
1
,
p
] in a two-dimensional sensing field, where p is the number of the deployed nodes. Our sensor network model has the following properties and assumptions:(i)
The sink is fixed and has an infinite power supply. And it gathers the information sensed by sensor nodes.
(ii)
The distribution of sensor nodes is mutually independent. Every node is homogeneous and energy constrained.
(iii)
Each node knows its position by using GPS or any localization algorithm. LetX
i
(
x
i
,
y
i
) be the location of node n
i.Sensor nodes have three states, that is, active, sleep, and idle state. They remain in the sleep state most of the time and switch to the active state at specified time slots scheduled by the sink. In the active time slots, sensor nodes receive the assignment messages from the sink and check if there are sensing or relaying tasks in the next time instant. If there are tasks, they will keep active; otherwise they will sleep in next sensing instant. Afterward, the sink node predicts the next position of target by received data using particle filter algorithm. Then, the sink chooses the best nodes for the next task according to the joint distance weighted information utility measurement.The goal of our work is to select the best subset of nodes for the next tracking task. Moreover, we decide which subset of nodes is the best according to two factors: (1) a joint distance weighted information utility and (2) the successful detection probability and residual energy of the candidate nodes. Therefore, given any timet, when a target’s location L
t
=
(
x
,
y
), the target can be reliably detected with less and balanced energy consumption.


## 3.2. Prediction Target Position Based on Particle Filter

In target tracking research field, particle filter (PF) has become a very effective algorithm because of its potential of coping with difficult nonlinear or non-Gaussian problems. PF with parallel structure is based on Monte Carlo simulation and Bayesian sampling estimation theories [16]. And it is a sequential importance sampling method which is flexible and easy to be implemented.As the sink node can obtain the collaborative sensing result of target positions, the PF algorithm is performed on the sink node to predict the target position in the next sensing instant. The schematic diagram of PF algorithm is shown in Figure1.Figure 1
Schematic diagram of particle filter algorithm.The steps of PF are outlined as follows.(
1) Initialization. Assuming the initial target position probability distribution is p
(
X
(
0
)
), the particle set is shown as follows:(1)
X
i
0
,
i
=
1
,
…
,
N
s
~
p
X
0
,where N
s is the number of particles. X
(
0
) is the target position estimation in the initial sensing instant. Thus, X
i
(
k
)
=
[
x
i
(
k
)
,
y
i
(
k
)
] is the estimated target position by particle i. In addition, the initial importance weight of particle i is set as(2)
w
i
0
=
1
N
s
.(
2) Iterations. The importance weight of k
+
1 time instant is calculated as follows:(3)
w
k
+
1
i
=
w
k
i
p
Z
k
+
1
∣
X
k
+
1
i
p
X
k
+
1
i
∣
X
k
i
q
X
k
+
1
i
∣
X
k
i
,
Z
k
+
1
=
w
k
i
p
Z
k
+
1
∣
X
k
+
1
i
,where Z
k
+
1 is the observation of target position in the t
+
1 sensing instant.(
3) Resampling. When the variance of the importance weights becomes excessive, the particle needs to be resampled. The effective sample size is defined as(4)
N
e
f
f
=
N
s
1
+
V
a
r
w
i
k
,where V
a
r is the variance function. When N
e
f
f drops below threshold N
t
h, resample N
s samples according to p
X
i
k
∣
Z
k and set importance weight of particle i as(5)
w
i
k
=
1
N
s
.Thus, the state of target position is updated as(6)
X
k
+
1
=
∑
i
=
1
N
s
X
i
k
+
1
w
i
k
+
1
.In each sensing instant, the sink node can obtain a prior state of target position for the next sensing instant.


## 3.3. Efficient and Adaptive Node Selection

Dynamically choosing the best set of sensor nodes for tracking task can reduce the energy consumption of the network and improve tracking accuracy. As Figure2 shows, there are many sensor nodes in the sensing area. However, tracking a target does not need so many sensor nodes. Generally, we should select sensor nodes which can bring more information among the candidate nodes in this area. The sink is required to decide which nodes should be active for the next task and which nodes should be kept sleeping to save energy.Figure 2
Node selection in target tracking WSNs.In the entropy-based method, the entropy is used as information utility measure. The information utility of nodeN
i is calculated by(7)
U
t
i
l
i
t
y
N
i
=
-
H
p
X
t
+
1
∣
Z
¯
t
+
1
=
∑
P
X
t
+
1
∣
Z
¯
t
+
1
log
⁡
P
X
t
+
1
∣
Z
¯
t
+
1
,where P
X
t
+
1
∣
Z
¯
t
+
1 is the posterior distribution of the target’s state. More details of entropy-based information utility measure can be found in [2].According to Section3.2, we have the knowledge of target state predicted by PF algorithm. From that, we can obtain the predicted location of the target as (
x
¯
′
,
y
¯
′
) and a covariance matrix as (8)
C
o
v
′
=
D
x
′
2
D
x
′
D
y
′
r
D
x
′
D
y
′
r
D
y
′
2
,where D
x
′ and D
y
′ are deviations along x
′- and y
′-axes, respectively, and r is the correlation coefficient. Then a new coordinate system, whose origin is at (
x
¯
′
,
y
¯
′
) and whose axes are along the direction of the eigenvectors of C
o
v
′, can be established [3]. In the new coordinate system, the predicted belief is represented by zero-mean Gaussian density function with covariance: (9)
C
o
v
=
σ
x
2
0
0
σ
y
2
,where σ
x
2 and σ
y
2 are the largest and smallest eigenvalue of C
o
v
′, respectively. Then, the state uncertainty of the target can be represented by an ellipse whose major axis and minor axis are 3
σ
x
2 and 3
σ
y
2, respectively, as Figure 3 shows. Choosing 3 sigma is because, within the region covered by a 3 sigma ellipse, the target, whose state follows a Gaussian distribution, will appear by the chance of 98.89% [17].Figure 3
Illustration of information utility measure in weighted distance method.Assuming the measurement errorΔ
δ
i is known, the location (
x
i
,
y
i
) of node N
i can be denoted by the polar coordinates (
δ
i
,
R
i
). Then, the information utility in weighted distance method is defined as(10)
Utility
N
i
=
-
A
r
e
a
a
b
c
d
.That is, the information utility in the weighted distance method can be approximated as the intersected area of the sight lines of a candidate node and the ellipse, as Figure 3 shows. The smaller the area is, the more the information is provided by the node.Unfortunately, because the locations of sensing nodes can affect each other on the estimation of target’s state and position, just considering one sensor node each time is not enough when node selecting algorithm is implemented. As shown in Figure4, nodes N
i, N
j, and N
s are three of candidate sensing nodes. The area enclosed by nodes N
i and N
j (Figure 4(a)) is much larger than the area enclosed by nodes N
i and N
s (Figure 4(b)). That is, if we both choose two sensor nodes to track, choosing nodes N
i and N
s can obtain more certainty of the target’s state than that of choosing nodes N
i and N
j. Therefore, when nodes are selected, the correlation of location of sensor nodes should be considered. And we proposed a joint distance weighted information utility measurement to effectively select nodes for tracking mission. It can be represented as follows:(11)
J
o
i
n
t
_
u
t
i
l
i
t
y
N
i
,
N
j
=
-
C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j
,where C
_
A
r
e
a
N
i is the certainty area enclosed by the sight lines of node N
i and the ellipse (such as Figure 3). Consider C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j is the overlapped area of the certainty area of nodes N
i and N
j. The smaller the area C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j is, the more the certainty by using the node’s information will be there.Figure 4
Effect of node’s location on information utility measure.
(a)
(b)The equation of the uncertainty ellipse is known as(12)
x
2
3
σ
x
2
+
y
2
3
σ
y
2
=
1
.In order to obtain the joint distance weighted information utility, we just need to calculate the equation of the sight lines of the sensor node. The process of calculation is as follows (taking Figure 3 as an example).(1)
The line crossed nodeN
i and the origin is represented as (13)
x
x
i
=
y
y
i
.
Thus, the distance from nodeN
i to the origin is(14)
x
i
2
+
y
i
2
.
(2)
Calculating the degree of the angle∠
1 is(15)
∠
1
=
arcsin
⁡
y
i
x
i
2
+
y
i
2
.
(3)
Calculating the distance from nodeB to node A is(16)
d
B
A
=
tan
⁡
π
2
-
θ
-
arcsin
⁡
y
i
x
i
2
+
y
i
2
y
i
,where θ is the angle of sight lines of node N
i. Therefore, we get d
O
B
=
x
i
-
d
B
A and the line equation of B
N
i is obtained. Accordingly, we can get equations of the other line and calculate the certainty area. For simplicity, C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j can be approximately calculated as the number of the valid points. Suppose n
a points are generated in the ellipse evenly and randomly; then the fallen points in the area of C
_
A
r
e
a
N
i
∩
C
_
A
r
e
a
N
j are called valid points. In this way, the complex entropy calculation is converted to the simple comparing operation. Moreover, we can control the computational complexity and accuracy by choosing proper n
a. In our work, we set n
a
=
10
3.When the sink obtains the estimated position of the target(
x
¯
′
,
y
¯
′
), it needs to select and awake the sensor nodes to track for next time instant. All the nodes whose sensed range includes (
x
¯
′
,
y
¯
′
) are regarded as candidate nodes and the corresponding area is called the sensing area. The sink first chooses one node N
f which has the most residual energy in the sensing area. Then, the joint information utility of N
f and the other candidate nodes is calculated, respectively. And choose the node which has the largest joint information utility as the tracking node. This procedure is continued until enough tracking nodes are selected. It can be depicted in Algorithm 1.Algorithm 1:EANS node selection algorithm.
(1)   input set of candidate nodes CN
=
{
N
1
⋯
N
u
}, u
∈
[
1
,
U
]
(2)   set of selected nodes SN
=
{
N
1
⋯
N
m
}, m
∈
[
1
,
M
]
(3)   i
=
1
(4)   Max_residual_energy = 0
(5)   while (i
<
U)
(6)    for each (
N
i
∈
CN
)
(7)      if (residual_energy(N
i) > Max_residual_energy)
(8)       Max_residual_energy = residual_energy(N
i)
(9)       Max_residual_energy_N = N
i
(10)    end if
(11)   end for
(12)   i
=
i
+
1
(13)  end while
(14)  N
f = Max_residual_energy_N
(15)  add (N
f) to SN
(16)  i
=
1, n
=
1
(17)  Max_utility = 0
(18)  while (i
<
U && n
<
M)
(19)   for each (
N
i
∈
CN
-
SN
)
(20)  calculate
J
o
i
n
t
_
u
t
i
l
i
t
y
(
N
i
,
N
f
), N
i
∈
CN && N
i
≠
N
f
(21)    if (J
o
i
n
t
_
u
t
i
l
i
t
y
(
N
i
,
N
f
) > Max_utility)
(22)     Max_utility = J
o
i
n
t
_
u
t
i
l
i
t
y
(
N
i
,
N
f
)
(23)     add (N
i) to SN
(24)    end if
(25)  end for
(26) end while
(27) N
f
=
N
i  goto line (16)
(28) output SN


## 4. Performance Evaluation

To evaluate the performance of the proposed approach of EANS, we simulated a network with 100 sensors nodes randomly laid out in a 100 m × 100 m area. We also compare our simulation results with the closest node selection (in which the nodes closest to the target are selected to track), the weighted distance node selection method (in which a node is selected once time according to its own information utility) and entropy-based method in terms of Mean square errors, execution time and energy cost.The sink is fixed and located at (100, 150). The sensing range of each sensor node isR
s
e
n
s
i
n
g
=
10 m. Moreover, each sensor has a sight angle of 40 degrees and the measurement error follows a Gaussian distribution whose standard deviation is 3 degrees. We also assume that each node has an initial energy of 1 J (Joule). A very widely used energy consumption model (such as the one in [18]) is adopted, as described in (17)
E
T
x
k
,
d
=
E
T
x
-
e
l
e
c
+
ε
a
m
p
∗
d
α
∗
k
,
E
R
x
k
=
E
R
x
-
e
l
e
c
∗
k
,where E
T
x
-
e
l
e
c and E
R
x
-
e
l
e
c are the energy consumption of the transmitter and receiver electronics. ε
a
m
p
[
J
o
u
l
e
/
(
b
i
t
·
m
α
)
] is a constant that represents the energy needed to transmit one bit to achieve an acceptable signal to noise ratio over distance d, and α is the path loss exponent (2
≤
α
≤
5) which depends on the channel quality. We can assume E
T
x
-
e
l
e
c
=
E
R
x
-
e
l
e
c
=
E
e
l
e
c and set parameters E
e
l
e
c
=
50 nJ/b, ε
a
m
p
=
100 pJ/(b
·
m
2), and α
=
2. The power consumption of radio in idle and sleep mode is 0.22 mW and 0.000006 mW, respectively. The bandwidth of wireless channel is 1 Mbps and we adopted the MAC model of IEEE 802.15.4. In our experiments, a data packet size is 2000 bits and a control message is 64 bits long. In PF algorithm, the particle number N
s is set as 200 and the resampling threshold N
t
h
=
0.2
N
s. The sampling period is 1 s.For a moving target, we assume a target in the sensing area moves randomly with maximum accelerationa
m
a
x
=
2
m
/
s
2 and maximum velocity v
m
a
x
=
6
m
/
s. This process model is given by(18)
X
k
+
1
=
1
T
0
0
0
1
0
0
0
0
1
T
0
0
0
1
X
k
+
T
2
2
T
T
2
2
T
v
k
,where X
k
=
[
x
,
v
x
,
y
,
v
y
]
T is the state of the moving target at k time instant. T is the sampling time interval, T
=
1
s. x
,
v
x are the position and velocity of the target in the direction of x-axis, respectively. y, v
y are the position and velocity of the target in the direction of y-axis, respectively. v
k is the state transition noise of the target: v
k
~
N
(
0
,
σ
), σ
=
2
°. In addition, the observation model is(19)
Z
k
+
1
=
H
X
k
+
1
+
w
k
+
1
,
H
=
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
,where H is the observation matrix. w
k
+
1 is the measurement noise which is assumed to be white Gaussian noise sequence with zero means and the variance σ. The target trajectory is generated as shown in Figure 5 and this scenario can represent the generalization of the target tracking problem. For each simulation, we run at least 50 times with different random node distributions and the average results are shown in Figure 6.Figure 5
Target trajectory in the sensing area.Figure 6
Mean square positioning errors in different methods.Figure6 shows the mean square positioning errors in the different approaches when 3 nodes are selected for tracking. From Figure 6, we can see that the closest node selection method gives the biggest errors because it does not consider the moving trend of the target and the effect of the angular diversities of sensor nodes. The entropy-based method has the most accurate results because it executes a lot of probability predictions and entropy calculations which are computationally intensive. The weighted distance node selection method has less accuracy than that in the proposed EANS because it selects one node each time and did not consider the relations among the locations of the sensor nodes. As shown in Figure 6, EANS method achieves almost the same precision as entropy-based approach because it adopts the joint distance weighted information utility measurement considering the spatial correlation of sensor nodes to provide much more useful information for node selections.In order to investigate the computational complexities of these approaches in the simulations, the experiments were carried out keeping the other parameters fixed and progressively increasing the number of active candidate nodes to be selected for tracking in the sensing area. Specifically, the candidate nodes increase from 1 to 10. Figure7 shows the execution time of the different approaches. Not surprisingly, all the algorithms use more execution time with increasing the number of candidate nodes. This is because more computations are needed for more candidate sensor nodes. The execution time of the entropy-based approach quickly rises in pace with the increasing candidate nodes and it is the largest among these approaches because more computation of predictions and mutual information utilities is needed and it is more complex with a large number of sensor nodes. The closest approach achieves the best results compared to the others because it is simple to estimate the distance between the node and target. The execution time of EANS is a little larger than that of the weighted distance approach when candidate nodes increase because more calculations are needed for the joint information utility. However, the results of EANS are very near to that of the weighted distance approach and the largest difference in these two approaches is just 0.1 s. From Figures 6 and 7, we can see that EANS has relative lower computational complexity to achieve more accuracy.Figure 7
Comparison of execution time versus the number of active sensors in the sensing area.Moreover, nowadays, sensor nodes are available with a longer or variable sensing range. If sensing ranges of sensors are changed, the number of sensor nodes within the sensing range is also changed. Table1 shows the average execution time of node selection varying with the different sensing range in the approaches. Obviously, the longer sensing range the sensors have, the more nodes are within sensing range; that is to say, the node selection algorithms need to select the working nodes from the large number of nodes. Therefore, the average execution time of each approach is increased. Nevertheless, our EANS also have good performance. With regard to tracking accuracy, the increased sensing ranges of nodes have no effects on it, because the tracking accuracy depends on the selected working nodes and the number of selected working nodes.Table 1
Comparison of different approaches of average execution time.
Terms
Sensing ranges
Sensing range of sensors
10 m
20 m
40 m
80 m
Average number of  nodes within sensing range
4
9
28
76
Average execution time of node selection (s)
Weighted distance
0.535
1.168
3.116
6.389
Closest
0.115
0.492
0.834
2.529
Entropy-based
0.763
2.218
6.273
13.517
EANS
0.563
1.272
3.656
7.395Figure8 shows the mean square positioning errors versus the number of selected nodes for tracking. Obviously, the more nodes are selected, the more accuracy can be obtained when the selected nodes are in the range of 1 to 6. If the number of the selected nodes is bigger than 6, the accuracy increases slowly and inconspicuously because some selected nodes bring the repetitive and useless information. As shown in Figure 8, although the accuracy of the closest method rises with the increasing selected nodes, it has the worst results because the selected nodes provide less useful information. When the selected nodes grow from 1 to 5, the accuracy of EANS increases substantially because the most useful nodes set for tracking can be selected by EANS. The weighted distance approach has worse results than that in EANS because the correlations of the nodes are not considered in node selection. Comparing the results of EANS with that in the closest and weighted distance approaches, it is seen that using a fewer nodes for tracking in EANS can achieve the accuracy which is obtained by more selected nodes in the other two approaches. Therefore, EANS approach can reduce the number of the active nodes for tracking so as to save energy and guarantee the tracking performance.Figure 8
Mean square positioning errors versus the number of selected nodes.Finally, Table2 shows the comparison of the average energy cost of the system and fail tracking percentage in the four approaches. We can see that EANS has the least energy cost among these approaches. This is caused by the following reasons: (1) EANS reduces the number of active nodes for tracking tasks. (2) The target state prediction in EANS is implemented at the sink, which does not spend the energy of sensor nodes. (3) It has relative less computational works. Although the closest approach has the simplest calculations, it needs more active nodes to guarantee the tracking accuracy so that it costs the most energy. The entropy-based approach costs more energy because it has massive calculating works. In addition, because the closest approach just selects the nodes near to the current location of the target and does not consider the next target location, it has higher fail tracking percentage than the others. To sum up, EANS achieves more energy efficiency and less computational complexity while degrading the tracking performance.Table 2
Comparison of different approaches for tracking.
Approaches
Terms
Average energy cost of the system (J)
Fail tracking percentage (%)
Weighted distance
0.226
0.73
Closest
0.251
1.26
Entropy-based
0.243
0.63
EANS
0.213
0.66


## 5. Conclusions

This paper proposed an efficient and adaptive node selection (EANS) approach for target tracking WSNs. EANS combines the distance-based node selection strategy and particle filter which is implemented at the sink to predict target states. The proposed spatial-correlated node selection algorithm uses a joint distance weighted measurement to estimate the information utility of sensing nodes. EANS has better performance than the other approaches by considering the spatial correlations of the sensing nodes in the process of node selections. The simulation results proved that EANS outperformed the state-of-the-art approaches by reducing the energy cost and computational complexity as well as guaranteeing the tracking accuracy.



---

*Source: 9152962-2015-11-22.xml*