# Indoor Robot Localization Based on Multidimensional Scaling

Authors: Wei Cui; Chengdong Wu; Yunzhou Zhang; Bing Li; Wenyan Fu
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

In pertinence to the application of multidimensional scaling (MDS) methods in ranging-based positioning systems, an analysis is firstly conducted by the classical MDS algorithm. Modified MDS algorithm and subspace method are presented in localization application. We also depicted the unified framework and general solutions of MDS methods. However, the least square solutions under this framework are not optimal. Their performance is still related to selection of coordinate reference points. To address this problem, a minimum residual MDS algorithm based on particle swarm optimization (PSO) is proposed to derive a new solution for indoor robot localization under the unified framework. The result of analysis indicates that the performance of minimum residual MDS method is immune to selection of reference points. Furthermore, the localization accuracy for indoor robot has been enhanced by 41% as compared with the classical MDS algorithm.


---

## Body

## 1. Introduction

Location information is very significant in such scenarios as military affairs, industry, civil use, disaster relief, and so forth [1]. However, the widely used GPS system is hardly applicable to indoor environments. Wireless sensor network (WSN) has provided a new solution for accurate localization and tracking of indoor targets, but environmental interference and influence are prone to cause larger error of localization and tracking. Therefore, high-efficient algorithms are necessary to enhance localization accuracy of WSN.Existing algorithms in wireless sensor network localization can be broadly divided into two classes: range-based and range-free. The class of range-based algorithms is required to provide the accurate distance estimation between the target node and anchor node. Moreover, range-based algorithms require each sensor node to be equipped with more powerful CPU. There are several techniques to get the 4 distance estimation: received signal strength indicator (RSSI) [2], time of arrival (TOA), and time different of arrival (TDOA) [3]. The class of range-free algorithms can reduce the energy consumption and the demands for special hardware, but their accuracy is lower than the former one, such as APIT [4] and DV-Hop algorithms. In order to improve localization accuracy, the swarm intelligence algorithms [5] are applied by the researcher to node localization. However, these algorithms need a large number of anchor nodes. With regard to this, the literature [6] proposed the distributed localization algorithm. However, how to reduce localization errors has not been considered by the distributed localization algorithm. The distributed weighted combining scheme for cooperative spectrum sensing in cognitive radio networks was developed [7, 8]. This technique can incorporate specific weights according to different channel conditions and exhibits clear advantages with respect to channel fading, low PU transmission power, low false alarm rate, and the network size variation.In recent years, a lot of novel ideas and solutions have emerged for WSN localization. The localization technique based on multidimensional scaling (MDS), first proposed by Shang et al. [9], has offered a new idea for node localization. MDS method was widely applied in data analysis and data visualization in fields of physics, biology, geology, brain science, and social and psychological phenomenon research, as well as in pattern recognition, machine learning, and data mining, which are concerned with dimension reduction and feature extraction, and so forth [10–12]. Compared with previous localization algorithms, the MDS-based localization algorithms can simultaneously locate multiple nodes by utilizing the associated information among all nodes within the network. It can even get a diagram of relative positions among nodes while anchor nodes are unavailable. When absolute location is in need, fewer anchor nodes are required for this algorithm. Anchor nodes are also deployed without restriction. Recently, a variety of localization methods derived from classical MDS method have been applied in sensor network [13, 14] as well as cellular network [15]. The classical MDS method takes the mass centers of all nodes (including all anchor nodes and target nodes) as coordinate reference points. Thus, Cheung and So think it is inapplicable to wireless localization without prior information about the location of target nodes. Therefore, they propose a modified MDS method with mass centers of all anchor nodes as coordinate reference points [16]. At the same time, Wan et al. provide a subspace solution used for three-station positioning systems, with the locations of target nodes as coordinate reference points [17]. On this basis, So and Chan extend the subspace method to multistation positioning systems [18]. Chen et al. provide a unified framework of MDS method and its general solution for range-based localization, among which the above methods are several particular cases. In [19], a weighted MDS method under the unified framework has been obtained. However, according to the Gaussian Markov Theorem, all methods under this framework are not optimal. Their performance still depends on selection of coordinate reference points. Furthermore, although the weighted MDS method does not depend on selection of reference points, known environmental parameters, which are very difficult to obtain, are needed in the solving process.Against the flaws and defects of the above algorithms, this paper proposes a minimum residual MDS (MinRE MDS) algorithm under the unified framework. We also provide a unified solution with minimum residual to MDS algorithms, including the classical, the modified, and the subspace-based ones. With this framework, the result of analysis indicates that the performance of the minimum residual MDS method does not depend on selection of reference points. Therefore, it does not require environmental data and can enhance the localization accuracy greatly as compared with the classical MDS algorithm.


## 2. Application of MDS Algorithm in Localization Systems

Given the dimension of the target space, relative positions of all objects in the space can be determined by the classical MDS method. In order to determine the absolute position of target nodes, it is required to perform rotation and translation over the matrix of relative coordinates. In this paper, we conduct theoretical analysis of three important MDS-based localization methods, namely, the classical MDS algorithm, the modified MDS algorithm, and the subspace method.


### 2.1. Classical MDS

