Sie sind auf Seite 1von 10

Performance analysis of target tracking via wireless sensor network

Amr Lotfy Elewa M. and Osama M. El Ghandour


Abstract One of the important application of wireless sensor network is tracking mobile targets, we
adopted the elliptical scheme to solve the target tracking problem by taking into account the coverage area ,
the quality of monitoring , path of target, conserving power and handover.We proposed a new method to mi-
nimize power required for tracking , and we where able to save the power by an amount of 9.16% and solve
the problem of handover by devising the area of tracking into what is called relay area medium and relay
area focal scheme respectively. By means of this we obtained the best performance of QoM and solved
handoff problem even under severe Fading conditions and saving power by elliptical scheme than the other
schemes.
Keywords QoM: quality of monitoring, WSN: wireless sensor network, ellipse, relay area focal, relay area
medium, P
f
: probability of false alarm, P
m
: probability of target missing.

1 INTRODUCTION
ireless sensor networks are composed of hun-
dreds or thousands of compact devices called
sensor nodes that have the capability of sensing,
processing, and communicating components. Wireless
sensor networks are expected to serve as a key infra-
structure for a broad range of applications including (pre-
cision agriculture; surveillance highway systems, emer-
gent disaster response, military surveillance, search and
rescue, soldiers and vehicles tracking, avoiding traffic
conflicts, and so on). Energy savings and tracking accu-
racy have always been important issues in wireless sen-
sor networks (WSN). For example, in energy manage-
ment schemes, most of the sensors are sleep until they
are awakened by active sensor. While such a scheme
leads to controlling the energy consumptions in the target
monitoring phase, however, tracking accuracy cannot be
guaranteed. Prior work on tracking of moving targets fo-
cuses on enabling sensor nodes to cover the area [1] in
which the target moves, and coordinating sensor nodes in
the vicinity of the target and determines the target loca-
tion. As long as the target is within the sensing range of a
sensor, it can be detected. In this paper, we use ellipse
scheme because path of the target in the space is similar
to elliptic trace, we propose an approach to energy man-
agement scheme based on [2,3],in order to control the
power and taking into account the effects of signal atten-
uation due to fading and noise in order to enhance the
detection decision.
The rest of the paper is organized as follows. In Section
3, why we use ellipse scheme , we give a definition of
quality of monitoring (QoM), and the effect of target
movement on it with respect to likelihood ratio (Y) using
elliptical scheme. we then propose work in Section 4; (4-
1) tracking of the target by a duty sensor in ellipse, (4-2)
relay area medium scheme: that designates the duty sen-
sor to track the moving target and reduce energy in this
area and relay area focal handoff scheme: to insure exit
of the target from current elliptical area and enter to the
new duty sensor to monitor the target by the next duty
sensor, and in (4-3),relay area message, in (4-4),saving
power ratio using ellipse. We then propose our work in
Section 5, Network density and Coverage fraction perfor-
mance of random network .In Section 6, Decisions Fusion
of multiple sensor transmitted Over Fading Channels by
likelihood ratio .In Section 7, 8 our results &conclusions.
2 RELATED WORK
In [4], they used a sink node imparts radial location infor-
mation through a phased-array transmission of series of
beacons. Each individual sensor used the knowledge of
received beacons as well as information from neighbors
to continue partitioning current sectors and identifying
sub-sectors in which it resides and took routing in consid-
eration. However, they did not take QoM and handoff in
their calculations. Also in [5,6], several tracking schemes
are proposed wherein each sensors value is converted
reliably to one bit of information: whether the object was
moving towards or away from the sensor, these schemes
did not explicitly take into account the quality of the re-
ceived signals. In [1], the target tracking problem is ad-
dressed by taking into account both of the coverage and
the QoM but only in a circle scheme, but however, they
did not consider the handover and energy saving aspects.
In [7] had studied in the effect of target mobility model ,if
the speed of target is low ,the target can turn right or left
easily and does not have inertia in its movement. They
represent the mobility as circle and if the speed of target

Amr Lotfy Elewa M. is with the Department of Computers and


