Professional Documents
Culture Documents
30thists 6thnast SidiAhmedGNSS PDF
30thists 6thnast SidiAhmedGNSS PDF
30thists 6thnast SidiAhmedGNSS PDF
net/publication/319683533
CITATIONS READS
0 66
3 authors, including:
Some of the authors of this publication are also working on these related projects:
RF-Communication Blackout Solutions for Deep Space Probe Reentry View project
All content following this page was uploaded by Sidi Ahmed Bendoukha on 13 September 2017.
This paper presents a new location determination in an indoor environment is a contest that appearances the wireless
communication. The concept of indoor cooperative positioning was established in order to provide the user’s location inside
buildings or laboratories during a necessity where Global Navigation Satellite System (GNSS) facilities are not effective for
localization techniques. In general, localization techniques utilize metrics of the received radio signals. Some traditional
localization techniques include Received Signal Strength (RSS) model and Time Of Arrival (TOA) model for tracking and
for a partial synchronized wireless sensor network as RFID (Radio Frequency Identification) or WSN (Wireless Sensor
Network). By involvement GNSS data and terrestrial ranging data, the proposed idea by using appropriate algorithms, like
Extended Kalman Filter, and Particles Filter enhances the localization accuracy and estimate the range position.
1
2. Localization Techniques and Measurements Models zero and the different sensor receivers at time 𝑡𝑙 , the TOAs and
we have a simple relationship between 𝑡𝑙 and dl .
Illustrates the functional block diagram of a positioning 𝑡𝑙 = dl /c , l = 1,2,3,…….L (3.)
system. The main elements of the system are a number of In practice, TOAs are subject to measurement errors.as a result,
location sensing devices that measure metrics related to the the range measurement defined such as:
relative position of a mobile terminal or mobile node with
respect to a known reference point that define in the second part r 𝑇𝑂𝐴 = dl + n 𝑇𝑂𝐴 = √(𝑥 − 𝑥𝑖 )2 − (𝑦 − 𝑦𝑖 )2 + n 𝑇𝑂𝐴 (4.)
of paper: n 𝑇𝑂𝐴 is the range error in range measurement r 𝑇𝑂𝐴 , which
result from TOA disturbance.
We can define this equation (r 𝑇𝑂𝐴 ) by vector as:
r 𝑇𝑂𝐴 = f 𝑇𝑂𝐴 (x) + n 𝑇𝑂𝐴 (5.)
Where:
r 𝑇𝑂𝐴 = [r 𝑇𝑂𝐴,1 , r 𝑇𝑂𝐴,2 , … … … … … r 𝑇𝑂𝐴,𝑙 ] 𝑻
n 𝑇𝑂𝐴 = [n 𝑇𝑂𝐴,1 , n 𝑇𝑂𝐴,2 , … … … … … n 𝑇𝑂𝐴,𝑙 ] 𝑻
Fig. 1. Basic elements of a wireless positioning system and
√(𝑥 − 𝑥1 )2 − (𝑦 − 𝑦1 )2
The TOA, RSS signal models and their basic positioning
principles are presented in this section. In fact all the models f 𝑇𝑂𝐴 (x) = dl = [ √(𝑥 − 𝑥2 )2 − (𝑦 − 2)2 ] (6.)
can be generalized as: √(𝑥 − 𝑥𝐿 )2 − (𝑦 − 𝑦𝐿 )2
r= f(x) + n (1.) The function f 𝑇𝑂𝐴 (x) represent the known function related
by (x) that presents the noise free distance vector. The source
2.1. Method TOA (Time Of Arrival) localization problem based on TOA measurements is to
estimate (x) given(r 𝑇𝑂𝐴 ).To define the algorithm that n 𝑇𝑂𝐴
TOA is the one way propagation time of the signal traveling
development and analysis as well as the CLRB which is Cramer
between a source and receiver. This implies that the target (RFID)
Rao Lower Bound on the variance attainable by any unbiased
and all receivers are required to be precisely synchronized to obtain
location) computation it is assumed that:
the TOA information, although such synchronization is not needed
n 𝑇𝑂𝐴 (0, 𝜎 2 𝑇𝑂𝐴 ) Gaussian processes, the zero mean value
if the round trip or two ways TOA is measured. Multiplying
indicates LOS transmission (Line Of Sight); we can define the
TOAs by the known propagation speed. In the absence of
probability density with respect the function f 𝑇𝑂𝐴 (x):
measurement error, each TOA corresponds to a circle centered at a 1 1
receiver on which the source must lie in the 2D space, p 𝑇𝑂𝐴 (x) = exp [− (r 𝑇𝑂𝐴 − dl )2 ] (7.)
√2𝜋 𝜎 2 𝑇𝑂𝐴 2𝜎 2 𝑇𝑂𝐴
geometrically three or more circles deduced from the noise free
Which characterize by the mean dl and variance 𝜎 2 𝑇𝑂𝐴
TOAs will result in a unique intersection, which is the source
We can write: r 𝑇𝑂𝐴 (dl , 𝜎 2 𝑇𝑂𝐴 ), the probability density for
implying that at least three sensors are needed for 2D positioning.
(r 𝑇𝑂𝐴 ) defined by (p 𝑇𝑂𝐴 ) :
The two TOAs circles generally have two intersections 1 1 1
points, which correspond to two possible source locations. p 𝑇𝑂𝐴 (x) = exp[− (r 𝑇𝑂𝐴 − dl )𝑇 (r 𝑇𝑂𝐴 −
(2𝜋 )𝐿/2 |√C𝑇𝑂𝐴 | 2 C𝑇𝑂𝐴
Nevertheless, these circles may not interest or have multiple dl )] (8.)
intersections in the presence of disturbance,6-7) and hence it is Where C 𝑇𝑂𝐴 define the covariance matrix for r 𝑇𝑂𝐴 which
not an effective way to solve the problem using the circles correspond to:
directly. In fact with three or more receivers. It is more C 𝑇𝑂𝐴 = E[(r 𝑇𝑂𝐴 − dl )(r 𝑇𝑂𝐴 − dl )𝑇 ] = E[(n 𝑇𝑂𝐴 )(n 𝑇𝑂𝐴 )𝑇 ] (9.)
appropriate to convert the noisy TOAs into a set of circular To define probability more precise (equality) we use the
equation from which the source position can be determined assumption of uncorrelated n 𝑇𝑂𝐴 , we can directly write
according to an optimization criterion with the knowledge of
the sensors array. r 𝑇𝑂𝐴 = (dl , diag (𝜎 2 𝑇𝑂𝐴,1 , 𝜎 2 𝑇𝑂𝐴,2 , … )) (10.)
Mathematically, the TOA measurement model is formulated
as follow, let consider x = [𝑥 𝑦] 𝑇 be the unknown source 2.2. Method RSS (Received Signal Strength)
position and xi = [ 𝑥𝑙 𝑦𝑙 ] 𝑇 be the known coordinates of the
different sensors RSS is the average power received at a sensor where the
l = 1,2,3,…….L ,where L high than three, is the number of power is originated from the emitted source. It is frequently
receivers. assumed that the received power follow an exponential decay
The distance between the source position and sensor, defined model, which is a function of transmitted power .path loss
by equation: constant, and distance between sensor and source. This
positioning scheme is simpler than those using TOA or TDOA
d l = ⌈x − xl ⌉ = √(𝑥 − 𝑥𝑙 )2 − (𝑦 − 𝑦𝑙 )2 (2.)
(Time Difference Of Arrival) measurements synchronization
Without loss, we assume that the source emits a signal at time among the source and the sensors is not required. Once we are
2
able to obtain the distance from RSS measurements, the source In particular, Eq. (19) is the state transition equation, where
location can be determined as in TOA case with the use of three xk and xk−1 represent the state vector at the estimation time.
of receivers. The RSS measurement model is formulated as Function (f) is the transition function, usually non-linear, and
follow assuming that source transmitted power is Pl and in the mk is the process noise at time t k , modeled with a normal
absence of disturbance,1) the average power received at the distribution with zero mean and covariance matrix Q k . Eq. (20)
different sensors, defined by: is the observation equation, where zk is the measurement
Pl = k l Pl dl −𝛼 = k l Pl ⌈x − xl ⌉ −𝛼 (11.) vector at timet k , and (h) is the observation function which
Where k l account for all the factors that effect at the received relates the measurements, zk with the statexk .
power, including the antenna height and antenna gain. nk is measurement noise modeled with a normal distribution
𝛼 : path loss constant for propagation environment vary from with zero mean and covariance matrix R k
2 to 5 (free space equal two). The disturbance of RSS is
Logarithmic distribution; the lognormal path loss model can be EKF estimates the a posteriori state vector by using a loop
expressed as: (feedback) control approach. The current state is predicted to
Ln(Pr,l ) = Ln(k l ) + Ln(Pl ) - 𝛼Ln(dl ) + n𝑅𝑆𝑆,𝑙 (12.) produce the a priori estimate and then it is refined by using the
The n𝑅𝑆𝑆,𝑙 is Gaussian distributed, for simplicity, we assume feedback from the measurements. These two steps are also
that n𝑅𝑆𝑆,𝑙 are zero mean uncorrelated Gaussian processes known as predict phase1 and update phase2.
with variance 𝜎 2 𝑅𝑆𝑆 :
rRSS = Ln(Pr,l ) - Ln(k l ) - Ln(Pl ) (13.) Phase1: In this phase, the EKF provides an estimate of both
The RSS signal model is simplified to: the a priori state xk/k−1 and error covariance matrix Pk/k−1 . In
rRSS = n𝑅𝑆𝑆,𝑙 − 𝛼Ln(dl ) (14.) particular, the estimation is based on the previous a posteriori
The representation by vector: estimates of both the state x̂k−1/k−1 and the error covariance
r= f(x) + n , r𝑅𝑆𝑆 = f𝑅𝑆𝑆 (x) + n𝑅𝑆𝑆 matrix Pk−1/k−1 . In formulas, it consists of the following two
r𝑅𝑆𝑆 = [r𝑅𝑆𝑆,1 , r𝑅𝑆𝑆,2 , … … … … … r𝑅𝑆𝑆,𝑙 ] 𝑇 equations:
n𝑅𝑆𝑆 = [n𝑅𝑆𝑆,1 , n𝑅𝑆𝑆,2 , … … … … … n𝑅𝑆𝑆,𝑙 ] 𝑇
x̂k/k−1 = f (x̂k−1/k−1 , 0) = A x̂k−1/k−1 (21.)
𝐿𝑛 √(𝑥 − 𝑥1 )2 − (𝑦 − 𝑦1 )2
Pk = xk − x̂k = E[ek . ek T ] ,
f𝑅𝑆𝑆 (x) = Pl = −𝛼 [ 𝐿𝑛 √(𝑥 − 𝑥2 )2 − (𝑦 − 2)2 ] (15.)
𝐿𝑛 √(𝑥 − 𝑥𝐿 )2 − (𝑦 − 𝑦𝐿 )2 Pk/k−1 = Ak Pk−1/k−1 Ak T + Mk Q k Mk T (22.)
The source localization problem based on RSS measurements Where Ak ,Mk are Jacobian matrices of the transition function
is to estimate (x) given r𝑅𝑆𝑆 , we can define the probability (f) calculated at estimation time 𝐭 𝐤 .
density with respect the function f𝑅𝑆𝑆 (x) for r𝑅𝑆𝑆 denoted by
p𝑅𝑆𝑆 (x) is determined as: Phase2: During this procedure, EKF performs the feedback
1 1
)𝑇
1 control, where both the state vector and the error covariance
p𝑅𝑆𝑆 (x) = exp [− (r𝑅𝑆𝑆 − Pl (r𝑅𝑆𝑆 −
(2𝜋 )𝐿/2 |√C𝑅𝑆𝑆 | 2 C𝑅𝑆𝑆 matrix are updated using new measurements. First, the optimal
Pl )] (16.) Kalman gain K k and innovation vector yk are calculated as
follows:
C𝑅𝑆𝑆 = E[(r𝑅𝑆𝑆 − Pl )(r𝑅𝑆𝑆 − Pl )𝑇 ] = E[(n𝑅𝑆𝑆 )(n𝑅𝑆𝑆 )𝑇 ] (17.)
3
(24). In general, the EKF requires an initialization step where 4. Proposed Scenario
both the state vector ̂x0/0 and the error covariance matrix In this section, we define hybrid topology for the localization
P0/0 are initialized to x0 and P0 , respectively. After that, environment and the measurement model used, the
iterations can start according to the equations from Eq. (21) to software tool used is the MATLAB to define different functions
Eq. (24). to present our scenario, to estimate the position of mobile target
based on algorithm EKF, PFs presented in section 3 ,
3.2. Particles Filter (PFs) probability of model measurement and computation of RMSE
(Root Mean Square Error).
The PF is a category of Monte Carlo methods which also a
repetitive process, after initialization, it repeats importance 4.1. Description of Scenario
sampling step and resampling step as showing in Fig. 2:
We refer to a realistic positioning scenario that showing
RFID or WSN antennas on the ceiling of the laboratory
depicted in Figure, we proposed the scenario as size 20×20
meters, where A= 4 fixed RFID nodes (A0,A1,A2,A3) where
represent by small circle and mobile node deployed represent
by cross symbol. As it can be observed, RFID nodes are placed
according to a grid shape in order to maximize both positioning
accuracy and availability, while the mobiles target are placed in
each of the four main entrances and around the center or other
Fig. 2. A diagram of PFs process way of the environment (mobile node move in different place
as show in the Fig. 3.
After initialization, recursively estimates the probability
density of the state vector. The probability density is
approximated by a set of points called particles, and at each
particle xki (represented by a vector with the same size of the
state vector) during the importance sampling step, considering
the measurements at the moment; it assigns a weight wki to the
particles. There are several types of PFs and in our simulation
we focused on the Sequential Importance Resampling (SIR)
approach.
During the resampling step, the complete procedure of SIR
algorithm, where Ns is the number of particles and P equal 1 is
the prior density 8). The choice of the resampling depends on
the applications. Different resampling algorithms may provide
different performance. A good resampling algorithm should
generate new particles. The new state estimation is computed Fig. 3. Hybrid RFID topology on the ceiling
as function previous state vector and weight showing in Table
1. Usually it is calculated as the weighted average of all MATLAB function to define scenario (environment)
particles. [y(20m),x(20m)]
Table 1. Algorithm PFs function[sizeEnv,anchorCoord,mobileCoord,distMea]=
…………………………………….. scenario()
Initialization : set k = 0,{w0i }𝑁𝑠 i 𝑁𝑠
𝑖=1 = 1/ Ns ,generate {x 0 }𝑖=1
For k =1 : K begin iteration
For i =1 : Ns
p=1
Update particles : xki ~ p (xki / xk−1 i
)
Assign weight: 𝑤 ̌k = wk−1 p (zki / xk−1
i i i
)
End
For i =1 : Ns
Normalize weight wki = 𝑤 ̌ki ∑𝑁𝑠
𝑖=1 𝑤̌ki
End
Estimate a new state x̂k = ∑𝑁𝑠 i i
𝑖=1 x k wk
End ……………………………………………………………
4
dist = sqrt((x1 - x2) * (x1 - x2));
The mobile target, which we want to localize and track, move Where the zk is the range measurements at time t k from the
along different positions represented by different scenario. WSN anchors nodes, respectively. P is the probability density
Each mobile target is equipped with a WSN anchor node. On function of the WSN range error en (0, noiseStd),
one hand, the mobile target uses the WSN node to perform respectively, pik is the position component of the particle xki
random measurements with respect to its WSN neighbors.(in and dist (pik , piAn ) is calculated by the Euclidian matric
this case use just random WSN measurements distance
represent by zero mean value and standard deviation define before. If zk is not available, then the corresponding
(noiseStd) between the mobile node and RFID anchor node and value P is set to 1. The resampling algorithm is used to
RSS measurement, defined in the section 2. eliminate low weight particles and to concentrate on high
MATLAB function to define: weight particles. The main is to create new particles with
Gaussian distribution whose mean and variance are obtained
Measurements range (ďik,An ) = distance (dik,An ) + noise (en (0, from the input particles and their weights. The goal of this
noiseStd)) algorithm is the generation of new particles instead of repeating
noiseStd = 1/2; old ones.
distMea = zeros(1,numAnchors);
for i = 1:numAnchors MATLAB function for implementation the algorithm PFs to
distMea(i) = sqrt((anchorCoord(i,2:3)-mobileCoord)* estimate the position of mobile targets.
(anchorCoord(i,2:3)- mobileCoord)') + randn(1) * noiseStd;
end function estPos = PF_pos(anchorCoord,distMea,sizeEnv)
For the hybridization distance measurement (hybrid EKF), After to represent the description of scenario (environment)
we assume the following notations. At the estimation time t k , and define the two hybrid algorithms. Now we define the main
the coordinates of the mobile are pk = [ xk , yk ], the function to plot the figures of the estimate error position with
coordinates of WSN anchor nodes are pAn = [xAn , yAn ], for n different measurements and plot the probability of TOA/RSS
= 1, . . . numAnchors. Before define the function, we initialize defined in section 2 used the Eq. (7) and Eq. (16).
all the parameters as initial position (IniPos = [10,10]) and
define observation vector of measurement distance zk =
[ďik,A0 ,…. ďik,An ]. The observation function (h) depends on the
estimated distances between the mobile and anchors.
Consequentially, the Jacobian matrix is obtained by partly
differentiating the (h) function with respect to the vector state,
concerning the covariance matrix R 𝑘 , it is supposed
independent from time
5
Fig. 5. Estimate Position based on EKF and PFs for different
measurements (4 cases). We are really thankful because we achieved to complete this
project at Kyushu Institute of Technology specially for using
With different states or iterations of position of mobile node, some instruments as receiver GPS for calculating the pseudo-
for our simulation we plot the RMSE (error position between range and get the measurements to implement in the filter to
the true and estimate position) based on EKF, PFs changing the accurate the position. This work cannot be completed without
mobile target position with random measurements. the effort and co-operation from our groups. I would also thank
my professor Kei-ichi OKUYAMA form KIT and Prof,
Roberto Garello, Politecnico di Torino, Italy for help and
working in this project. I would like to express my gratitude to
the students and respondents for the support and willingness.
References
5. Conclusion
Acknowledgments