For range-based localization system, the target nodes (TN) whose positions are to be determined are located atx
∈
R
n. N anchor nodes (AN) with known positions are located at x
i
∈
R
n
,
i
=
1
,
…
,
N
(
N
≥
3
). Thus, a centralized coordinate matrix composed of the coordinates of TN and AN can be constructed:(1)
X
c
=
x
-
x
c
x
1
-
x
c
⋯
x
N
-
x
c
T
,where(2)
x
c
=
1
N
+
1
x
+
∑
i
=
1
N
x
iis mass-center coordinate. Real distance between the target node and the ith anchor node can be expressed as(3)
d
i
=
x
-
x
i
2
i
=
1
,
…
N
,while the distance between anchor nodes can be expressed as(4)
d
i
j
=
x
i
-
x
j
2
i
,
j
=
1
,
…
N
.Due to the existence of measurement noise, the distance between the target node and theith anchor node is usually expressed as (5)
r
i
=
d
i
+
η
i
,where η
i is the measurement noise as is usually supposed as Gaussian white noise under line-of-sight (LOS) settings.When the classical MDS method is applied for localization in this system, detailed procedures are as follows.Since the space encompassing the target is known, the dimensionn can be determined. n
=
2 corresponds to 2D localization, whereas n
=
3 corresponds to 3D localization. In this paper, we only focus on the application of MDS methods in 2D localization. When the information of distance measure is obtained, the matrix of distances can be constructed as follows: (6)
D
~
=
0
r
1
2
r
2
2
⋯
r
N
2
r
1
2
0
d
12
2
⋯
d
1
N
2
r
2
2
d
21
2
0
⋯
d
1
N
2
⋮
⋮
⋮
⋱
⋮
r
N
2
d
N
1
2
d
N
2
2
⋯
0
.Apply double central transformation to get(7)
B
~
c
=
-
1
2
J
D
~
J
T
,where(8)
J
=
I
N
+
1
-
1
N
+
1
1
N
+
1
1
N
+
1
T
,and I
N
+
1 is a N
+
1
×
N
+
1 identity matrix. Then, eigen decomposition is applied to B
~
c. Since n
=
2, let(9)
X
~
c
=
V
~
c
1
Λ
~
c
1
1
/
2
=
x
~
x
~
1
⋯
x
~
N
T
,where(10)
Λ
~
c
1
1
/
2
=
diag
λ
~
1
,
λ
~
2
,
V
~
c
1
=
v
~
1
⋯
v
~
2
.
λ
~
1
≥
λ
~
2
>
0 are two greatest positive eigenvalues of B
~
c; v
~
1
,
v
~
2 are orthogonal eigenvectors in correspondence to λ
~
1
,
λ
~
2. V
~
c
1 is actually a signal subspace of B
~
c.The coordinates obtained from Formula (9) are merely relative position of the nodes within the space. In order to obtain the absolute position of target node, transformation is required by making further use of the position information of anchor nodes. Without measurement error, there is such a relation between X
~
c and the centralized coordinate matrix X
c [20]:(11)
X
c
=
X
~
c
Ω
,where(12)
Ω
=
X
~
c
T
X
c
X
c
T
X
~
c
1
/
2
X
c
T
X
~
c
-
1is an orthogonal matrix, which has undergone rotation transformation with X
c as the center. Through the rotation transformation and translation, the position estimation of target node can be obtained as(13)
x
^
=
Ω
T
x
~
+
x
c
.Formula (12) reveals that the transformation matrix Ω is dependent on the centralized coordinate matrix X
c, which contains the unknown target node. Meanwhile, the center-of-mass coordinate x
c in (13) also contains the coordinate matrix of unknown target node. Therefore, it is bound to cause a larger error when applying the classical MDS method to estimate the target node’s position. For this problem, a modified MDS method applicable to mobile station localization was presented in literature [16].


### 2.2. Modified MDS

The modified MDS algorithm selects the mass centers of all anchor nodes as coordinate reference points, with respect to which the coordinate matrix composed of the target node and anchor nodes can be expressed as(14)
X
b
=
x
-
x
b
x
1
-
x
b
⋯
x
N
-
x
b
T
,where(15)
x
b
=
1
N
∑
i
=
1
N
x
i
.By separating the expression of the component in Formula (14) which is related to anchor nodes, we can get(16)
X
l
b
=
x
1
-
x
b
⋯
x
N
-
x
b
T
.Divide B
~
c in Formula (7) into(17)
B
~
c
=
B
11
b
T
b
B
~
1
,where B
11 is the first diagonal element of matrix B
~
c, b is an N
×
1 vector, and B
~
1 is an N
×
N matrix. Then, the following matrix can be constructed by Formulas (16) and (17):(18)
B
~
b
=
N
+
1
N
2
B
11
N
+
1
N
b
T
+
N
+
1
N
2
B
11
1
N
T
N
+
1
N
b
+
N
+
1
N
2
B
11
1
N
X
l
b
X
l
b
T
.It has been shown in [16] that without measuring error(19)
B
~
b
=
X
b
X
b
T
.In 2D localization, eigen decomposition is firstly applied to matrixB
~
b, which is constructed by Formula (18). Then, the coordinate matrix estimation X
~
b can be obtained according to Formula (9) and divided into (20)
X
~
b
=
x
~
X
~
l
b
T
.Thus, the transformation matrix with x
b as the center can be expressed as(21)
Ω
b
=
X
~
l
b
T
X
l
b
X
l
b
T
X
~
l
b
1
/
2
X
l
b
T
X
~
l
b
-
1
.Therefore, the estimated coordinate of the target node can be obtained as(22)
x
^
=
Ω
b
T
x
~
+
x
b
.


### 2.3. Subspace-Based MDS

Unlike the modified MDS method in which the mass centers of all anchor nodes are used as the coordinate reference points, the subspace-based MDS localization algorithm takes the coordinate of target node as the coordinate reference point. The corresponding coordinate matrix can be expressed as(23)
X
s
=
x
1
-
x
x
2
-
x
⋯
x
N
-
x
T
.Construct matrixB
~
s, in which the element at the ith row and jth column is(24)
B
~
s
i
j
=
1
2
r
i
2
+
r
j
2
-
d
i
j
2
.Apply eigen decomposition toB
~
s; we can get (25)
X
~
s
=
V
~
s
1
Λ
~
s
1
1
/
2
=
x
~
1
x
~
2
⋯
x
~
N
Tin 2D localization in the same way, where Λ
~
s
1 is the diagonal matrix composed of the two greatest positive eigenvalues of B
~
s and V
~
s
1 is the matrix composed of the eigenvectors in correspondence to both eigenvalues. Equally, a rotation transformation with the target node as the center exists between X
s and X
~
s; namely,(26)
X
s
≈
X
~
s
Ω
s
.
Ω
s is an unknown variable. Thus, the least square solution of (26) is(27)
Ω
s
=
X
~
s
T
X
~
s
-
1
X
~
s
T
X
s
.Substitute Formula (25) into the above expression; we can get(28)
Ω
s
=
Λ
~
s
1
1
/
2
V
~
s
1
T
X
s
.With Formulas (26) and (28), (29)
X
s
≈
V
~
s
1
V
~
s
1
T
X
ssince(30)
I
N
-
V
~
s
1
V
~
s
1
T
=
V
~
s
2
V
~
s
2
T
,where(31)
V
~
s
2
=
v
~
3
⋯
v
~
Nis the noise subspace of B
~
s and I
N is an N
×
N identity matrix. Substitute Formula (23) into (29) to get(32)
V
~
s
2
V
~
s
2
T
1
N
x
T
≈
V
~
s
2
V
~
s
2
T
x
1
⋯
x
N
T
.Thus, the least square solution to this equation can pinpoint the estimated position of the target node as(33)
x
^
=
x
1
⋯
x
N
V
~
s
2
V
~
s
2
T
1
N
1
N
T
V
~
s
2
V
~
s
2
T
1
N
.