Systems, Electronics Research Institute, Egypt.
Osama M. El Ghandour is with helwan Engineering,
Communication and Electronics department, Helwan University.
W
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 71


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
is high , the target cant change its movement direction at
each instant , they represent the mobility as ellipse
scheme and not studied tracking ,QoM of the target In [8]
they choose the best sensor carrying information utility
about the target and they represent the information utility
as ellipse scheme and not studied tracking ,QoM of the
target , both [9,10] had studied joint sensing region to
determine the position of the target by ellipse scheme
using two ultrasonic sensors in each focal of ellipse and
not studied detection ,QoM of target beside did not saved
power. In [2,3] , they proposed managing and adjusting
transmission power by eight transmission power levels
according to the average RSSI and they did not study
tracking ,QoM of the target. No previous researches
worked by ellipse in target tracking using one sensor.
3 DETECTIONANDMONITORINGOF
MOVINGTARGET.
3.1 Why we use ellipse scheme for target tracking
1) The path of the target in the space is similar to ellipse
scheme,
2) If the speed of target is high, the target cant change
its movement direction at each instant , then the m
bility can represent as ellipse scheme and if the
speed is low ,the target can turn right or left easily
and does not have inertia in its movement., then the
mobility can represent as circle according to[7]
3) In medium area ellipse scheme both (P
f
, P
tively small, so we can save the power in this area
and increase the power in relay area according to
management of the transmission power levels
as[2,3]
4) Solve the disadvantage of circle scheme such that
(saving power, handover) by using power manag
ment scheme and Relay area focal handof
lipse scheme respectively
3.2 Tracking area in elliptical scheme.
We devise the area of tracking into what is called relay
area medium and relay area focal scheme respectively as
shown in fig.(1)

2b

D
f
d
1
d
2

2a 2D

Fig.(1) Relay medium, Relay focal area
b
a

Relay area
focal
handoff
Sensor
Relay area
medium
is high , the target cant change its movement direction at
y represent the mobility as ellipse
scheme and not studied tracking ,QoM of the target In [8]
they choose the best sensor carrying information utility
about the target and they represent the information utility
QoM of the
target , both [9,10] had studied joint sensing region to
determine the position of the target by ellipse scheme
using two ultrasonic sensors in each focal of ellipse and
not studied detection ,QoM of target beside did not saved
they proposed managing and adjusting
transmission power by eight transmission power levels
according to the average RSSI and they did not study
tracking ,QoM of the target. No previous researches
worked by ellipse in target tracking using one sensor.
THE
Why we use ellipse scheme for target tracking
The path of the target in the space is similar to ellipse
get cant change
its movement direction at each instant , then the mo-
bility can represent as ellipse scheme and if the
speed is low ,the target can turn right or left easily
and does not have inertia in its movement., then the
cle according to[7]
, P
m
) are rela-
power in this area
and increase the power in relay area according to
management of the transmission power levels
Solve the disadvantage of circle scheme such that
(saving power, handover) by using power manage-
area focal handoff in el-
We devise the area of tracking into what is called relay
area medium and relay area focal scheme respectively as



Relay medium, Relay focal area
Where: D=d
1
+d
2
= a , D
f
(distance between two focal
areas) = 2d
1
and a , b are major ,minor axis of ellipse
b =
1
2
((2a)
2
(B
I
)
2
)

