ttm2013990029s1 - IEEE Computer Society

advertisement
M.R.BASHEER ET AL.: LOCALIZATION AND TRACKING OF OBJECTS USING CROSS-CORRELATION OF SHADOW FADING NOISE
Appendix
Computing Area of Overlap between Ellipses
The overlapping area |𝑆12 | in (9) can be calculated by first
computing the point of intersection 𝑝𝑙 = (π‘₯𝑝𝑙 , 𝑦𝑝𝑙 ); 𝑙 ∈
{1,2,3,4} between elliptical regions 𝑆1 and 𝑆2 . Since the
maximum RSSI path detection delay τm is same for both
receivers, and the ellipses 𝑆1 and 𝑆2 share a common focus
at the transmitter, it can be easily shown that the number
of intersection points is only two. Let 𝑝1 = (π‘₯𝑝1 , 𝑦𝑝1 ) and
𝑝2 = (π‘₯𝑝2 , 𝑦𝑝2 ) be the point of intersection between 𝑆1 and
𝑆2 then to find 𝑝1 and 𝑝2 , simultaneously solve the implicit polynomial equations of ellipse 𝑆1 and 𝑆2 by eliminating one variable, for e.g. x, leading to a quartic equation in y. The intersection points are then the real solutions of this quartic equation. The generalized implicit
equation of an ellipse with semi-major and semi-minor
axis given by a i and bi , oriented at an angle Ο•i w.r.t x-axis
(𝑐π‘₯𝑖 , 𝑐𝑦𝑖 )
with
center
at
is
given
by
[(π‘₯−𝑐π‘₯𝑖 ) π‘π‘œπ‘  πœ™π‘– +(𝑦−𝑐𝑦𝑖 ) 𝑠𝑖𝑛 πœ™π‘– ]2
π‘Žπ‘–2
+
[−(π‘₯−𝑐π‘₯𝑖 ) 𝑠𝑖𝑛 πœ™π‘– +(𝑦−𝑐𝑦𝑖 ) π‘π‘œπ‘  πœ™π‘– ]2
𝑏𝑖2
=
1. For 𝑆1 , πœ™1 = 0 and (𝑐π‘₯1 , 𝑐𝑦1 ) = (0,0) while for ellipse
S2 ,
πœ™2 = πœ™ = π‘π‘œπ‘  −1 (
π‘Ÿ2
π‘Ÿ1 π‘Ÿ2
2
2
( π‘π‘œπ‘  πœ™ −
,
2
2
π‘Ÿ12 +π‘Ÿ22 −π‘Ÿ12
2π‘Ÿ1 π‘Ÿ2
(𝑐π‘₯2 , 𝑐𝑦2 ) =
)and
𝑠𝑖𝑛 πœ™). Subsequently, the area can be
computed from pl using Gauss-Green theorem as
1
πœ‹
|𝑆12 | = |𝑆1 | + |𝑆2 | − ∫0 [π‘₯1 (πœƒ1 )
2
1
2πœ‹
𝑑𝑦1 (πœƒ1 )
π‘‘πœƒ
− 𝑦1 (πœƒ1 )
− ∫πœ‹ [π‘₯2 (πœƒ2 )
2
where πœƒ1 =
ψ11 =
(πœ“12 −πœ“11 )
πœ‹
x
cos−1 ( ap1)
1
,
𝑑𝑦2 (πœƒ2 )
πœ“12 = π‘π‘œπ‘ 
π‘‘πœƒ
(πœ“22 −πœ“21)
πœ‹
−1
(
] π‘‘πœƒ
− 𝑦2 (πœƒ2 )
π‘‘πœƒ
πœƒ + πœ“11 , πœƒ2 =
𝑑π‘₯1 (πœƒ1 )
π‘₯𝑝1
π‘Ž1
𝑑π‘₯2 (πœƒ2 )
𝑏2 [(𝑦𝑝𝑙 −𝑐𝑦2 ) 𝑠𝑖𝑛(πœ™)+(π‘₯𝑝𝑙 −𝑐π‘₯2 ) π‘π‘œπ‘ (πœ™)]
) ,
πœ“21 =
)
πœ“22 =
π‘Ž2 [(𝑦𝑝2 −𝑐𝑦2 ) π‘π‘œπ‘ (πœ™)−(π‘₯𝑝2 −𝑐π‘₯2 ) 𝑠𝑖𝑛(πœ™)]
π‘‘π‘Žπ‘›−1 (
𝑏2 [(𝑦𝑝2 −𝑐𝑦2 ) 𝑠𝑖𝑛(πœ™)+(π‘₯𝑝2 −𝑐π‘₯2 ) π‘π‘œπ‘ (πœ™)]
π‘Ž1 π‘π‘œπ‘ (πœƒ1 ) −
(π‘₯𝑝1 +π‘₯𝑝2)
2
,
),
𝑦1 (πœƒ1 ) = 𝑏1 𝑠𝑖𝑛(πœƒ1 ) −
π‘Ž2 π‘π‘œπ‘ (πœ™) π‘π‘œπ‘ (πœƒ2 ) − 𝑏2 𝑠𝑖𝑛(πœ™) 𝑠𝑖𝑛(πœƒ2 ) + 𝑐π‘₯2 −
] π‘‘πœƒ
πœƒ + 2πœ“21 − πœ“22,
π‘Ž2 [(𝑦𝑝𝑙 −𝑐𝑦2 ) π‘π‘œπ‘ (πœ™)−(π‘₯𝑝𝑙 −𝑐π‘₯2 ) 𝑠𝑖𝑛(πœ™)]
π‘‘π‘Žπ‘›−1 (
π‘‘πœƒ
π‘₯1 (πœƒ1 ) =
(𝑦𝑝1 +𝑦𝑝2 )
2
,
π‘₯2 (πœƒ2 ) =
(π‘₯𝑝1+π‘₯𝑝2 )
and
2
𝑦2 (πœƒ2 ) = π‘Ž2 𝑠𝑖𝑛(πœ™) π‘π‘œπ‘ (πœƒ2 ) −𝑏2 π‘π‘œπ‘ (πœ™) 𝑠𝑖𝑛(πœƒ2 ) + 𝑐𝑦2 −
(𝑦𝑝1 +𝑦𝑝2 )
2
.
Proof of Theorem 1 (Shadow Fading Correlation Coefficient Between IEEE 802.15.4 Receivers)
Figure 2 shows the elliptical scatterer regions 𝑆1 and 𝑆2
surrounding receivers 𝑅1 and 𝑅2 respectively. Let the
number of obstacles in 𝑆1 and 𝑆2 at any communication
instance between the transmitter and receiver is given by
the Poisson distribution (2). If 𝛼𝑗𝑖 ; 𝑖 ∈ {1,2}, 𝑗 ∈
{1,2, β‹― , 𝑀(𝑆𝑖 )} represents the attenuation of a radio signal
reaching receiver R i due to jth obstacle in scatterer region
𝑆𝑖 , then the net reduction in signal strength (in dBm) due
𝑀(𝑆 )
to 𝑀(𝑆𝑖 ) obstacles in region 𝑆𝑖 is given by 𝑍𝑠𝑖 = ∑𝑗=1 𝑖 𝛼𝑗𝑖
𝑖
where 𝑍𝑆 is the signal strength attenuation due to shadow
fading. For log-normally distributed shadow fading noise
under stationary conditions, if 𝑀(𝑆𝑖 ) is given then 𝑍𝑆𝑖 is
normally distributed i.e. if μs and σ2s corresponds to the
mean and variance of 𝛼𝑗𝑖 , then 𝑓(𝑍𝑠𝑖 |𝑀(𝑆𝑖 )) =
𝑀(𝑆𝑖 )𝑁(πœ‡π‘  , πœŽπ‘ 2 ) where 𝑁(βˆ™) is the normal distribution PDF
1
with conditional mean and variance given by
𝐸[𝑍𝑠𝑖 |𝑀(𝑆𝑖 )] = πœ‡π‘  𝑀(𝑆𝑖 ) and π‘‰π‘Žπ‘Ÿ[𝑍𝑠𝑖 |𝑀(𝑆𝑖 )] = πœŽπ‘ 2 𝑀(𝑆𝑖 ) respectively.
The correlation coefficient between shadow fading
random variables 𝑍𝑠1 and 𝑍𝑠2 is given by
𝜌=
π‘π‘œπ‘£(𝑍𝑠1 ,𝑍𝑠2 )
√π‘‰π‘Žπ‘Ÿ(𝑍𝑠1 )π‘‰π‘Žπ‘Ÿ(𝑍𝑠2 )
(A1)
which require the derivation of π‘‰π‘Žπ‘Ÿ(𝑍𝑠𝑖 ) and π‘π‘œπ‘£(𝑍𝑠1 , 𝑍𝑠2 ).
Since 𝐸{𝑀(𝑆𝑖 )} = π‘‰π‘Žπ‘Ÿ{𝑀(𝑆𝑖 )} = πœ”|𝑆𝑖 |, π‘‰π‘Žπ‘Ÿ(𝑍𝑠𝑖 ) can be derived from law of total of variance as
π‘‰π‘Žπ‘Ÿ(𝑍𝑠𝑖 ) = π‘‰π‘Žπ‘Ÿ{𝐸[𝑍𝑠𝑖 |𝑀(𝑆𝑖 )]} + 𝐸{π‘‰π‘Žπ‘Ÿ[𝑍𝑠𝑖 |𝑀(𝑆𝑖 )]}
= π‘‰π‘Žπ‘Ÿ{𝑀(𝑆𝑖 )πœ‡π‘  } + 𝐸{𝑀(𝑆𝑖 )πœŽπ‘ 2 } = πœ”(πœ‡π‘ 2 + πœŽπ‘ 2 )|𝑆𝑖 | (A2)
whereas, π‘π‘œπ‘£(𝑍𝑠1 , 𝑍𝑠2 ) can be derived from the law of total
covariance as
π‘π‘œπ‘£(𝑍𝑠1 , 𝑍𝑠2 ) = π‘π‘œπ‘£{𝐸[𝑍𝑠1 |𝑀(𝑆1 )], 𝐸[𝑍𝑠2 |𝑀(𝑆2 )]}
+𝐸{π‘π‘œπ‘£[𝑍𝑠1 , 𝑋𝑠2 |𝑀(𝑆1 ), 𝑀(𝑆2 )]}.
(A3)
Since conditional mean is given by 𝐸[𝑍𝑠𝑖 |𝑀(𝑆𝑖 )] =
πœ‡π‘  𝑀(𝑆𝑖 ), the covariance of the conditional mean in (A2),
can be simplified as π‘π‘œπ‘£{𝐸[𝑍𝑠1 |𝑀(𝑆1 )], 𝐸[𝑍𝑠2 |𝑀(𝑆2 )]} =
πœ‡π‘ 2 π‘π‘œπ‘£[𝑀(𝑆1 ), 𝑀(𝑆2 )]. Since for a spatial Poisson processes,
random variables corresponding to the Poisson count for
disjoint areas are independent, the radio obstacle count
for Si can be written as the sum of two independent Poisson random variables by splitting the region 𝑆𝑖 into two
𝑐 )⋃𝑆
disjoint areas as 𝑆𝑖 = (𝑆𝑖 ⋂𝑆12
12 resulting in 𝑀(𝑆𝑖 ) =
𝑐 )⋃𝑆
𝑐 )
𝑀((𝑆𝑖 ⋂𝑆12
)
=
𝑀(𝑆
⋂𝑆
+
𝑀(𝑆
Let
𝐴𝑖 =
12
𝑖
12 ).
12
𝑐 )
𝑐 |)
𝑀(𝑆𝑖 ⋂𝑆12
and 𝐡 = 𝑀(𝑆12 ) then, 𝐴𝑖 ~π‘ƒπ‘œπ‘–π‘ π‘ π‘œπ‘›(πœ”|𝑆𝑖 ⋂𝑆12
and 𝐡~π‘ƒπ‘œπ‘–π‘ π‘ π‘œπ‘›(πœ”|𝑆12 |) resulting in π‘π‘œπ‘£[𝑀(𝑆1 ), 𝑀(𝑆2 )] =
π‘π‘œπ‘£(𝐴1 + 𝐡, 𝐴2 + 𝐡) = π‘‰π‘Žπ‘Ÿ(𝐡) = πœ”|𝑆12 |. Therefore, the
covariance of conditional mean in (A3) is given by
π‘π‘œπ‘£{𝐸[𝑍𝑠1 |𝑀(𝑆1 )], 𝐸[𝑍𝑠2 |𝑀(𝑆2 )]} = πœ‡π‘ 2 πœ”|𝑆12 |.
To compute the expectation of conditional covariance
𝐸{π‘π‘œπ‘£[𝑍𝑠1 , 𝑍𝑠2 |𝑀(𝑆1 ), 𝑀(𝑆2 )]} in (A3), we split the shadow
𝑀(𝑆 )
𝐴𝑖 +𝐡 𝑖
fading noise at each receiver as 𝑍𝑠𝑖 = ∑𝑗=1 𝑖 𝛼𝑗𝑖 = ∑𝑗=1
𝛼𝑗 =
𝐢𝑖 + 𝐷 where 𝐢𝑖 is the shadow fading attenuation due to
𝑐
region 𝑆𝑖 ⋂𝑆12
and 𝐷 is the shadow fading due to the overlapping region 𝑆12 . Therefore, the conditional mean is
given by 𝐸{π‘π‘œπ‘£[𝑍𝑠1 , 𝑍𝑠2 |𝑀(𝑆1 ), 𝑀(𝑆2 )]} = 𝐸{π‘π‘œπ‘£[𝐢1 + 𝐷, 𝐢2 +
𝐷|𝑀(𝑆1 ), 𝑀(𝑆2 )]} = 𝐸{π‘‰π‘Žπ‘Ÿ[𝐷|𝑀(𝑆12 )]} = πœŽπ‘ 2 πœ”|𝑆12 | resulting in (A3) being simplified as
π‘π‘œπ‘£(𝑍𝑠1 , 𝑍𝑠2 ) = πœ”(πœ‡π‘ 2 + πœŽπ‘ 2 )|𝑆12 |.
(A4)
Finally applying (A2) and (A4) on (A1) results in (9). β– 
Proof of Theorem 2 (Shadow Fading Cross-Correlation
Likelihood Function)
The cost function for the maximum likelihood estimate of
a parameter is the joint distribution of the multiple observations of a random variable when the value of the parameter is assumed to be known. For our application the
Cartesian coordinates of the transmitter is the parameter
to be estimated while the random variables that are being
observed are the shadow fading residuals at each receiver. Therefore, to derive the joint distribution of shadow
fading residuals from semi-parametric marginal CDF giv-
2
IEEE TRANSACTIONS ON MOBILE COMPUTING, MANUSCRIPT ID
en by (11) and pair-wise correlation coefficient given by
(9) we will use the elliptical copula function since the dependency between the shadow fading residuals that is
being modeled is the correlation coefficient which is a
linear dependency. In addition, t-copulas capture the linear dependency between extreme values of the random
variable [17]. Hence for 𝑀 receivers, the student-t copula
density with 𝜍 degree of freedom (DoF) and 𝑀 × π‘€ correlation coefficient matrix β„Ά is given by [17] as
π‘πœ,β„Ά (𝑒1 , 𝑒2 , … , 𝑒𝑀 ) =
(A5)
−1
∏𝑀
π‘˜=1 π‘“πœ (π‘‘πœ (π‘’π‘˜ ))
𝜍+𝑀
π‘“πœ,β„Ά (π‘₯1 , π‘₯2 , … , π‘₯𝑀 ) =
𝛀( 2 )
1
𝑀
𝜍
|𝛲|2 (πœπœ‹) 2 𝛀( )
2
[1 +
𝕩 = [π‘₯1 , π‘₯2 , … , π‘₯𝑀
π‘“πœ (π‘₯) =
𝜍
(𝜍+𝑀)
2
−
]
,
(𝜍+1)
π‘Ÿπ‘› = π‘Ÿπ‘›−1 √1 −
2π›₯π‘Ÿπ‘› π‘π‘œπ‘  πœƒπ‘›−1
π‘Ÿπ‘›−1
, and
̃𝑖 (𝑧𝑠𝑖 )
𝛀(βˆ™) is the Gamma function. Finally, setting 𝑒𝑖 = 𝐹
+[
written as |𝑆𝑛 | = |𝑆𝑛−1 | (1 −
𝛽𝑛−1 = √1 −
βn−1 rn−1
rm +rn−1
2π›₯π‘Ÿπ‘› π‘π‘œπ‘  πœƒπ‘›−1
π‘Ÿπ‘›−1
) √1 −
+[
π›₯π‘Ÿπ‘›
π‘Ÿπ‘›−1
βn−1 rn−1
rm +2rn−1
2 +2π‘Ÿ π‘Ÿ
πœ‹(π‘Ÿπ‘š +π‘Ÿπ‘› )√π‘Ÿπ‘š
π‘š 𝑛
4
. Since
2
] the area 𝑆𝑛 can be
𝛽𝑛−1 π‘Ÿπ‘›−1
π‘Ÿπ‘š +π‘Ÿπ‘›−1
) √1 −
π›₯π‘Ÿπ‘› 2
π‘Ÿπ‘›−1
] − 1.
2𝛽𝑛−1 π‘Ÿπ‘›−1
π‘Ÿπ‘š +2π‘Ÿπ‘›−1
Setting
where
γn−1 =
− 1 results in the elliptical area
for 𝑆𝑛 being represented by the area of 𝑆𝑛−1 as |Sn | =
|Sn−1 |(1 + γn−1 ). Therefore, (A6) can be written as Dα (n −
1 βˆ₯ n) = ω|Sn−1 |[(1 − α)γn−1 + 1]
k
− log {∑∞
k=0
[ω|Sn−1 |(1+γn−1 )(1−α) ]
k!
1
}. Since ∑∞
k=0 [ω|Sn−1 |(1 +
k!
k
− 2
𝛀( 2 )
π‘₯2
]
𝑣 [1 +
𝜍
√πœπœ‹π›€(2)
𝜍+1
]𝑇
𝕩𝑇 β„Ά−1 𝕩
and |𝑆𝑛 | =
4
(1 −
π‘“πœ,β„Ά (π‘‘πœ−1 (𝑒1 ),π‘‘πœ−1 (𝑒2 ),…,π‘‘πœ−1 (𝑒𝑀 ))
where 𝑒𝑖 ∈ [0,1] is the standard uniform random variable,
2 +2π‘Ÿ π‘Ÿ
πœ‹(π‘Ÿπ‘š +π‘Ÿπ‘›−1 )√π‘Ÿπ‘š
π‘š 𝑛−1
γn−1 )(1−α) ] = exp{ω|Sn−1 |(1 + γn−1 )(1−α) },
(1−α) k
[ω|Sn−1 |(1+γn−1 )
log {∑∞
k=0
k!
]
resulting
} = ω|Sn−1 |(1 + γn−1
)(1−α)
in
.
in (A5) gives the likelihood function for transmitter Hence, the 𝛼-divergence between RSSI values collected at
localization using shadow fading cross-correlation as time instants (𝑛 − 1) and 𝑛 is given by (13).
(12)
β– 
Proof of Theorem 3 (𝜢-Divergence of Shadow Fading
Residuals From An IEEE 802.15.4 Transmitter)
Figure A1 shows the tracking of an IEEE 802.15.4 mobile
transmitter by a stationary receiver. At each sampling
instance, receiver collects a sequence of 𝑁 RSSI values
from the transmitter. Assume that at time instant 𝑛 − 1 ,
the mobile transmitter is at position πœ‚π‘›−1 and in the subsequent instance 𝑛 , the receiver moved by radial distance
π›₯π‘Ÿπ‘› to reach location πœ‚π‘› . In addition, assume that during
this time period, the heading of the mobile transmitter
changed by π›₯πœ™π‘›−1 while the bearing between the mobile
transmitter and stationary receiver at the origin changed
by π›₯πœ“π‘›−1 .
Shadow fading noise at positions πœ‚π‘›−1 and πœ‚π‘› arise
from the movement of pedestrians or machinery within
elliptical fading region 𝑆𝑛−1 and 𝑆𝑛 respectively formed
between the transmitter and receiver. Therefore, the αdivergence between 𝑁 RSSI values collected at positions
πœ‚π‘›−1 and πœ‚π‘› can be derived by substituting the shadow
fading PDF given by (1) at positions πœ‚π‘›−1 and πœ‚π‘› in αdivergence equation (2) resulting in
𝐷𝛼 (𝑛 − 1 βˆ₯ 𝑛) =
∞
𝛼
1−𝛼
− π‘™π‘œπ‘”{∫−∞ ∑∞
𝑑π‘₯ }
π‘˜=0[𝑓(π‘₯|π‘˜)𝑓(π‘˜|𝑆𝑛−1 )] [𝑓(π‘₯|π‘˜)𝑓(π‘˜|𝑆𝑛 )]
∞
𝛼
1−𝛼
= − π‘™π‘œπ‘”{∫−∞ ∑∞
𝑑π‘₯}
π‘˜=0 𝑓(π‘₯|π‘˜)[𝑓(π‘˜|𝑆𝑛−1 )] [𝑓(π‘˜|𝑆𝑛 )]
∞
𝛼
1−𝛼
= − π‘™π‘œπ‘”{∑∞
∫−∞ 𝑓(π‘₯|π‘˜)𝑑π‘₯ }
π‘˜=0[𝑓(π‘˜|𝑆𝑛−1 )] [𝑓(π‘˜|𝑆𝑛 )]
𝛼
1−𝛼 }
= − π‘™π‘œπ‘”{∑∞
π‘˜=0[𝑓(π‘˜|𝑆𝑛−1 )] [𝑓(π‘˜|𝑆𝑛 )]
|𝑆𝑛 |
= πœ”(1 − 𝛼)|𝑆𝑛−1 | (|𝑆
𝑛−1 |
π‘™π‘œπ‘” {∑∞
π‘˜=0
− 1) −
𝑒π‘₯𝑝{−πœ”|𝑆𝑛−1 |}(πœ”|𝑆𝑛−1 |)π‘˜
π‘˜!
|𝑆𝑛|
(|𝑆
𝑛−1
)
|
(1−𝛼)π‘˜
}
(A6)
where |𝑆𝑛−1 | and |𝑆𝑛 | are the area for elliptical regions
𝑆𝑛−1 and 𝑆𝑛 respectively and are given by |𝑆𝑛−1 | =
Figure A1. Continuous tracking of a mobile receiver
Download