## 2.1. Classical MDS

For range-based localization system, the target nodes (TN) whose positions are to be determined are located atx
∈
R
n. N anchor nodes (AN) with known positions are located at x
i
∈
R
n
,
i
=
1
,
…
,
N
(
N
≥
3
). Thus, a centralized coordinate matrix composed of the coordinates of TN and AN can be constructed:(1)
X
c
=
x
-
x
c
x
1
-
x
c
⋯
x
N
-
x
c
T
,where(2)
x
c
=
1
N
+
1
x
+
∑
i
=
1
N
x
iis mass-center coordinate. Real distance between the target node and the ith anchor node can be expressed as(3)
d
i
=
x
-
x
i
2
i
=
1
,
…
N
,while the distance between anchor nodes can be expressed as(4)
d
i
j
=
x
i
-
x
j
2
i
,
j
=
1
,
…
N
.Due to the existence of measurement noise, the distance between the target node and theith anchor node is usually expressed as (5)
r
i
=
d
i
+
η
i
,where η
i is the measurement noise as is usually supposed as Gaussian white noise under line-of-sight (LOS) settings.When the classical MDS method is applied for localization in this system, detailed procedures are as follows.Since the space encompassing the target is known, the dimensionn can be determined. n
=
2 corresponds to 2D localization, whereas n
=
3 corresponds to 3D localization. In this paper, we only focus on the application of MDS methods in 2D localization. When the information of distance measure is obtained, the matrix of distances can be constructed as follows: (6)
D
~
=
0
r
1
2
r
2
2
⋯
r
N
2
r
1
2
0
d
12
2
⋯
d
1
N
2
r
2
2
d
21
2
0
⋯
d
1
N
2
⋮
⋮
⋮
⋱
⋮
r
N
2
d
N
1
2
d
N
2
2
⋯
0
.Apply double central transformation to get(7)
B
~
c
=
-
1
2
J
D
~
J
T
,where(8)
J
=
I
N
+
1
-
1
N
+
1
1
N
+
1
1
N
+
1
T
,and I
N
+
1 is a N
+
1
×
N
+
1 identity matrix. Then, eigen decomposition is applied to B
~
c. Since n
=
2, let(9)
X
~
c
=
V
~
c
1
Λ
~
c
1
1
/
2
=
x
~
x
~
1
⋯
x
~
N
T
,where(10)
Λ
~
c
1
1
/
2
=
diag
λ
~
1
,
λ
~
2
,
V
~
c
1
=
v
~
1
⋯
v
~
2
.
λ
~
1
≥
λ
~
2
>
0 are two greatest positive eigenvalues of B
~
c; v
~
1
,
v
~
2 are orthogonal eigenvectors in correspondence to λ
~
1
,
λ
~
2. V
~
c
1 is actually a signal subspace of B
~
c.The coordinates obtained from Formula (9) are merely relative position of the nodes within the space. In order to obtain the absolute position of target node, transformation is required by making further use of the position information of anchor nodes. Without measurement error, there is such a relation between X
~
c and the centralized coordinate matrix X
c [20]:(11)
X
c
=
X
~
c
Ω
,where(12)
Ω
=
X
~
c
T
X
c
X
c
T
X
~
c
1
/
2
X
c
T
X
~
c
-
1is an orthogonal matrix, which has undergone rotation transformation with X
c as the center. Through the rotation transformation and translation, the position estimation of target node can be obtained as(13)
x
^
=
Ω
T
x
~
+
x
c
.Formula (12) reveals that the transformation matrix Ω is dependent on the centralized coordinate matrix X
c, which contains the unknown target node. Meanwhile, the center-of-mass coordinate x
c in (13) also contains the coordinate matrix of unknown target node. Therefore, it is bound to cause a larger error when applying the classical MDS method to estimate the target node’s position. For this problem, a modified MDS method applicable to mobile station localization was presented in literature [16].


## 2.2. Modified MDS

The modified MDS algorithm selects the mass centers of all anchor nodes as coordinate reference points, with respect to which the coordinate matrix composed of the target node and anchor nodes can be expressed as(14)
X
b
=
x
-
x
b
x
1
-
x
b
⋯
x
N
-
x
b
T
,where(15)
x
b
=
1
N
∑
i
=
1
N
x
i
.By separating the expression of the component in Formula (14) which is related to anchor nodes, we can get(16)
X
l
b
=
x
1
-
x
b
⋯
x
N
-
x
b
T
.Divide B
~
c in Formula (7) into(17)
B
~
c
=
B
11
b
T
b
B
~
1
,where B
11 is the first diagonal element of matrix B
~
c, b is an N
×
1 vector, and B
~
1 is an N
×
N matrix. Then, the following matrix can be constructed by Formulas (16) and (17):(18)
B
~
b
=
N
+
1
N
2
B
11
N
+
1
N
b
T
+
N
+
1
N
2
B
11
1
N
T
N
+
1
N
b
+
N
+
1
N
2
B
11
1
N
X
l
b
X
l
b
T
.It has been shown in [16] that without measuring error(19)
B
~
b
=
X
b
X
b
T
.In 2D localization, eigen decomposition is firstly applied to matrixB
~
b, which is constructed by Formula (18). Then, the coordinate matrix estimation X
~
b can be obtained according to Formula (9) and divided into (20)
X
~
b
=
x
~
X
~
l
b
T
.Thus, the transformation matrix with x
b as the center can be expressed as(21)
Ω
b
=
X
~
l
b
T
X
l
b
X
l
b
T
X
~
l
b
1
/
2
X
l
b
T
X
~
l
b
-
1
.Therefore, the estimated coordinate of the target node can be obtained as(22)
x
^
=
Ω
b
T
x
~
+
x
b
.


## 2.3. Subspace-Based MDS