=
1
2
((2B)
2
(2
In this case, we assume that r
s
= a, is the sensing range
and R
c
=1.1 r
s
to 2 r
s
is the communication range with
(
x-m.
a
)
2
+ (
y-n.
b
)
2
= 1 is the equation of ellipse,(m.,n.) is
position of sensor
3.3 QUALITY OF MONITORING METRIC
Let the false alarm probability, P
f
, be the probability of
making a positive assertion in the absence of a target,
and the missing probability, P
m
, the probability of decla
ing no target when there is one. Then, we define the
quality of monitoring and tracking in terms of the param
ters , QoM(,): P
f
, and P
m
. Now, a
cated at at a point (x, y) is said to be monitored if it can
be detected. According to Neyman Pearson (P
mizes at a given P
f
value). If a target is located at a given
point (x, y), the signal strength received by a sensor
located at (x,y) is,
a(x

, y

) =
a
0
d(targct ,scnsor)
m
[1],
Where d(.) denotes the Euclidean distance between two
points (target ,sensor), a
o
is the initial power of the signal
emitted by the target, and m is the attenuation factor
usually 2 m 4. Therefore,a(x

, y

) is the signal strength


that a sensor senses in the presence of a target by sen
ing the amplitude of the received signal, which attenuates
with proportion with the distance from the
fig.(1)
a (x

, y

) =
a
0
d
1
m
in medium area
a (x

, y

)=
a
0
d
2
m
in focal area
Based on equs (1, 2), we can establish the likelihood d
tection model in presence of signal attenuation and noise.
The task of determining the presence/absence of a target
is then to test the following two hypotheses H
H
0
: Y = n, with Y is the received signal and n:
N(0, ), is background noise, that is,
P (Y|H
0
) =
1
2
e
(-
Y
2
2
2
)

i.e., in the absence of a target, the received signal is
simply the background noise. On the other hand,
under H
1
: Y =a(x

, y

) + n,
P (Y|H
1
) =
1
2
e
(-
( Y - _a(x

,y

) )
2
2
2
)

Finally, the likelihood ratio is defined as,
(Y) =
P (Y|H
1
)
P (Y|H
0
)

<
>

Where is a threshold, which we can find from equs
(7,9) below. From equs (3, 4), the Likelihood ra
cle according to[7]
(distance between two focal
and a , b are major ,minor axis of ellipse ,
2u
1
)
2
).
= a, is the sensing range
is the communication range with
is the equation of ellipse,(m.,n.) is
METRIC
, be the probability of
assertion in the absence of a target,
, the probability of declar-
ing no target when there is one. Then, we define the
ty of monitoring and tracking in terms of the parame-
. Now, a target lo-
cated at at a point (x, y) is said to be monitored if it can
be detected. According to Neyman Pearson (P
m
is mini-
value). If a target is located at a given
point (x, y), the signal strength received by a sensor
d(.) denotes the Euclidean distance between two
is the initial power of the signal
emitted by the target, and m is the attenuation factor
is the signal strength
that a sensor senses in the presence of a target by sens-
ing the amplitude of the received signal, which attenuates
the distance from the target. From

in medium area (1)
(2)
(1, 2), we can establish the likelihood de-
attenuation and noise.
The task of determining the presence/absence of a target
is then to test the following two hypotheses H
0
, H
1
:
: Y = n, with Y is the received signal and n:

(3)
i.e., in the absence of a target, the received signal is
ly the background noise. On the other hand,
(4)
ld, which we can find from equs
s (3, 4), the Likelihood ratio is
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 72


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
(Y) =
P (Y|H
1
)
P (Y|H
0
)
=

1
2
c
(-
( Y - _a(x

,y

) )
2
2
2
)

1
2
c
(-
Y
2
2
2
)

<
>

(Y) = e
_
2Y_a(x

,y

)- a[x

,y

2
2
_

<
>
(5)
4 PROPOSED SCHEME.
4.1 Target tracking using the ellipse scheme
In order to establish the hypothesis testing system, a sen-
sor with received signal Y, makes its decision based on the
threshold, as follows,
P
f
= P (Y | H
o
) (6)
From equ (3), P
f
=
1
2
e
(-
Y
2
2
2
)

dY [21],
which gives, = Q
-1
() (7)
where: Q(x) =
1
2
e
(-
x
2
2
)

x
dx
Similarly, from equ (4), P
d
= P ( Y |H
1
) (1-) ,
P
d
= Q (
_a(x

,y

) (1-), since P
m
= (1 - P
d
)

(8)
= Q
-1
(1-) +a(x

, y

) [21] (9)
Using equs (7,9) we can find the thresholds required to
achieve a certain QoM (,), then fromequ (5)
L = ln (Y) = _
2Y_a(x

,y

)- a(x

,y

)
2
2
_ ln
<
>

L =
1
n
2
(Y a
a
2
) =
a
n
2
(Y
a
2
) ln
<
>
(10)
Where: a = a(x

, y

), is threshold. From equs (5, 7, 9),


if ( (Y) > ) , then decide that H
1
is true, while if ( (Y)
< ), then decide that H
0
is true. After some algebraic ma-
nipulations, we see that, in order for ( (Y) > ) to hold
true, the following condition must hold, fromequ (10)
if
Y
n
>
n
a
ln +
a
2n
decide that H
1
is true (11)

Y
n
<
n
a
ln +
a
2n
, decide that H
0
is true (12)
Now, we need to check whether or not QoM (, ) can be
met, that is, we need to derive Pr ( (Y) > | existence of
a target) and Pr ( (Y) < | the absence of targets).

QoM = P =Pr ( (Y) > |H
1
)
=
1
2
e
_-
(L-d

)
2
2
]
In( )
d

+
d

2
dL [25],
=
1
2
erf (
In ( )
d

2
) (13)
Where: erf (x) = error function =
1
2
e
_-
x
2
2
] x
0
ux . Now,
from equ (13), with |x| signifies the absolute value of x ,
P = QoM, m is the attenuation factor, d
*
=
a

as indicated
in fig.(2) and with a found from equ(1,2). We can write
P = _
1
2
+ crI__
In( )
d

-
d

2
_]
1
2
- crI[
In( )
d

-
d

if

In( )
d

_
d

2
_

In( )
d

<
d

_ (14)
The results from fig. (5) showed for both a
0
=150,200 mwatt
have same performance for QoM up to d
1
so we can use to
d
1
(in medium) the power a
0
=150 then we use the power
a
0
=200 in relay focal area by manage transmission power
levels as[2,3].With d
*
=
a

, therefore, a =
_
a
0
d
1
m
in relay
area medium of the elliptical then d
*
=

_
a
0
d
1
m

as equ.(15)
below, and a =
_
a
0
d
2
m
in relay area focal of the elliptical
then d
*
=

_
a
0
d
2
m

,and D
f
as the distance between the two
focal relay area, then as depicted in fig.(1) above ,
P = P
(medium)
+ P
(focal)
,
P
(medium)
=

1
2
+ crI

_
_In( )
_
a
0
d
1
m
-
_
a
0
d
1
m
2
_
_

1
2
- crI

_
_In( )
_
a
0
d
1
m
-
_
a
0
d
1
m
2
_
_

if

_
_In( )
_
a
0
d
1
m

_
_

_
_

_
a
0
d
1
m
2
_
_
_
_In( )
_
a
0
d
1
m

_
_
<
_
_

_
a
0
d
1
m
2
_
_

(15)
With a=
a
0
d
2
m
in focal area, d
*
=

_
a
0
d
2
m

then,
P
(focal)
=

1
2
+ crI

_
_In( )
_
a
0
d
2
m
-
_
a
0
d
2
m
2
_
_

1
2
- crI

_
_In( )
_
a
0
d
2
m
-
_
a
0
d
2
m
2
_
_

if

_
_In( )
_
a
0
d
2
m

_
_


_
_

_
a
0
d
2
m
2
_
_

_
_In( )
_
a
0
d
2
m

_
_

<
_
_

_
a
0
d
2
m
2
_
_

(16)
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 73


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
QoM
0
|n(q )
d

+
d

2
q
a

d
*
=
a

P(L|H
1
)
(
o

,1)
P(L|H0)
( 0 ,1)
Fig. (2) Hypothesis testing model
This model to represent LRT and show the quality of mon
toring QoM (,) regions as shown in fig.(2) where d* is the
distance between the two means of N(
a

, 1) under H
N(0,1) under H
0
and equal to
a

, then from equ


QoM (,) =
1
2
erf (
In ( )
d

2
)
4.2 Relay-Area Based Scheme

4.2.1 Relay medium area.

In medium area, we note that the target path is near to
sensor (minor axis of ellipse is small) and both (P
relatively small, therefore we can save the transmission
power in this medium area as fig.(3) and:
1) Continuously monitor the moving target to dete
mine the moving direction of the Target
2) Determine the end of position f
o
along the surface
of the ellipse, at which the target will leav
lipse as fig.(3)
3) Broadcast a relay message to inform candidate
duty sensors along the target moving direction [1],
when the target enter the relay focal area fig.(3)