Unlike the modified MDS method in which the mass centers of all anchor nodes are used as the coordinate reference points, the subspace-based MDS localization algorithm takes the coordinate of target node as the coordinate reference point. The corresponding coordinate matrix can be expressed as(23)
X
s
=
x
1
-
x
x
2
-
x
⋯
x
N
-
x
T
.Construct matrixB
~
s, in which the element at the ith row and jth column is(24)
B
~
s
i
j
=
1
2
r
i
2
+
r
j
2
-
d
i
j
2
.Apply eigen decomposition toB
~
s; we can get (25)
X
~
s
=
V
~
s
1
Λ
~
s
1
1
/
2
=
x
~
1
x
~
2
⋯
x
~
N
Tin 2D localization in the same way, where Λ
~
s
1 is the diagonal matrix composed of the two greatest positive eigenvalues of B
~
s and V
~
s
1 is the matrix composed of the eigenvectors in correspondence to both eigenvalues. Equally, a rotation transformation with the target node as the center exists between X
s and X
~
s; namely,(26)
X
s
≈
X
~
s
Ω
s
.
Ω
s is an unknown variable. Thus, the least square solution of (26) is(27)
Ω
s
=
X
~
s
T
X
~
s
-
1
X
~
s
T
X
s
.Substitute Formula (25) into the above expression; we can get(28)
Ω
s
=
Λ
~
s
1
1
/
2
V
~
s
1
T
X
s
.With Formulas (26) and (28), (29)
X
s
≈
V
~
s
1
V
~
s
1
T
X
ssince(30)
I
N
-
V
~
s
1
V
~
s
1
T
=
V
~
s
2
V
~
s
2
T
,where(31)
V
~
s
2
=
v
~
3
⋯
v
~
Nis the noise subspace of B
~
s and I
N is an N
×
N identity matrix. Substitute Formula (23) into (29) to get(32)
V
~
s
2
V
~
s
2
T
1
N
x
T
≈
V
~
s
2
V
~
s
2
T
x
1
⋯
x
N
T
.Thus, the least square solution to this equation can pinpoint the estimated position of the target node as(33)
x
^
=
x
1
⋯
x
N
V
~
s
2
V
~
s
2
T
1
N
1
N
T
V
~
s
2
V
~
s
2
T
1
N
.


## 3. MDS under Unified Framework

From the above analysis, it may be discovered that the difference among the classical MDS method, the modified MDS method, and the subspace method lies in selecting coordinate reference points when constructing the inner product matrix. In fact, according to the definition of inner product matrix, any point within the space encompassing the target nodes and all anchor nodes can be taken as the coordinate reference point. Namely, the coordinate reference point can be expressed as(34)
x
r
=
x
x
1
⋯
x
N
W
,where(35)
W
=
w
w
1
⋯
w
N
Tis a N
+
1
×
1 weight vector, and W
T
1
N
+
1
=
1, whereby the determined coordinate reference point is called generalized mass center.With respect to a given generalized mass-center reference point, the coordinate matrix composed of target node and anchor nodes can be expressed as(36)
X
r
=
x
-
x
r
x
1
-
x
r
⋯
x
N
-
x
r
T
.Namely,(37)
X
r
=
x
x
1
⋯
x
N
T
-
1
N
+
1
W
T
x
x
1
⋯
x
N
T
=
P
w
x
x
1
⋯
x
N
T
,where(38)
P
w
=
I
N
+
1
-
1
N
+
1
W
T
.Without measurement error, the inner product matrix under the generalized mass center is(39)
B
r
=
X
r
X
r
T
=
P
w
x
x
1
⋯
x
N
T
x
x
1
⋯
x
N
P
w
T
.The method of getting the inner product matrix B
r out of the Euclidean distance matrix is presented in the following. Note(40)
P
w
1
N
+
1
=
0
N
+
1
.Then, for X
c in Formula (1), there is(41)
P
w
X
c
X
c
T
P
w
T
=
P
w
x
x
1
⋯
x
N
T
x
x
1
⋯
x
N
P
w
T
.Compare Formulas (39) with (41) to get(42)
B
r
=
P
w
X
c
X
c
T
P
w
T
.Refer to Formula (7) and B
c
=
X
c
X
c
T; we can get(43)
B
r
=
P
w
B
c
P
w
T
=
-
1
2
P
w
J
D
P
w
J
T
.It is easy to prove(44)
P
w
J
=
P
w
.Therefore, for reference points determined by any weight vector that satisfiesW
T
1
N
+
1
=
1, the inner product matrix can be obtained directly out of the Euclidean distance matrix; namely,(45)
B
r
=
-
1
2
P
w
D
P
w
T
.Evidently, the double central transformation is a special instance of the above transformation.Refer to the noise subspaceV
r
2 of B
r to get(46)
V
r
2
V
r
2
T
X
r
=
0
(
N
+
1
)
×
2
.Then, arrange the above expression according to Formula (36) to get(47)
V
r
2
V
r
2
T
Q
r
x
T
=
V
r
2
V
r
2
T
P
r
,where(48)
Q
r
=
w
-
1
w
⋮
w
N
+
1
×
1
,
P
r
=
-
∑
i
=
1
N
w
i
x
i
T
x
1
T
-
∑
i
=
1
N
w
i
x
i
T
⋮
x
N
T
-
∑
i
=
1
N
w
i
x
i
T
(
N
+
1
)
×
2
.When there exists measurement noise, by Formula (47), the least square estimation of the target node’s position can be determined as(49)
x
^
=
P
r
T
V
~
r
2
V
~
r
2
T
Q
r
Q
r
T
V
~
r
2
V
~
r
2
T
Q
r
,where V
~
r
2 is the estimator of V
r
2. The solution derived from the above formula is also a general solution of MDS method under the unified framework.Under the above unified framework, the proposed method may change by selecting a different weight vectorW. For instance, let(50)
W
=
1
N
+
1
1
N
+
1to get the classical MDS method with all nodes’ mass centers as coordinate reference points. The solution of classical MDS method can be acquired by Formula (49). Consider(51)
w
=
0
,
w
1
=
w
2
=
⋯
=
w
N
=
1
N
.The inner product matrix constructed by Formula (51) corresponds to the one by the modified MDS method (18), whereby the solution of the modified MDS method can be obtained. If the coordinate of the target node is selected as the coordinate reference point, namely,(52)
w
=
1
,
w
1
=
w
2
=
⋯
=
w
N
=
0
,the derived solution agrees with the solution derived from the subspace method. Apart from the above methods, a larger variety of MDS methods can be derived from the definition of generalized mass center.


## 4. Minimum Residual MDS Algorithm under Unified Framework

From the above analysis, it can be known that the solving process of MDS algorithm under the unified framework is actually to find the least square solution. However, the least square algorithm inevitably introduces unavoidable errors during the linearization process. To optimize the performance of MDS method, this paper proposes a minimum residual based MDS algorithm, extends MDS method to the circumstance of generalized mass center, and gets the minimum residual solution under the unified framework.


### 4.1. Theory of Minimum Residual Localization

The idea of minimum residual localization is to find a coordinate point within the region to be located so as to minimize the residual sum of squares of the distances between it and anchor nodes AN and the corresponding measured distances, namely, to maximize the matched degree between this coordinate point and the measured distances, and finally to take the coordinate point as the estimated position of the target.According to what is assumed in the above experimental system, forN anchor nodes, the distance between the target node and the ith anchor node containing measurement noise errors is expressed as r
i as in Formula (5), throughout the localization process, where d
i denotes the real distance between TN and A
N
i and η
i denotes the measurement noise. In practical application, this measurement noise is dependent on complicated factors such as hardware device, ranging technique, and environment. Its distribution parameters are difficult to obtain.According to the idea of minimum residual localization, a target function can be built:(53)
f
(
x
)
=
∑
i
N
x
-
A
N
i
-
r
i
2
,where x is a certain coordinate point (
a
,
b
) within the space and |
|
x
-
A
N
i
|
| is the Euclidean distance between the target x and anchor node A
N
i
(
a
i
,
b
i
). Consider (54)
x
-
A
N
i
=
a
-
a
i
2
+
b
-
b
i
2
.Then, functionf
(
x
) represents the residual sum of squares of the distances between a certain coordinate point within the space and anchor nodes and the measured distances. If no noise exists along the measured distance, (55)
lim
w
i
→
0
f
x
=
∑
i
N
x
-
A
N
i
-
r
i
2
=
∑
i
N
x
-
A
N
i
-
r
i
2
.Whenlim
w
i
→
0
f
(
x
)
=
0, the x coordinate is the real position of target node. However, due to the existence of measuring error, in general cases f
(
x
)
≠
0. Therefore, x which minimizes f
(
x
) may be taken as the estimated position of the target; namely,(56)
x
~
=
arg
min
⁡
⁡
f
x
.


### 4.2. Application of Particle Swarm Optimization (PSO) Algorithm in Minimum Residual Localization

According to the above analysis, the minimum residual localization algorithm is to find the function in an unconstrained optimization problem. Consider(57)
x
~
=
arg
min
⁡
f
(
x
)
=
arg
min
⁡
∑
i
N
a
-
a
i
2
+
b
-
b
i
2
-
r
i
2
.Given the coordinates of all anchor nodes AN within the positioning system, the measured distance from the target node TN to each AN is to be obtained in each locating cycle.The idea of PSO algorithm is to adopt multiple particles to simulate the target’s location. The updating direction of the particles will also be determined by comparing their individual optimum with group optimum. Through several iterations, the group optimum of the particle swarm is selected as the optimal solution. Assume that the number of particles isM and the maximum count of iteration is K. The PSO-based minimum residual localization algorithm works throughout the solving procedure as follows.Step 1 (initialization).
Randomly generate particles and their initial speeds within the positioning space:(58)
x
m
1
=
a
m
1
,
b
m
1
,
V
m
1
=
v
a
m
1
,
v
b
m
1
,
Compute the adaptive valuef
(
x
m
1
) of each particle, which is taken as the initial historical optimal solution of this particle; namely, (59)
B
m
1
=
x
m
1
.
Meanwhile, the historical optimal solution of the particle swarm is the particle which has achieved the minimum adaptive value:(60)
B
g
1
=
arg
min
⁡
m
=
1
:
M
f
x
m
1
.Step 2 (thekth iterative update of particles (2
≤
k
≤
K)).
Update the particles according to their individual historical optimal solution and group historical optimal solution:(61)
V
m
k
=
ω
V
m
k
-
1
+
c
1
ξ
B
m
k
-
1
-
x
m
k
-
1
+
c
2
μ
B
g
k
-
1
-
x
m
k
-
1
,
x
m
k
=
x
m
k
-
1
+
V
m
k
-
1
,where ω is called inertia weight, c
1 and c
2 are called learning factors, and ξ
,
μ
∈
U
[
0,1
] are pseudorandom numbers following uniform distribution within the interval [
0
,
1
].Step 3.
Update the individual historical optimal solution and group historical optimal solution of the particles:(62)
B
m
k
=
B
m
k
-
1
,
f
(
x
m
k
)
>
f
(
B
m
k
-
1
)
x
m
k
,
f
(
x
m
k
)
≤
f
(
B
m
k
-
1
)
B
g
k
=
B
g
k
-
1
,
min
⁡
m
=
1
:
M
f
(
x
m
k
)
>
f
(
B
g
k
-
1
)
arg
min
⁡
m
=
1
:
M
f
(
x
m
k
)
,
min
⁡
m
=
1
:
M
f
x
m
k
≤
f
B
g
k
-
1
.Step 4.
Decide whether the maximum count of iterationK is achieved.
If no, letk
=
k
+
1 and skip to Step 2.
If yes, the initially estimated position of the target at the moment is(63)
x
~
t
=
B
g
K
.The dimensionality isn. In the process of initialization, the time complexity is O
M
n. The time complexity is O
M
n when the fitness function of M particles is calculated. The time complexity is O
M when the individual value of M particles is updated. The time complexity is O
M when the best value is chosen from M individual extremums as the global extremum. The time complexity is O
M
n when the velocity and position of each particle are updated. In the above steps, the worst time complexity is O
M
n. The time complexity after circulation is O
ite
r
max
⁡
M
n when the iteration time of algorithm is ite
r
max
⁡. Therefore, the time complexity of PSO algorithm is O
ite
r
max
⁡
M
n.It has been proven thatx
m of PSO algorithm converges to the center weighted of B
g and B
m when 2
1
+
ω
-
φ
-
4
ω
<
2
(
φ
=
φ
1
+
φ
2
,
φ
1
=
c
1
ξ
,
φ
2
=
c
2
μ
) and B
g
,
B
m remain unchanged in the process of evolution; namely, x
m
→
φ
1
B
m
+
φ
2
B
g
/
φ [21]. In fact, B
g and B
m are constantly updated according to their adaptive values in the process of evolution. It also has been proven that the convergence of the PSO algorithm can be completely guaranteed if only the parameter chosen by us meet the above-mentioned requirements [22].


### 4.3. MDS-Based Minimum Residual Localization Algorithm (MinRE MDS)