D
d
1
d
2
R
c
Fig.(3) Candidate new sensor to track the moving target

New sensor

Sensor
Relay focal
area handoff
f
o
point
Relay
medium
L

and show the quality of moni-
where d* is the
under H
1
and
then from equ(13) ,

In medium area, we note that the target path is near to
sensor (minor axis of ellipse is small) and both (P
f
, P
m
) are
we can save the transmission
Continuously monitor the moving target to deter-
along the surface
of the ellipse, at which the target will leave the el-
Broadcast a relay message to inform candidate
duty sensors along the target moving direction [1],
when the target enter the relay focal area fig.(3)
moving target
4.2.2 Relay focal area based handoff
When target approach the focal area of (start of region d
in fig. (1,3), the sensor broadcasts relay message to inform
candidate sensors along the target moving direction, during
relay area focal handoff and before the target approaches
to the point f
o
as above fig.(3), the current sensor broa
casts relay message and waits for response (focal area
handoff), when it receives the reply message from other
new sensor within the focal area and before the target
reach to the point f
o
, the current sensor leaves the target to
the new sensor even if the target has not reached to the
end point f
o
. In order to save power consumption, it sends
the full table about the target (all data of moving target with
time) to the new sensor and the new sensor becomes the
next duty sensor and it starts tracking the path of the target
4.3 The relay area message
When the Target enter the relay area focal (start of region
d
2
), before arriving to the point f
o
as above fig.(3),the duty
sensor solves the handoff problem by broadcasting relay
area message and waiting the response during this focal
area to choose which sensor should become the next duty
sensor while the target is moving, and the duty sensor s
lects the best next sensor which has information about pr
dicted position of the target [8], and the nearest to the ta
get than the other.
The relay area message contains:
1) The direction of the target ,(expressed in the slope
of the moving line with respect to a reference
agreed upon by all the sensors),
2) The position f
o
based on x,y coordinates
3) Which of the next sensor will be selected within
the transmission range R
c
4) Range of velocity (V
max
, V
min
). [7]
4.4 Saving the power ratio.
By devising the area of tracking into what is called relay
area medium and relay area focal scheme respectively,
and by changing transmitted power level
area related to the position of target from sensor in ellipse
scheme. In our results, the consumed power ratio in ellipse
=[(
150 mW
200 mW
*
2.2 mctcr
6 mctcr
)
medium
+(
3.8 m
6 m
)
focal
] = 0.908 ,
saved the power in ellipse scheme approximately 9.16%
than circle scheme or the consumed power in ellipse
scheme less than in circle scheme approximately an
amount of 9.2% .
5 COVERAGE NETWORK PERFORMANCE
USINGNSENSORS