In fact, Formula (47) can be rewritten as(64)
1
x
Q
r
T
V
r
2
V
r
2
T
=
Q
r
T
P
r
T
V
r
2
V
r
2
T
.Postmultiply both sides of the above equation by vectorQ
r, and divide it by Q
r
T
V
r
2
V
r
2
T
Q
r to produce(65)
1
x
=
Q
r
T
P
r
T
V
r
2
V
r
2
T
Q
r
Q
r
T
V
r
2
V
r
2
T
Q
r
.Namely,(66)
Q
r
T
P
r
T
†
1
x
=
V
r
2
V
r
2
T
Q
r
Q
r
T
V
r
2
V
r
2
T
Q
r
.Here, the superscript † denotes the Moore-Penrose inverse. Assuming that the signal subspace of inner product matrix B
r is V
r
1, we can get B
r
=
V
r
1
Λ
r
1
V
r
1
T. Given the orthogonality of V
r
1 and V
r
2, premultiply both sides of Formula (66) by B
r to produce(67)
B
r
Q
r
T
P
r
T
†
1
x
=
0
N
+
1
.When measurement noise exists, there is(68)
D
~
=
D
+
Δ
D
,
B
~
r
=
B
r
+
Δ
B
r
.Ignore the high-order terms to get(69)
Δ
D
≈
0
2
d
1
η
1
⋯
2
d
N
η
N
2
d
1
η
1
0
⋯
0
⋮
⋮
⋱
⋮
2
d
N
η
N
0
⋯
0
,
Δ
B
r
=
-
1
2
P
w
Δ
D
P
w
T
.Thus, the residual vectorε of Formula (67) can be expressed as(70)
ε
=
Δ
B
r
Q
r
T
P
r
T
†
1
x
=
-
1
2
P
w
Δ
D
P
w
T
Q
r
T
P
r
T
†
1
x
.Now, the sum of residual vectorsε makes the same physical sense as Formula (53).Let(71)
A
r
=
Q
r
T
P
r
T
†
.And divide A
r into(72)
A
r
=
A
r
1
⋯
A
r
2by column, where A
r
1 contains only the first column of A
r, while A
r
2 contains the other columns of A
r. Then, the least square solution of target node’s position is(73)
x
^
=
-
A
r
2
T
B
~
r
T
B
~
r
A
r
2
A
r
2
T
B
~
r
T
B
~
r
A
r
1
.In order to solve the optimal position of the target, substitutex
^ obtained from Formula (73) into (57) to perform optimal iterations over the particle swarm. When the minimum residual solution is solved, the ultimate coordinate estimation of mobile nodes can be obtained. The classical MDS method, the modified MDS method, and the subspace-based method under the unified framework are derived by selecting a different weight vector W.The above procedure can avoid eigen decomposition in the classical MDS algorithm, overcome errors introduced in least square algorithm as a result of linearization, and work out MDS-based minimum solution of the target coordinate.


## 4.1. Theory of Minimum Residual Localization

The idea of minimum residual localization is to find a coordinate point within the region to be located so as to minimize the residual sum of squares of the distances between it and anchor nodes AN and the corresponding measured distances, namely, to maximize the matched degree between this coordinate point and the measured distances, and finally to take the coordinate point as the estimated position of the target.According to what is assumed in the above experimental system, forN anchor nodes, the distance between the target node and the ith anchor node containing measurement noise errors is expressed as r
i as in Formula (5), throughout the localization process, where d
i denotes the real distance between TN and A
N
i and η
i denotes the measurement noise. In practical application, this measurement noise is dependent on complicated factors such as hardware device, ranging technique, and environment. Its distribution parameters are difficult to obtain.According to the idea of minimum residual localization, a target function can be built:(53)
f
(
x
)
=
∑
i
N
x
-
A
N
i
-
r
i
2
,where x is a certain coordinate point (
a
,
b
) within the space and |
|
x
-
A
N
i
|
| is the Euclidean distance between the target x and anchor node A
N
i
(
a
i
,
b
i
). Consider (54)
x
-
A
N
i
=
a
-
a
i
2
+
b
-
b
i
2
.Then, functionf
(
x
) represents the residual sum of squares of the distances between a certain coordinate point within the space and anchor nodes and the measured distances. If no noise exists along the measured distance, (55)
lim
w
i
→
0
f
x
=
∑
i
N
x
-
A
N
i
-
r
i
2
=
∑
i
N
x
-
A
N
i
-
r
i
2
.Whenlim
w
i
→
0
f
(
x
)
=
0, the x coordinate is the real position of target node. However, due to the existence of measuring error, in general cases f
(
x
)
≠
0. Therefore, x which minimizes f
(
x
) may be taken as the estimated position of the target; namely,(56)
x
~
=
arg
min
⁡
⁡
f
x
.


## 4.2. Application of Particle Swarm Optimization (PSO) Algorithm in Minimum Residual Localization

According to the above analysis, the minimum residual localization algorithm is to find the function in an unconstrained optimization problem. Consider(57)
x
~
=
arg
min
⁡
f
(
x
)
=
arg
min
⁡
∑
i
N
a
-
a
i
2
+
b
-
b
i
2
-
r
i
2
.Given the coordinates of all anchor nodes AN within the positioning system, the measured distance from the target node TN to each AN is to be obtained in each locating cycle.The idea of PSO algorithm is to adopt multiple particles to simulate the target’s location. The updating direction of the particles will also be determined by comparing their individual optimum with group optimum. Through several iterations, the group optimum of the particle swarm is selected as the optimal solution. Assume that the number of particles isM and the maximum count of iteration is K. The PSO-based minimum residual localization algorithm works throughout the solving procedure as follows.Step 1 (initialization).
Randomly generate particles and their initial speeds within the positioning space:(58)
x
m
1
=
a
m
1
,
b
m
1
,
V
m
1
=
v
a
m
1
,
v
b
m
1
,
Compute the adaptive valuef
(
x
m
1
) of each particle, which is taken as the initial historical optimal solution of this particle; namely, (59)
B
m
1
=
x
m
1
.
Meanwhile, the historical optimal solution of the particle swarm is the particle which has achieved the minimum adaptive value:(60)
B
g
1
=
arg
min
⁡
m
=
1
:
M
f
x
m
1
.Step 2 (thekth iterative update of particles (2
≤
k
≤
K)).
Update the particles according to their individual historical optimal solution and group historical optimal solution:(61)
V
m
k
=
ω
V
m
k
-
1
+
c
1
ξ
B
m
k
-
1
-
x
m
k
-
1
+
c
2
μ
B
g
k
-
1
-
x
m
k
-
1
,
x
m
k
=
x
m
k
-
1
+
V
m
k
-
1
,where ω is called inertia weight, c
1 and c
2 are called learning factors, and ξ
,
μ
∈
U
[
0,1
] are pseudorandom numbers following uniform distribution within the interval [
0
,
1
].Step 3.
Update the individual historical optimal solution and group historical optimal solution of the particles:(62)
B
m
k
=
B
m
k
-
1
,
f
(
x
m
k
)
>
f
(
B
m
k
-
1
)
x
m
k
,
f
(
x
m
k
)
≤
f
(
B
m
k
-
1
)
B
g
k
=
B
g
k
-
1
,
min
⁡
m
=
1
:
M
f
(
x
m
k
)
>
f
(
B
g
k
-
1
)
arg
min
⁡
m
=
1
:
M
f
(
x
m
k
)
,
min
⁡
m
=
1
:
M
f
x
m
k
≤
f
B
g
k
-
1
.Step 4.
Decide whether the maximum count of iterationK is achieved.
If no, letk
=
k
+
1 and skip to Step 2.
If yes, the initially estimated position of the target at the moment is(63)
x
~
t
=
B
g
K
.The dimensionality isn. In the process of initialization, the time complexity is O
M
n. The time complexity is O
M
n when the fitness function of M particles is calculated. The time complexity is O
M when the individual value of M particles is updated. The time complexity is O
M when the best value is chosen from M individual extremums as the global extremum. The time complexity is O
M
n when the velocity and position of each particle are updated. In the above steps, the worst time complexity is O
M
n. The time complexity after circulation is O
ite
r
max
⁡
M
n when the iteration time of algorithm is ite
r
max
⁡. Therefore, the time complexity of PSO algorithm is O
ite
r
max
⁡
M
n.It has been proven thatx
m of PSO algorithm converges to the center weighted of B
g and B
m when 2
1
+
ω
-
φ
-
4
ω
<
2
(
φ
=
φ
1
+
φ
2
,
φ
1
=
c
1
ξ
,
φ
2
=
c
2
μ
) and B
g
,
B
m remain unchanged in the process of evolution; namely, x
m
→
φ
1
B
m
+
φ
2
B
g
/
φ [21]. In fact, B
g and B
m are constantly updated according to their adaptive values in the process of evolution. It also has been proven that the convergence of the PSO algorithm can be completely guaranteed if only the parameter chosen by us meet the above-mentioned requirements [22].


## 4.3. MDS-Based Minimum Residual Localization Algorithm (MinRE MDS)

In fact, Formula (47) can be rewritten as(64)
1
x
Q
r
T
V
r
2
V
r
2
T
=
Q
r
T
P
r
T
V
r
2
V
r
2
T
.Postmultiply both sides of the above equation by vectorQ
r, and divide it by Q
r
T
V
r
2
V
r
2
T
Q
r to produce(65)
1
x
=
Q
r
T
P
r
T
V
r
2
V
r
2
T
Q
r
Q
r
T
V
r
2
V
r
2
T
Q
r
.Namely,(66)
Q
r
T
P
r
T
†
1
x
=
V
r
2
V
r
2
T
Q
r
Q
r
T
V
r
2
V
r
2
T
Q
r
.Here, the superscript † denotes the Moore-Penrose inverse. Assuming that the signal subspace of inner product matrix B
r is V
r
1, we can get B
r
=
V
r
1
Λ
r
1
V
r
1
T. Given the orthogonality of V
r
1 and V
r
2, premultiply both sides of Formula (66) by B
r to produce(67)
B
r
Q
r
T
P
r
T
†
1
x
=
0
N
+
1
.When measurement noise exists, there is(68)
D
~
=
D
+
Δ
D
,
B
~
r
=
B
r
+
Δ
B
r
.Ignore the high-order terms to get(69)
Δ
D
≈
0
2
d
1
η
1
⋯
2
d
N
η
N
2
d
1
η
1
0
⋯
0
⋮
⋮
⋱
⋮
2
d
N
η
N
0
⋯
0
,
Δ
B
r
=
-
1
2
P
w
Δ
D
P
w
T
.Thus, the residual vectorε of Formula (67) can be expressed as(70)
ε
=
Δ
B
r
Q
r
T
P
r
T
†
1
x
=
-
1
2
P
w
Δ
D
P
w
T
Q
r
T
P
r
T
†
1
x
.Now, the sum of residual vectorsε makes the same physical sense as Formula (53).Let(71)
A
r
=
Q
r
T
P
r
T
†
.And divide A
r into(72)
A
r
=
A
r
1
⋯
A
r
2by column, where A
r
1 contains only the first column of A
r, while A
r
2 contains the other columns of A
r. Then, the least square solution of target node’s position is(73)
x
^
=
-
A
r
2
T
B
~
r
T
B
~
r
A
r
2
A
r
2
T
B
~
r
T
B
~
r
A
r
1
.In order to solve the optimal position of the target, substitutex
^ obtained from Formula (73) into (57) to perform optimal iterations over the particle swarm. When the minimum residual solution is solved, the ultimate coordinate estimation of mobile nodes can be obtained. The classical MDS method, the modified MDS method, and the subspace-based method under the unified framework are derived by selecting a different weight vector W.The above procedure can avoid eigen decomposition in the classical MDS algorithm, overcome errors introduced in least square algorithm as a result of linearization, and work out MDS-based minimum solution of the target coordinate.


## 5. Experimental Verification and Effect Analysis

### 5.1. Experimental Platform Construction

To verify the performance of the minimum residual MDS localization algorithm under the unified framework proposed in this paper, confirmatory experiment is implemented at Lab 104 in Science Building of Northeastern University (NEU). The whole experimental environment is arranged as in Figure1. The environment extends a range of 10 m ∗ 6 m. The positions of the anchor nodes are AN1(8, 1), AN2(1, 1), AN3(1, 5), AN4(8, 5), and AN5(4.5, 3), respectively. The motion trail of the target, which moves 6.5 m ahead, turns right and moves 3 m ahead before continuing to turn right and move 6.5 m ahead, and starts at the point (
8,1.5
). The total length of the trail covered by the target is 16 m; the moving speed is 1 m/s; the sampling frequency of RSSI values is twice per second (0.5 Hz). The total sampling number is 33.Figure 1
Environment deployment.In the experiment, ZigBee nodes are adopted as anchor nodes and target node in WSN. The nodes are arranged above a tripod with the height of 1.6 m. The target node is carried above the mobile robot iRobot, as shown in Figure2.Figure 2
ZigBee nodes deployment.
(a)
Anchor node
(b)
Target node


### 5.2. Localization Result and Analysis