focal area based handoff
When target approach the focal area of (start of region d
2
)
message to inform
candidate sensors along the target moving direction, during
relay area focal handoff and before the target approaches
as above fig.(3), the current sensor broad-
casts relay message and waits for response (focal area
), when it receives the reply message from other
new sensor within the focal area and before the target
, the current sensor leaves the target to
the new sensor even if the target has not reached to the
ower consumption, it sends
the full table about the target (all data of moving target with
time) to the new sensor and the new sensor becomes the
next duty sensor and it starts tracking the path of the target
nter the relay area focal (start of region
as above fig.(3),the duty
sensor solves the handoff problem by broadcasting relay
area message and waiting the response during this focal
ome the next duty
sensor while the target is moving, and the duty sensor se-
lects the best next sensor which has information about pre-
dicted position of the target [8], and the nearest to the tar-
The direction of the target ,(expressed in the slope
of the moving line with respect to a reference
based on x,y coordinates
Which of the next sensor will be selected within
y devising the area of tracking into what is called relay
area medium and relay area focal scheme respectively,
and by changing transmitted power level as[2,3] in focal
position of target from sensor in ellipse
scheme. In our results, the consumed power ratio in ellipse
] = 0.908 , so we
saved the power in ellipse scheme approximately 9.16%
r the consumed power in ellipse
scheme less than in circle scheme approximately an
PERFORMANCE
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 74


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
5.1 Average sensor network density.
=
N
( ab)
in ellipse and =
N
(r
2
)
in circle, (17)
Where: a, b are major and minor axes of ellipse
5.2 Coverage fraction
We assume that N sensor are deployed randomly in area
A, with sensing range a .Then, P
d
is the probability any
event will be detected by any sensor if it is within sensing
range a of the sensor, the event will be undetected by this
sensor is equal to P
m
= (1-P
d
). Then, the probability that the
event will not be detected by N sensors in area A is P
m|N
=
(1-P
d
)
N
. The probability that the event will be detected by
at least one sensor from N sensor is equal to the coverage
fraction C =1- (1-P
d
)
N
, We approximate (1-P
d
)
N
to e
-(NP
d
)

[22], note that P
d
=QoM(, ) then in case of
5.2.1 Deterministic Boolean sensing model
The probability of sensing model is P
d
=
_
1 , u < o
u , B > o

.[24]
Where, D is Euclidian distance , a is sensing range of
sensor , P
d
is probability of detection related to distance
and N=ab, from equation(17), finally: the coverage
fraction is C = 1 = 1 , (18)
Where: ab = area of ellipse , P
d
=1, is sensor network
density and a, b are major and minor axes of ellipse
5.2.2 over all detection in Probabilistic model
Over all detection probability at a point in area A are equal
to the product of the individual detection probabilities of all
sensors receiving the event occurring at that point [22,31].
Thus the over all detection probability C
t
of a point in area
A is

C
t
= 1 - P
d
) (19)

6 DETECTION OF TARGET VIA FADING
USINGNSENSORS.
In the following work as shown in fig.(4), we took in account
the detection in the presence of multiple N sensors and
fading parameter, where each local sensor sense the target
with received signal strength S , and the local decision are
transmitted via fading and noisy channel to a fusion center.
The fusion center makes global (final) decision to decide
which local decision related to detection based on S is
more likely to be true.

S
i
* X
i
+ Y
i

u
i
=(+1,-1)
Local decision

R (Fading) n (noise)
Model (A): Detection of target (Reflected signal from target) ,
make local decision
U
i
=(+1,-1)
u
1

.

X
i
+

Y
i
U global decision


u
N


R(Fading) n (noise)
Model (B): Transmit this local decision to fusion center