Iterative recursive weighted average filter [23] is adopted to process the initial measured values of RSSI, which are converted into estimated values of distance via RSSI signal attenuation model. After obtaining the estimated distances between the anchor nodes and target node, estimation of node positions can be performed.A comparison is made between the minimum residual classical MDS method, minimum residual modified MDS method, and minimum residual subspace method under the unified framework and the classical MDS method and modified MDS method as well as subspace method under the unified framework. For the experimental environment and data at this time, the obtained result of localization is shown in Figures3–8. According to the localization effect diagram, it can be seen that there exists a larger error within the least square MDS localization in which there exists a great deflection between the estimation result and real value, whereas the PSO-based minimum residual MDS algorithm gives significantly smaller bias in position estimation.Figure 3
Classic MDS localization result.Figure 4
MinRE classic MDS localization result.Figure 5
Modified MDS localization result.Figure 6
MinRE modified MDS localization result.Figure 7
Subspace localization result.Figure 8
MinRE subspace localization result.Figures9 and 10 are analysis diagrams of error statistics. It can be easily seen that the error of the PSO-based minimum residual MDS localization algorithm is significantly smaller than that of the least square MDS localization algorithm. In other words, it can achieve a more perfect effect of localization.Figure 9
Localization error.Figure 10
Cumulative distribution function.The concrete parameter analysis of localization error is shown in Table1, which reveals that the minimum residual MDS localization algorithm has enhanced accuracy dramatically as compared with the least square MDS. Experimental results show that the classical MDS method, modified MDS method, and subspace method under the unified framework have demonstrated different performances in accordance with different selections of coordinate reference points. However, there is not a selection scheme of coordinate reference points which outperforms the minimum residual MDS algorithm under the same reference points. The minimum residual MDS method significantly outperforms the least square MDS method, with better localization accuracy up to 41%. Furthermore, the former performance is immune to selection of reference nodes.Table 1
Localization error statistic.
Error
Mean
Variance
Maximum
Classic MDS
1.4527
0.4819
2.6186
Min. classic MDS
0.8458
0.4039
1.6942
Modified MDS
1.4825
0.5168
2.7258
Min. modified MDS
0.8661
0.4132
1.7080
Subspace
2.7742
1.7439
9.2058
Min. subspace
0.8498
0.4129
1.7132


## 5.1. Experimental Platform Construction

To verify the performance of the minimum residual MDS localization algorithm under the unified framework proposed in this paper, confirmatory experiment is implemented at Lab 104 in Science Building of Northeastern University (NEU). The whole experimental environment is arranged as in Figure1. The environment extends a range of 10 m ∗ 6 m. The positions of the anchor nodes are AN1(8, 1), AN2(1, 1), AN3(1, 5), AN4(8, 5), and AN5(4.5, 3), respectively. The motion trail of the target, which moves 6.5 m ahead, turns right and moves 3 m ahead before continuing to turn right and move 6.5 m ahead, and starts at the point (
8,1.5
). The total length of the trail covered by the target is 16 m; the moving speed is 1 m/s; the sampling frequency of RSSI values is twice per second (0.5 Hz). The total sampling number is 33.Figure 1
Environment deployment.In the experiment, ZigBee nodes are adopted as anchor nodes and target node in WSN. The nodes are arranged above a tripod with the height of 1.6 m. The target node is carried above the mobile robot iRobot, as shown in Figure2.Figure 2
ZigBee nodes deployment.
(a)
Anchor node
(b)
Target node


## 5.2. Localization Result and Analysis

Iterative recursive weighted average filter [23] is adopted to process the initial measured values of RSSI, which are converted into estimated values of distance via RSSI signal attenuation model. After obtaining the estimated distances between the anchor nodes and target node, estimation of node positions can be performed.A comparison is made between the minimum residual classical MDS method, minimum residual modified MDS method, and minimum residual subspace method under the unified framework and the classical MDS method and modified MDS method as well as subspace method under the unified framework. For the experimental environment and data at this time, the obtained result of localization is shown in Figures3–8. According to the localization effect diagram, it can be seen that there exists a larger error within the least square MDS localization in which there exists a great deflection between the estimation result and real value, whereas the PSO-based minimum residual MDS algorithm gives significantly smaller bias in position estimation.Figure 3
Classic MDS localization result.Figure 4
MinRE classic MDS localization result.Figure 5
Modified MDS localization result.Figure 6
MinRE modified MDS localization result.Figure 7
Subspace localization result.Figure 8
MinRE subspace localization result.Figures9 and 10 are analysis diagrams of error statistics. It can be easily seen that the error of the PSO-based minimum residual MDS localization algorithm is significantly smaller than that of the least square MDS localization algorithm. In other words, it can achieve a more perfect effect of localization.Figure 9
Localization error.Figure 10
Cumulative distribution function.The concrete parameter analysis of localization error is shown in Table1, which reveals that the minimum residual MDS localization algorithm has enhanced accuracy dramatically as compared with the least square MDS. Experimental results show that the classical MDS method, modified MDS method, and subspace method under the unified framework have demonstrated different performances in accordance with different selections of coordinate reference points. However, there is not a selection scheme of coordinate reference points which outperforms the minimum residual MDS algorithm under the same reference points. The minimum residual MDS method significantly outperforms the least square MDS method, with better localization accuracy up to 41%. Furthermore, the former performance is immune to selection of reference nodes.Table 1
Localization error statistic.
Error
Mean
Variance
Maximum
Classic MDS
1.4527
0.4819
2.6186
Min. classic MDS
0.8458
0.4039
1.6942
Modified MDS
1.4825
0.5168
2.7258
Min. modified MDS
0.8661
0.4132
1.7080
Subspace
2.7742
1.7439
9.2058
Min. subspace
0.8498
0.4129
1.7132


## 6. Conclusion

In this paper, three available MDS algorithms, including the classical MDS algorithm, modified MDS algorithm, and subspace method, are analyzed. Their difference mainly lies in the selection of reference nodes. Thereby, the unified framework is used to solve MDS algorithms. On the basis of existing methods, MDS localization algorithm based on minimum residual is put forward. Its general solution is provided under the above unified framework. In order to verify the performance of the proposed algorithm, a small-scale WSN network with ZigBee nodes is adopted to implement practical experiment. Experiment results show that the minimum residual MDS algorithm proposed in this paper can effectively enhance the localization accuracy of moving target. What is more, the performance of the minimum residual MDS algorithm is immune to the selection of reference nodes.



---

*Source: 719658-2015-08-13.xml*