Fig. (4) Multi-Sensor detection models
We focus on our work, the relation between sensor and
target as shown in model (A):
Where : N is the number of sensors ,we collect observa-
tions under specific hypothesis from N local sensors, as-
sume that the observations are independent. n is additive
White Gaussian Noise (AWGN) ,from equs(1,2)
S=a(x,y)= [1] in medium elliptical scheme,
S=a(x,y)= in focal elliptical scheme , assume slow-flat
fading channels with constant gain R between local sen-
sors and the target[18]. This assumption is reasonable be-
cause most local sensor operates at short range (hence
small delay spread) and low bit rate, due to power limited.
[20], the gain of the fading channel R is considered as a
possibly unknown so put constant during the transmission.
f(R) is Pdf of Rayleigh fading = 2R :R with unit
power E[ [18,20], R is the gain and multiplicative
with S, from fig. (4) R = = then f(R)=
Y = = then,
P(Y|H
0
) = (20)
P(Y|H
1
) = [18]
: assume that R is independent with H
1
P(Y|H
1
) = f(R) dR
Where : = , dR= , P
d
= P(Y|H
1
)
P
d
t
, P
I
t
sensor1
sensor2
..
sensor N
Target
(object)
Fusion
center
Transmitted signal
P
d
t
, P
I
t
sensor1
sensor2
..
sensor N
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 75


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
P
d
=P(Y|H
1
)= under fading
P
d
= [1+ (baY) Q(-abY)] (21)
(Proof in Appendix 1) Where: b = ,
likelihood ratio= (Y) =
= [1+ (baY) Q(-abY)] (22)
7 RESULTS
In this section, the performance of the proposed scheme
are validated analytical under the following parameters
settings: the attenuation factor, m = 2, QoM (, ) is such
that = = 0.05 with initial power, a
0
=150 mwatt in me-
dium area (region of d
1
). On the other hand, a
0
is set to 200
mwatt and = = 0.05 in relay focal area (region of d
2
).
The variance of the white noise is set to be = 1.
Fig. (5): QoM with distance
As shown in fig. (5) , and from equs (15,16),when the dis-
tance increases QoM decreases and to increase QoM, we
need to increase power and however comparing our results
with [1], we showed better behaviour performance in sav-
ing power and QoM, because we divided the sensing range
d to d
1
,d
2
and changing power to a
0
=150 mWatt,a
0
=200
mwatt in medium ,focal area respectively where from fig.(5)
showed for both a
0
=150,200 mwatt have same perfor-
mance for QoM up to d
1
(medium region) so we can use
a
0
=150 mwatt to d
1
,then use a
0
=200 mwatt to d
2
. Also our
results showed that we saved power approximately 9.16%
than circle, with P
f
, P
m
are small relatively in medium area
than circle, besides solved handoff problem in focal area d
2
by sending broadcast relay message when target enter this
area.
Fig. (6): QoM with distance at changing both of P
f
, P
m
Fig. (6); discuses QoM with distance ,in case of fixing P
f
and varying P
m
, and vice versa ,the results shows when
decreasing P
m
,QoM is decreasing, on the other hand
varying P
f
,QoM slightly changes and can be ignored. And
from the curves of QoM varying P
f
,P
m
lead to varying the
threshold then QoM respectively as seen from equs
(7,9,15,16).
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 76


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
Fig.(7): Relation between QoM with distance in case of
two sensor
Fig.(8 ) : Relation between QoM with distance in case of
Boolean deterministic model and Probabilistic fading
model.
Fig. (9): Coverage fraction percentage with sensing range
of ellipse
The probability that the event will be detected by at least
one sensor from N sensor is equal to the coverage frac-
tion .from fig. (7,8,9) shows the relation between the cov-
erage fraction and sensing range of ellipse from the equs
(18, 19).From above fig.(9), the over all QoM for two sen-
sors improve QoM than one sensor in case of Boolean
deterministic model, probabilistic of fading model. Where:
overall QoM=[1 (1-QoM1
sensor1
)(1-QoM2
sensor2
)] in case
of two sensor.
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 77


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
Fig. (10) :ROC(Receiver Operating Characteristics)
Fig. (10) is the relation between the probability of false
and theprobability of detection in the presence of fading
as given in equ (21) which is called ROC(Receiver Oper-
ating Characteristics).
Fig. (11): Probability of detection with S/N ratio
Fig.(11) shows that the relation between probability of
detection and S/N ratio in presence of fading from equ
(21), by comparing our work with [19],at different S/N ratio
values, our proposed scheme provide better results in
terms of the probability of detection of the target. By using
ellipse scheme rather than circle scheme.
8 END SECTIONS
8.1 CONCLUSION
We proposed a new target tracking method by using ellip-
tical scheme to solve the target problem by taking into
account the path of the target, coverage area, the quality
of monitoring QoM, handover and conserving power.
In this paper we introduced the elliptical scheme and a
new devised relay based area that devised the coverage
area into: (1) - Relay area medium scheme that contain
the duty sensor in the center of ellipse (2) - Relay area
focal scheme to solve the handoff problem, and finally we
where able to save the power in ellipse scheme approx-
imately by an amount of 9.16% compared to circle
scheme. QoM is one of the parameters used in monitoring
a target besides coverage area. The probability of report-
ing inaccurate monitoring information such as P
f
, P
m
should be as small as possible, even in the presence of
noise, signal attenuation and fading in one and multiple
sensor. Our work results showed an improvement in the
QoM & solved the problem of handoff and saved power
compared to the previous work.
8.2 Appendix 1
P
d
=P(Y|H
1
) = f(R) dR
Where R= ,f(R) =2R ,a=a(x,y), dR=
P
d
=P(Y|H
1
)= d [18]

= .dX
= dX [20]
Put t = , d =
= .d

P
d
= [1+ (baY) Q(-abY)] [20]
.

Where: b = , Q(x) =1-Q(-x) , P(Y|H
0
)=
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 78


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
(Y) = =
= [1+ (baY) Q(-abY)]
8.3 ACKNOWLEDGMENT
The Authors would like to thank anonymous Reviewers
for their valuable comments and suggestions that improve
the presentation of these papers.
8.4 REFERENCES
[1] Guanghui He and Jennifer C. Hou, Tracking Targets with
Quality in Wireless Sensor Networks, 2005 IEEE
[2] JANG-PING SHEU, KUN-YING HSIEH AND YAO-KUN
CHENG , Distributed Transmission Power Control Algo-
rithm for Wireless Sensor Networks, Journal of Informa-
tion Science and Engineering 25, 1447-1463 (2009)
[3] Shan Lin, Jingbin Zhang, Gang Zhou, Lin Gu, Tian He,
and John A. Stankovic , ATPC: Adaptive Transmission
Power Control for Wireless Sensor Networks
,SenSys06,November 13, 2006, Boulder, Colorado,
USA.Copyright 2006 ACM
[4] Hui Qu , Stephen B. Wicker,Co-designed anchor-free lo-
calization and location based routing algorithm for rapidly-
deployed wireless sensor networks, Information Fusion 9
(2008), Elsevier
[5] J. Aslam, Z. Bulter, V. Crespi, G. Cybenko, and D. Rus.,
Tracking a moving object with a binary sensor network,. In
ACM International Conference on Embedded Networked
Sensor Systems(SenSys), 2003
[6] K. Mechitov, S. Sundresh, Y. Kwon, and G. Agha., Coop-
erative tracking with binary-detection sensor networks,
Technical Report, 2003
[7] Elham Ahmadi,New Adaptive Method for Target Tracking
in Wireless Sensor Networks, International Journal of
Computer Applications (0975 8887),Volume 22, No.9,
May 2011
[8] Wei Zhao,Ying Han,Weighted distance based sensor se-
lection for target tracking using wireless sensor net-
work,IEEE signal processing letters, Vol.16,No.8, August
2009
[9] G.Suresh Kumar, V.Rajamani, V.Rajamani, Energy effi-
cient Multi-Target Tracking in Wireless Sensor Networks
with accuracy,National Conference on Advances in Com-
puter Science and, Applications with International Journal
of Computer Applications (NCACSA 2012)
[10] Wendong Xiao and Chen Khong Tham, Sajal K. Das, Col-
laborative Sensing to Improve Information Quality for Tar-
get Tracking in Wireless Sensor Networks, 2010 IEEE
[11] H. Zhang and J. C. Hou, Maintaining sensing coverage
and connectivity in large sensor networks, Wireless Ad
Hoc and Sensor Networks: An International Journal, Vol. 1,
No. 1, January 2005
[12] W. Zhang and G. Cao., DCTC: Dynamic convoy tree-
based collaboration for target tracking in sensor networks,
IEEE Trans. on Wireless Communications, 2004
[13] W. Zhang and G. Cao. ,Optimizing tree reconfiguration for
mobile target tracking in sensor networks, IEEE INFO-
COM, 2004
[14] F. Zhao, J. Shin, and J. Reich, Information-driven dynamic
sensor collaboration for tracking applications, IEEE Signal
Processing Magazine, March 2002
[15] Xuewen Wu, Guan Huang,A Novel Adaptive Target Track-
ing Algorithm in Wireless Sensor Networks, ICICIS 2011,
Part II, CCIS 135, pp. 477486, 2011, Springer-Verlag
Berlin Heidelberg 2011
[16] Guillermo Molina, Enrique Alba, Location Discovery in
Wireless Sensor Networks Using Metaheuristics, Applied
Soft Computing Journal 2008, Elsevier
[17] Liang Xue1, Zhixin Liu1, and Xinping Guan, Prediction-
based protocol for mobile target tracking in wireless sen-
sor networks, Journal of Systems Engineering and Elec-
tronics Vol. 22, No. 2, April 2011, pp.347352
[18] Wei-Ho Chung and Kung Yao, Decision Fusion in Sensor
Networks for Spectrum Sensing based on Likelihood Ratio
Tests , Advanced Signal Processing Algorithms, Architec-
tures, and Implementations XVIII, edited by Franklin T.
Luk, Proc. of SPIE Vol. 7074, 70740H, 2008
[19] Gongbo Zhou , Zhencai Zhu, Guangzhu Chen, Lijuan
Zhou, Decision fusion rules based on multi-bit knowledge
of local sensors in wireless sensor networks,, Information
Fusion 12 (2011) 187193, Elsevier
[20] Ruixin Niu, Member, Biao Chen, and Pramod K.Varshney
Fusion of Decisions Transmitted Over Rayleigh Fading
Channels in Wireless Sensor Networks, IEEE Transac-
tions on Signal Processing, vol. 54, NO. 3, march2006
[21] Guoliang Xing, Rui Tan; Benyuan Liu, Jianping Wang,
Xiaohua Jia, Chih-Wei Yi,Data Fusion Improves the Cov-
erage of Wireless Sensor Networks,MobiCom09, Sep-
tember 2025,2009, Beijing, China.
[22] Ashraf Hossain, P. K. Biswas; S. Chakrabarti," Sensing
Models and Its Impact on NetworkCoverage in Wireless
Sensor Network", 2008 IEEE Region 10 Colloquium and
the Third ICIIS, Kharagpur, INDIA December 8-10.447
[23] Qiang ,Le Lance M. Kaplan , Multi Target Tracking Using
Proximity Sensors, Science direct ,research was spon-
sored by the Army Research Laboratory andwas accom-
plished under Cooperative Agreement Number W911NF-
09-2-0041
[24] Ilker Demirkol, Cem Ersoy,Fatih Alag,Hakan Deli, The
impact of a realistic packet traffic model on the perfor-
mance of surveillance wireless sensor networks, Com-
puter Networks 53 (2009) 382399,ScienceDirect
[25] harry L. VanTrees, John wiley,sons, Detection, Estimation
and Modulation theory, copy right, 1968 Part1.,simple Bi-
nary hypothesis
[26] Jeongkeun Lee, Kideok Cho,Distributed and energy-
efficient target localization and tracking in wireless sensor
networks, Computer Communications 29, 2006 Elsevier
[27] M. Chu, H. Haussecker, and F. Zhao, Scalable informa-
tion driven sensor querying and routing for ad hoc hetero-
geneous sensor networks, International Journal on High
Performance Computing Applications16, 2002
[28] M. Amac Guvensan , A. Gokhan Yavuz, On coverage is-
sues in directional sensor networks: A survey , ADHOC
592 ,28 February 2011, 2011 Published by Elsevier
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 79


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617
[29] Yu-Chee Tseng, Sheng-Po Kuo, Hung-Wei Lee,Location
Tracking in a Wireless Sensor Network by Mobile Agents
and Its Data Fusion Strategies, 2003 IEEE
[30] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill.,
Integrated coverage and connectivity configuration in wire-
less sensor networks,. In ACM Sensys03, Nov., 2003
[31] Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha. Probabilis-
tic Coverage in Wireless Sensor Networks, Proceedings
of the IEEE Conference on Local Computer Networks 30th
Anniversary LCN05, 2005 IEEE
Amr Lotfy Elewa M. received the B.Sc degree in electronics and
communications from helwan Faculty of Engineering, helwan Uni-
versity, in 2003. he is a Network Engineer at computers & systems
department, Electronics Research Institute since 2006.
Osama M. El Ghandour received the B.Sc degree from Helwan
university in 1982 and M.SC degree from polytechnic university ,
New York, in 1986, and D.SC degree from George Washington uni-
versity Washington D.C in 1990. Currently he is an Associate profes-
sor at Helwan university, cairo, Egypt, he conducted research in
theoretical limits in communication with practical constraints, infor-
mation-theoretical models for cellular mobile systems, combined
modulation and coding, resourse allocation management methods
for wireless systems, routing protocols in Mobile Ad-hoc systems.
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 8, AUGUST 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 80


2012 Journal of Computing Press, NY, USA, ISSN 2151-9617

Das könnte Ihnen auch gefallen