# Research on Algorithm of Three-Dimensional Wireless Sensor Networks Node Localization

Authors: Jiang Minlan; Luo Jingyuan; Zou Xiaokang
Journal: Journal of Sensors
 (2016)

---

## Abstract

This paper proposes a three-dimensional wireless sensor networks node localization algorithm based on multidimensional scaling anchor nodes, which is used to realize the absolute positioning of unknown nodes by using the distance between the anchor nodes and the nodes. The core of the proposed localization algorithm is a kind of repeated optimization method based on anchor nodes which is derived from STRESS formula. The algorithm employs the Tunneling Method to solve the local minimum problem in repeated optimization, which improves the accuracy of the optimization results. The simulation results validate the effectiveness of the algorithm. Random distribution of three-dimensional wireless sensor network nodes can be accurately positioned. The results satisfy the high precision and stability requirements in three-dimensional space node location.


---

## Body

## 1. Introduction

Node localization technology is one of the key technologies of wireless sensor network (WSN). Node localization approaches in WSN locate unknown nodes through the location of anchor nodes by an algorithm or a rule. The two-dimensional (2D) WSN node positioning technology has been mature, but research in three-dimensional (3D) nodes localization has not been rich. In practical application, the space distribution of wireless sensor is often 3D rather than 2D due to the shape of ground and the environment. So localization in 2D plane is not enough, and research on localization algorithms in the 3D space is necessary. With the increase of dimension, the computational complexity and the error increase greatly. Even though the error of node position is so little, it will be apparent after the 3D calculation. In addition, it is necessary to combine the WSN system position with node position to realize accurate positioning of external nodes. Therefore, the node localization algorithm requires higher precision [1–3].In recent years, many new ideas and solutions have been proposed to solve the problem of WSN node localization in 3D. The theory that originated in psychometrics multidimensional scaling (MDS) positioning technology proposed by Shang et al. provides a new method for node localization. In the existing MDS algorithms, MDS-MAP, MDS-MAP(P), and MDS-MAP(P,R) algorithm are the most influential. MDS-MAP is a centralized location algorithm based on MDS. First, MDS-MAP uses multidimensional scaling technique to build a local map of a series of neighboring nodes in 3D and to achieve global network positioning through coordinate conversion. MDS-MAP algorithm makes full use of MDS advantages and avoids the error caused by the shortest path distance in place of the real distance. As a result, its positioning accuracy has been improved to a certain extent but its biggest disadvantage requires centralized calculation, which is not suitable for large-scale, uneven distribution network. MDS-MAP(P) and MDS-MAP(P,R) are the improvement based on MDS-MAP distributed algorithm. Through dividing the whole network into many subnets and using MDS-MAP to compute each subnet to get local coordinate system, MDSMAP(P) and MDS-MAP(P,R) then realize the entire network position by transform and fusion of local coordinates. The complexity of algorithm will greatly increase since the transform and fusion. It will introduce the transmission error and lead to the accumulation of error. The bigger the network is, the more apparent the error will be. And the computational complexity will be a geometric growth [4, 5].The improved positioning algorithm mentioned in this paper uses anchor nodes calibration technology of MDS to directly get the absolute coordinates of unknown nodes, which requires neither integration of local coordinate system nor conversion from the relative coordinates to the absolute coordinates. As a consequence, it avoids the cumulative errors produced in this process. At the same time, taking into account the MDS optimization of local minimum problem, this paper employs Tunneling Method algorithm to solve the repeated optimization algorithm of values in local minimum problem. The simulation result demonstrates that the MDS node localization algorithm based on Tunneling Method (TMDS) achieves high positioning accuracy and high stability.The rest of the paper is organized as follows. In Section2, the node localization algorithm based on MDS is described in detail. Section 3 introduces node localization algorithm based on MDS. Section 4 reports the simulation scenarios and analysis results. Finally a conclusion is given in Section 5.


## 2. Node Localization Algorithm Based on MDS

### 2.1. Node Coordinates Calculation Based on the MDS

Assume that WSN in 3D space is made up ofn unknown nodes and m anchor nodes. X
=
[
x
i
a
]
n
×
3 represents the unknown node coordinate matrix. C
=
[
c
k
a
]
m
×
3 represents the anchor nodes coordinate matrix. δ
i
j represents the measuring distance between unknown nodes i and j. τ
i
k represents the measuring distance between unknown node i and anchor nodes k. The distance can be expressed by the minimum hop between two nodes and also can be expressed by the shortest path distance between two nodes or any other distance, such as the Euclidean distance. To guarantee the accuracy, this paper measures the distance between one-hop neighbor nodes by the Euclidean method. The problem of node localization is using repeated optimization algorithm to calculate the coordinates of unknown nodes matrix X under the condition that δ
i
j and τ
i
k distance and the anchor nodes coordinate matrix C have been known [6, 7].MatrixX
n
×
3 represents the coordinates of the n nodes in 3D space. For any two nodes l and h, their Euclidean distance can be shown as follows:(1)
d
l
h
2
X
=
d
l
h
2
=
∑
a
=
1
3
x
l
a
-
x
h
a
2
=
∑
a
=
1
3
x
l
a
2
+
x
h
a
2
-
2
x
l
a
x
h
a
.For three nodes in 3D space, their corresponding matrix is as follows:(2)
X
=
x
11
x
12
x
13
x
21
x
22
x
23
x
31
x
32
x
33
D
2
(
X
) represents the square of the distance matrix and it can be represented as follows:(3)
D
2
X
=
0
d
12
2
d
13
2
d
21
2
0
d
23
2
d
31
2
d
32
2
0
=
∑
a
=
1
3
x
1
a
2
x
1
a
2
x
1
a
2
x
2
a
2
x
2
a
2
x
2
a
2
x
3
a
2
x
3
a
2
x
3
a
2
+
∑
a
=
1
3
x
1
a
2
x
2
a
2
x
3
a
2
x
1
a
2
x
2
a
2
x
3
a
2
x
1
a
2
x
2
a
2
x
3
a
2
-
2
∑
a
=
1
3
x
1
a
x
1
a
x
1
a
x
2
a
x
1
a
x
3
a
x
2
a
x
1
a
x
2
a
x
2
a
x
2
a
x
3
a
x
3
a
x
1
a
x
3
a
x
2
a
x
3
a
x
3
a
=
∑
a
=
1
3
x
1
a
2
∑
a
=
1
3
x
2
a
2
∑
a
=
1
3
x
3
a
2
1
1
1
+
1
1
1
∑
a
=
1
3
x
1
a
2
∑
a
=
1
3
x
2
a
2
∑
a
=
1
3
x
3
a
2
-
2
∑
a
=
1
3
X
a
X
a
T
=
C
e
T
+
e
C
T
-
2
∑
a
=
1
3
X
a
X
a
T
,where X
a is the a column of matrix X. C is the column vector which is composed of ∑
a
=
1
3
X
i
a
X
i
a
T. Vector e is a column matrix and its elements are 1.


### 2.2. The Repeated Optimization Algorithm Based on the Anchor Node

Repeated optimization algorithm aims at finding coordinate matrixX representing the unknown nodes’ location. The algorithm makes nodes distance calculated by coordinates be closer to the real measuring distance. When the difference is smaller, coordinate values in a matrix are close to the real coordinates of nodes. Using the repeated optimization method, find the coordinate matrix X. The first step is to build a function about matrix X as the objective function. Then find the minimization inequality of the objective function. Finally obtain the repeat optimization formula. When the formula reaches its minimum value, X is the coordinate for unknown nodes. Regard the difference square sum between computing distance and the measuring distance as target function of repeated optimization algorithm in MDS technology [8–10].According to the Euclidean Metric, the distance between the unknown nodesi and j can be obtained by (4)
d
i
j
X
=
∑
a
=
1
N
x
i
a
-
x
j
a
2
1
/
2
.According to matrix X, the distance between the unknown node i and the anchor node k can be obtained by(5)
d
i
k
X
,
C
=
∑
a
=
1
N
x
i
a
-
c
k
a
2
1
/
2
.In order to get the coordinate matrix X, we usually use Kruskal’s STRESS formula to set the objective function as follows:(6)
σ
X
=
∑
i
=
1
n
∑
j
=
i
+
1
n
ω
i
j
δ
i
j
-
d
i
j
X
2
+
∑
i
=
1
m
∑
k
=
1
m
υ
i
k
τ
i
k
-
d
i
k
X
,
C
2
=
σ
1
X
+
σ
2
X
,where the weights ω
i
j and υ
i
k decide their corresponding sum’s influence on objective function. This paper applies the calculation method of weight proposed by the literature [6], and weights can be calculated by(7)
ω
i
j
=
exp
⁡
-
δ
i
j
2
η
i
j
2
,
υ
i
k
=
exp
⁡
-
τ
i
k
2
η
i
k
2
.Otherwise, both of them are zero. η
i
j in (7) represents the biggest distance between unknown node i or j and other nodes. η
i
k represents the biggest distance between unknown node i and other nodes or anchor node k. For a given matrix X, the value of corresponding objective function can be obtained according to formula (3). Our goal is to find X, which makes the objective function minimum. Namely, minimize the objective function, and find the optimal solution X of objective function.There are many ways to solve the local minimum problem of repeated optimization method in minimizing the objective function, for example, Dimensionality Reduction, multivalue random testing method, Distance Smoothing, and Tunneling Method. Among those methods, multivalue random testing method may attain good optimal result but it has great randomicity and poor stability. Dimensionality Reduction is complex and large in the amount of calculation in the 3D space environment. Distance Smoothing is simple in calculation and does well in positioning in 2D space environment. But its global search is poor in the 3D space environment [8]. On the contrary, the repeated optimization method based on tunneling can almost find the global optimal value due to cycle search method that first searches in the horizontal direction and then searches in the vertical direction and then searches in the horizontal direction again. Therefore, Tunneling Method used in this paper solves the local minimum problem of repeated optimization algorithm. And the MDS 3D node localization algorithm based on Tunneling Method is proposed.


## 2.1. Node Coordinates Calculation Based on the MDS

Assume that WSN in 3D space is made up ofn unknown nodes and m anchor nodes. X
=
[
x
i
a
]
n
×
3 represents the unknown node coordinate matrix. C
=
[
c
k
a
]
m
×
3 represents the anchor nodes coordinate matrix. δ
i
j represents the measuring distance between unknown nodes i and j. τ
i
k represents the measuring distance between unknown node i and anchor nodes k. The distance can be expressed by the minimum hop between two nodes and also can be expressed by the shortest path distance between two nodes or any other distance, such as the Euclidean distance. To guarantee the accuracy, this paper measures the distance between one-hop neighbor nodes by the Euclidean method. The problem of node localization is using repeated optimization algorithm to calculate the coordinates of unknown nodes matrix X under the condition that δ
i
j and τ
i
k distance and the anchor nodes coordinate matrix C have been known [6, 7].MatrixX
n
×
3 represents the coordinates of the n nodes in 3D space. For any two nodes l and h, their Euclidean distance can be shown as follows:(1)
d
l
h
2
X
=
d
l
h
2
=
∑
a
=
1
3
x
l
a
-
x
h
a
2
=
∑
a
=
1
3
x
l
a
2
+
x
h
a
2
-
2
x
l
a
x
h
a
.For three nodes in 3D space, their corresponding matrix is as follows:(2)
X
=
x
11
x
12
x
13
x
21
x
22
x
23
x
31
x
32
x
33
D
2
(
X
) represents the square of the distance matrix and it can be represented as follows:(3)
D
2
X
=
0
d
12
2
d
13
2
d
21
2
0
d
23
2
d
31
2
d
32
2
0
=
∑
a
=
1
3
x
1
a
2
x
1
a
2
x
1
a
2
x
2
a
2
x
2
a
2
x
2
a
2
x
3
a
2
x
3
a
2
x
3
a
2
+
∑
a
=
1
3
x
1
a
2
x
2
a
2
x
3
a
2
x
1
a
2
x
2
a
2
x
3
a
2
x
1
a
2
x
2
a
2
x
3
a
2
-
2
∑
a
=
1
3
x
1
a
x
1
a
x
1
a
x
2
a
x
1
a
x
3
a
x
2
a
x
1
a
x
2
a
x
2
a
x
2
a
x
3
a
x
3
a
x
1
a
x
3
a
x
2
a
x
3
a
x
3
a
=
∑
a
=
1
3
x
1
a
2
∑
a
=
1
3
x
2
a
2
∑
a
=
1
3
x
3
a
2
1
1
1
+
1
1
1
∑
a
=
1
3
x
1
a
2
∑
a
=
1
3
x
2
a
2
∑
a
=
1
3
x
3
a
2
-
2
∑
a
=
1
3
X
a
X
a
T
=
C
e
T
+
e
C
T
-
2
∑
a
=
1
3
X
a
X
a
T
,where X
a is the a column of matrix X. C is the column vector which is composed of ∑
a
=
1
3
X
i
a
X
i
a
T. Vector e is a column matrix and its elements are 1.


## 2.2. The Repeated Optimization Algorithm Based on the Anchor Node

Repeated optimization algorithm aims at finding coordinate matrixX representing the unknown nodes’ location. The algorithm makes nodes distance calculated by coordinates be closer to the real measuring distance. When the difference is smaller, coordinate values in a matrix are close to the real coordinates of nodes. Using the repeated optimization method, find the coordinate matrix X. The first step is to build a function about matrix X as the objective function. Then find the minimization inequality of the objective function. Finally obtain the repeat optimization formula. When the formula reaches its minimum value, X is the coordinate for unknown nodes. Regard the difference square sum between computing distance and the measuring distance as target function of repeated optimization algorithm in MDS technology [8–10].According to the Euclidean Metric, the distance between the unknown nodesi and j can be obtained by (4)
d
i
j
X
=
∑
a
=
1
N
x
i
a
-
x
j
a
2
1
/
2
.According to matrix X, the distance between the unknown node i and the anchor node k can be obtained by(5)
d
i
k
X
,
C
=
∑
a
=
1
N
x
i
a
-
c
k
a
2
1
/
2
.In order to get the coordinate matrix X, we usually use Kruskal’s STRESS formula to set the objective function as follows:(6)
σ
X
=
∑
i
=
1
n
∑
j
=
i
+
1
n
ω
i
j
δ
i
j
-
d
i
j
X
2
+
∑
i
=
1
m
∑
k
=
1
m
υ
i
k
τ
i
k
-
d
i
k
X
,
C
2
=
σ
1
X
+
σ
2
X
,where the weights ω
i
j and υ
i
k decide their corresponding sum’s influence on objective function. This paper applies the calculation method of weight proposed by the literature [6], and weights can be calculated by(7)
ω
i
j
=
exp
⁡
-
δ
i
j
2
η
i
j
2
,
υ
i
k
=
exp
⁡
-
τ
i
k
2
η
i
k
2
.Otherwise, both of them are zero. η
i
j in (7) represents the biggest distance between unknown node i or j and other nodes. η
i
k represents the biggest distance between unknown node i and other nodes or anchor node k. For a given matrix X, the value of corresponding objective function can be obtained according to formula (3). Our goal is to find X, which makes the objective function minimum. Namely, minimize the objective function, and find the optimal solution X of objective function.There are many ways to solve the local minimum problem of repeated optimization method in minimizing the objective function, for example, Dimensionality Reduction, multivalue random testing method, Distance Smoothing, and Tunneling Method. Among those methods, multivalue random testing method may attain good optimal result but it has great randomicity and poor stability. Dimensionality Reduction is complex and large in the amount of calculation in the 3D space environment. Distance Smoothing is simple in calculation and does well in positioning in 2D space environment. But its global search is poor in the 3D space environment [8]. On the contrary, the repeated optimization method based on tunneling can almost find the global optimal value due to cycle search method that first searches in the horizontal direction and then searches in the vertical direction and then searches in the horizontal direction again. Therefore, Tunneling Method used in this paper solves the local minimum problem of repeated optimization algorithm. And the MDS 3D node localization algorithm based on Tunneling Method is proposed.


## 3. MDS Location Algorithm Based on the Tunneling Method

### 3.1. Tunneling Method Algorithm

Tunneling Method is an efficient certain global optimization method which was first proposed by Montalco and Levy. It builds tunneling function in the current local minimum and then gets smaller local minimum through minimizing tunneling function to escape from the current local minima and then cyclic calculation until the global minimum is found. Tunneling function provides a method that uses local optimization to solve global optimization problem. It only requires its target function to be continuously differentiable. The tunneling functions (auxiliary functions) have the same form and the process of seeking errorε is easy [8].Tunneling Method consists of a series of circulations. Every circulation includes two steps: local minimizing step and tunneling step.Step 1 (local minimizing step).
Starting from an initial point, it applies local minimization algorithm, such as quasi-Newton method, gradient method, or the conjugate gradient method, to obtain the first local minimum value pointx
1
∗ of the objective function f
(
x
) [8].Step 2 (tunneling step).
First, define the tunneling function inx
1
∗ as follows: (8)
T
x
,
x
1
∗
=
f
x
-
f
x
1
∗
x
-
x
1
∗
T
x
-
x
1
∗
λ
,where (
x
-
x
1
∗
)
T
(
x
-
x
1
∗
) is called the pole of tunneling function and λ is the strength of (
x
-
x
1
∗
)
T
(
x
-
x
1
∗
). Then it seeks a new point such that T
(
x
,
x
1
∗
)
≤
0; namely, it finds out x
2
∗
≠
x
1
∗ such that f
(
x
2
∗
)
≤
f
(
x
1
∗
). x
2
∗ will be the original point of next circulation until it gets a better minimum point.The key of tunneling function algorithm is how to find the point which meetsT
(
x
,
x
1
∗
)
≤
0. Namely, we apply the minimizing tunneling function to find a local minimum x
2
∗. Several discussions on it are as follows:(i)
Ifx
2
∗
=
x
1
∗, increase λ to make x
1
∗ no longer the local minimum point of T
(
x
,
x
1
∗
). That aim is to avoid getting x
1
∗ again by minimizing T
(
x
,
x
1
∗
) for falling into endless loop.
(ii)
Ifx
2
∗
≠
x
1
∗ and f
(
x
2
∗
)
>
f
(
x
1
∗
), the tunneling function can be constructed as follows:(9)
T
x
,
x
1
∗
=
f
x
-
f
x
1
∗
x
-
x
2
∗
T
x
-
x
2
∗
λ
1
x
-
x
1
∗
T
x
-
x
1
∗
λ
,where λ
1 is the strength of (
x
-
x
2
∗
)
T
(
x
-
x
2
∗
). Selecting the appropriate value of λ
1, the aim is to make x
2
∗ no longer the local minimum point of T
(
x
,
x
1
∗
) and avoid getting x
2
∗ again by minimizing T
(
x
,
x
1
∗
).
(iii)
Ifx
2
∗
≠
x
1
∗ and f
(
x
2
∗
)
<
f
(
x
1
∗
), x
2
∗ is the second original point and then start next circulation.Among the three situations, the former two may appear many times. Every time, tunneling function needs to be rebuilt to minimize the function until the third situation turns up and begins the next circulation. This circulation will never stop until the tunneling function cannot find a smaller local minimum in a certain period of time. The last local minima will be regarded as the global minimum.


### 3.2. MDS Positioning Algorithm Based on Tunneling Method

In order to find another configuration with the same STRESS, the tunneling function must have several characteristics. Some of these characteristics are met by the tunneling function originally defined by Groenen and Heiser [9]. The tunneling function is defined as follows: (10)
τ
X
=
σ
X
-
σ
X
∗
,where X
∗ is the local minimum point of σ
(
X
). The elements of the tunneling function τ
1
X and their purpose are given in Table 1. The final tunneling function τ
1
X can be expressed as follows:(11)
τ
1
X
=
σ
X
-
σ
X
∗
λ
∏
k
=
1
r
ω
+
P
k
X
1
/
r
∏
k
=
1
r
P
k
X
1
/
r
,where P
k
(
X
) is(12)
P
k
X
=
D
k
X
∗
-
D
k
X
w
2
=
∑
i
<
j
ω
i
j
d
i
j
X
∗
-
d
i
j
X
2
,where r represents the number of X
k’s available.Table 1
The elements of the tunneling functionτ
1
(
X
) and their purpose.
Purpose
Element
(1) Zero point if STRESS is equal to local minimum STRESS
τ
X
=
σ
X
-
σ
X
∗
(2) Zero points are the lowest tunneling function values
τ
X
=
σ
X
-
σ
X
∗
(3) Avoid a zero point atX
∗ by erecting a pole
τ
X
=
σ
X
-
σ
X
∗
P
X
(4) Avoid a zero point at irrelevant transformations ofX
∗
P
X
=
D
X
∗
-
D
X
w
2
(5) Ensure sufficiently strong pole (use pole strength parameterλ, 0
<
λ
<
1)
τ
X
=
σ
X
-
σ
X
∗
λ
P
X
(6) Avoid attraction to the horizon
τ
X
=
σ
X
-
σ
X
∗
λ
1
+
1
P
X
(7) Extend working range of the pole (use width parameterω, ω
>
1)
τ
X
=
σ
X
-
σ
X
∗
λ
1
+
ω
P
X
(8) Have multiple poles to avoid differentX
k
τ
1
X
=
σ
X
-
σ
X
∗
λ
∏
k
=
1
r
1
+
ω
P
k
X
1
/
rτ
1
X mentioned above meets all conditions of the tunneling function. The tunneling function is shown as formula (11), which can be treated as the ratio of two functions based on X. Assume that P
(
X
)
>
0. τ
1
X can be written as (13)
τ
1
X
=
M
X
P
X
,where M
(
X
) and N
X are, respectively, as follows:(14)
M
X
=
N
X
ω
+
P
X
,
(15)
N
X
=
σ
X
-
σ
X
∗
λ
.
τ
1
(
X
) can get a certain pole through (14) and (15). Assume that we can find Y, which makes formula (16) right:(16)
τ
1
X
=
M
X
P
X
≤
M
Y
P
Y
=
τ
1
Y
.Let us multiply both sides with P
(
X
). Then we can obtain(17)
M
X
-
M
Y
P
Y
P
X
≤
0or(18)
F
q
,
X
=
M
X
-
q
P
X
≤
0
.We findX that meets F
(
q
,
X
)
<
0, and then τ
1
(
X
)
<
τ
1
(
Y
) is right. As a result, the iterative optimization algorithm will be used to optimize F
(
q
,
X
). Namely, it minimizes optimization τ
1
(
X
).We carry out iterative minimization operations onτ
1
(
X
), since τ
1
(
X
) have the same zero and stagnation point and τ
1
(
X
) is easier to build its optimization framework. For every optimization step and optimization function, using formulas (13), (16), (17), and (18), F
(
q
,
X
) can be got by step-by-step operation. According to formula (18), optimize F
(
q
,
X
) or optimize (19)
M
X
=
N
X
∏
k
=
1
r
P
k
X
+
ω
1
/
r
-
∏
k
=
1
r
P
k
X
1
/
r
.Specific optimization steps are as follows.Step 1.
N
(
X
) will be optimized by optimizing the root of positive function σ
(
X
)
-
σ
(
X
∗
). Assume that there is X
∗ which meets σ
(
X
)
>
σ
(
X
∗
); namely(20)
σ
X
-
σ
X
∗
=
σ
X
-
σ
X
∗
.We verify the update data for each iteration. If the assumption is wrong, then there is σ
(
X
)
≤
σ
(
X
∗
) and the tunneling step will be stopped. Finally X
∗ can be found and optimization of N
(
X
) can be accomplished.Step 2.
Optimize the output ofP
k
(
X
) through d
i
j
(
X
k
) to be instead of δ
i
j in formulas (4), (5), (6), and (7) and then realize the optimization of (21)
∏
k
=
1
r
P
k
X
+
ω
1
/
r
.Step 3.
Optimize the output ofP
k
(
X
) and -
P
k
(
X
) to realize the optimization of (22)
-
∏
k
=
1
r
P
k
X
1
/
r
.The optimization step of P
k
(
X
) is the same as Step  2. According to Cauchy-Schwarz’s inequality, the optimization for d
i
j
(
X
) and -
d
i
j
(
X
) is to realize the optimization for -
P
k
(
X
). The second optimization methods will be used to optimize d
i
j
(
X
) [10]. Then -
d
i
j
(
X
) will be optimized by Holder inequality.F
(
q
,
X
) will be optimized by the steps mentioned above and X will be got which satisfies F
(
q
,
X
)
<
0 and makes formula (16) right. Such cycle can get global minimum and realize global optimization.


### 3.3. Parameters of Tunneling Method

The Tunneling Method needs a pole strength parameter and a pole width parameter. Figure1 is the three-dimensional effect graph of the STRESS function under different strength parameters and width parameters. The strength parameter 1
/
λ is 1
/
1.5,1
/
2,1
/
3
,
…
,
1
/
10, whose number adds up to 18. The width parameters ω are 0.5,1
,
2,3
,
4,5
,
6,7
,
8, whose number adds up to 9. The number of iterations is 1000. We can draw a conclusion from Figure 1 that when strength parameter and width parameter are larger, more iterations are needed to get the same result. But when the strength parameters and width parameters are too small, the result is not what we want. Heiser carried out a lot of experiments and finally concluded that when the strength parameters are 1/3 and width parameter is n
/
4 in Tunneling Method, the result of iteration is the best, where n is the number of iteration elements [8].Figure 1
Strength parameters and width parameters configuration effect chart.
(a)
(b)


## 3.1. Tunneling Method Algorithm

Tunneling Method is an efficient certain global optimization method which was first proposed by Montalco and Levy. It builds tunneling function in the current local minimum and then gets smaller local minimum through minimizing tunneling function to escape from the current local minima and then cyclic calculation until the global minimum is found. Tunneling function provides a method that uses local optimization to solve global optimization problem. It only requires its target function to be continuously differentiable. The tunneling functions (auxiliary functions) have the same form and the process of seeking errorε is easy [8].Tunneling Method consists of a series of circulations. Every circulation includes two steps: local minimizing step and tunneling step.Step 1 (local minimizing step).
Starting from an initial point, it applies local minimization algorithm, such as quasi-Newton method, gradient method, or the conjugate gradient method, to obtain the first local minimum value pointx
1
∗ of the objective function f
(
x
) [8].Step 2 (tunneling step).
First, define the tunneling function inx
1
∗ as follows: (8)
T
x
,
x
1
∗
=
f
x
-
f
x
1
∗
x
-
x
1
∗
T
x
-
x
1
∗
λ
,where (
x
-
x
1
∗
)
T
(
x
-
x
1
∗
) is called the pole of tunneling function and λ is the strength of (
x
-
x
1
∗
)
T
(
x
-
x
1
∗
). Then it seeks a new point such that T
(
x
,
x
1
∗
)
≤
0; namely, it finds out x
2
∗
≠
x
1
∗ such that f
(
x
2
∗
)
≤
f
(
x
1
∗
). x
2
∗ will be the original point of next circulation until it gets a better minimum point.The key of tunneling function algorithm is how to find the point which meetsT
(
x
,
x
1
∗
)
≤
0. Namely, we apply the minimizing tunneling function to find a local minimum x
2
∗. Several discussions on it are as follows:(i)
Ifx
2
∗
=
x
1
∗, increase λ to make x
1
∗ no longer the local minimum point of T
(
x
,
x
1
∗
). That aim is to avoid getting x
1
∗ again by minimizing T
(
x
,
x
1
∗
) for falling into endless loop.
(ii)
Ifx
2
∗
≠
x
1
∗ and f
(
x
2
∗
)
>
f
(
x
1
∗
), the tunneling function can be constructed as follows:(9)
T
x
,
x
1
∗
=
f
x
-
f
x
1
∗
x
-
x
2
∗
T
x
-
x
2
∗
λ
1
x
-
x
1
∗
T
x
-
x
1
∗
λ
,where λ
1 is the strength of (
x
-
x
2
∗
)
T
(
x
-
x
2
∗
). Selecting the appropriate value of λ
1, the aim is to make x
2
∗ no longer the local minimum point of T
(
x
,
x
1
∗
) and avoid getting x
2
∗ again by minimizing T
(
x
,
x
1
∗
).
(iii)
Ifx
2
∗
≠
x
1
∗ and f
(
x
2
∗
)
<
f
(
x
1
∗
), x
2
∗ is the second original point and then start next circulation.Among the three situations, the former two may appear many times. Every time, tunneling function needs to be rebuilt to minimize the function until the third situation turns up and begins the next circulation. This circulation will never stop until the tunneling function cannot find a smaller local minimum in a certain period of time. The last local minima will be regarded as the global minimum.


## 3.2. MDS Positioning Algorithm Based on Tunneling Method

In order to find another configuration with the same STRESS, the tunneling function must have several characteristics. Some of these characteristics are met by the tunneling function originally defined by Groenen and Heiser [9]. The tunneling function is defined as follows: (10)
τ
X
=
σ
X
-
σ
X
∗
,where X
∗ is the local minimum point of σ
(
X
). The elements of the tunneling function τ
1
X and their purpose are given in Table 1. The final tunneling function τ
1
X can be expressed as follows:(11)
τ
1
X
=
σ
X
-
σ
X
∗
λ
∏
k
=
1
r
ω
+
P
k
X
1
/
r
∏
k
=
1
r
P
k
X
1
/
r
,where P
k
(
X
) is(12)
P
k
X
=
D
k
X
∗
-
D
k
X
w
2
=
∑
i
<
j
ω
i
j
d
i
j
X
∗
-
d
i
j
X
2
,where r represents the number of X
k’s available.Table 1
The elements of the tunneling functionτ
1
(
X
) and their purpose.
Purpose
Element
(1) Zero point if STRESS is equal to local minimum STRESS
τ
X
=
σ
X
-
σ
X
∗
(2) Zero points are the lowest tunneling function values
τ
X
=
σ
X
-
σ
X
∗
(3) Avoid a zero point atX
∗ by erecting a pole
τ
X
=
σ
X
-
σ
X
∗
P
X
(4) Avoid a zero point at irrelevant transformations ofX
∗
P
X
=
D
X
∗
-
D
X
w
2
(5) Ensure sufficiently strong pole (use pole strength parameterλ, 0
<
λ
<
1)
τ
X
=
σ
X
-
σ
X
∗
λ
P
X
(6) Avoid attraction to the horizon
τ
X
=
σ
X
-
σ
X
∗
λ
1
+
1
P
X
(7) Extend working range of the pole (use width parameterω, ω
>
1)
τ
X
=
σ
X
-
σ
X
∗
λ
1
+
ω
P
X
(8) Have multiple poles to avoid differentX
k
τ
1
X
=
σ
X
-
σ
X
∗
λ
∏
k
=
1
r
1
+
ω
P
k
X
1
/
rτ
1
X mentioned above meets all conditions of the tunneling function. The tunneling function is shown as formula (11), which can be treated as the ratio of two functions based on X. Assume that P
(
X
)
>
0. τ
1
X can be written as (13)
τ
1
X
=
M
X
P
X
,where M
(
X
) and N
X are, respectively, as follows:(14)
M
X
=
N
X
ω
+
P
X
,
(15)
N
X
=
σ
X
-
σ
X
∗
λ
.
τ
1
(
X
) can get a certain pole through (14) and (15). Assume that we can find Y, which makes formula (16) right:(16)
τ
1
X
=
M
X
P
X
≤
M
Y
P
Y
=
τ
1
Y
.Let us multiply both sides with P
(
X
). Then we can obtain(17)
M
X
-
M
Y
P
Y
P
X
≤
0or(18)
F
q
,
X
=
M
X
-
q
P
X
≤
0
.We findX that meets F
(
q
,
X
)
<
0, and then τ
1
(
X
)
<
τ
1
(
Y
) is right. As a result, the iterative optimization algorithm will be used to optimize F
(
q
,
X
). Namely, it minimizes optimization τ
1
(
X
).We carry out iterative minimization operations onτ
1
(
X
), since τ
1
(
X
) have the same zero and stagnation point and τ
1
(
X
) is easier to build its optimization framework. For every optimization step and optimization function, using formulas (13), (16), (17), and (18), F
(
q
,
X
) can be got by step-by-step operation. According to formula (18), optimize F
(
q
,
X
) or optimize (19)
M
X
=
N
X
∏
k
=
1
r
P
k
X
+
ω
1
/
r
-
∏
k
=
1
r
P
k
X
1
/
r
.Specific optimization steps are as follows.Step 1.
N
(
X
) will be optimized by optimizing the root of positive function σ
(
X
)
-
σ
(
X
∗
). Assume that there is X
∗ which meets σ
(
X
)
>
σ
(
X
∗
); namely(20)
σ
X
-
σ
X
∗
=
σ
X
-
σ
X
∗
.We verify the update data for each iteration. If the assumption is wrong, then there is σ
(
X
)
≤
σ
(
X
∗
) and the tunneling step will be stopped. Finally X
∗ can be found and optimization of N
(
X
) can be accomplished.Step 2.
Optimize the output ofP
k
(
X
) through d
i
j
(
X
k
) to be instead of δ
i
j in formulas (4), (5), (6), and (7) and then realize the optimization of (21)
∏
k
=
1
r
P
k
X
+
ω
1
/
r
.Step 3.
Optimize the output ofP
k
(
X
) and -
P
k
(
X
) to realize the optimization of (22)
-
∏
k
=
1
r
P
k
X
1
/
r
.The optimization step of P
k
(
X
) is the same as Step  2. According to Cauchy-Schwarz’s inequality, the optimization for d
i
j
(
X
) and -
d
i
j
(
X
) is to realize the optimization for -
P
k
(
X
). The second optimization methods will be used to optimize d
i
j
(
X
) [10]. Then -
d
i
j
(
X
) will be optimized by Holder inequality.F
(
q
,
X
) will be optimized by the steps mentioned above and X will be got which satisfies F
(
q
,
X
)
<
0 and makes formula (16) right. Such cycle can get global minimum and realize global optimization.


## 3.3. Parameters of Tunneling Method

The Tunneling Method needs a pole strength parameter and a pole width parameter. Figure1 is the three-dimensional effect graph of the STRESS function under different strength parameters and width parameters. The strength parameter 1
/
λ is 1
/
1.5,1
/
2,1
/
3
,
…
,
1
/
10, whose number adds up to 18. The width parameters ω are 0.5,1
,
2,3
,
4,5
,
6,7
,
8, whose number adds up to 9. The number of iterations is 1000. We can draw a conclusion from Figure 1 that when strength parameter and width parameter are larger, more iterations are needed to get the same result. But when the strength parameters and width parameters are too small, the result is not what we want. Heiser carried out a lot of experiments and finally concluded that when the strength parameters are 1/3 and width parameter is n
/
4 in Tunneling Method, the result of iteration is the best, where n is the number of iteration elements [8].Figure 1
Strength parameters and width parameters configuration effect chart.
(a)
(b)


## 4. Simulation Results and Analysis

The TMDS 3D node localization algorithm simulation is operated on Matlab 2009(a) (64 bits) to research its performance. Analyze TMDS from three aspects: the node communication radius, the number of nodes, and the proportion of anchor node. The simulation environment is described as follows: the size of cube geometric model is 10 m × 10 m × 10 m and the nodes are placed in this model (the node communication radius is the same and all the nodes are stationary). The model is shown in Figure2. Set the simulation environments as follows: when the iteration calculation rule is the same, node communication radius is also the same. Repeated optimization algorithm iterative time is 60. The iterative computation error threshold is 0.0001. Node localization error threshold e
r
r
o
r
_
p is 0.05 m. The error in distance measurement is taken as 15%. When the unknown node location error meets e
r
r
o
r
≤
e
r
r
o
r
_
p, the node will be regarded as the accurate localization of nodes.Figure 2
The distribution map in 3D for unknown node and anchor.


### 4.1. Node Communication Radius Influence on the Performance of the Algorithm

Figure3 shows the impact of node communication radius on the performance of TMDS algorithm. The simulation environment is as follows: the number of unknown nodes N is 50, which randomly distribute in a 10 m ∗ 10 m ∗ 10 m cube model. The number of anchor nodes M is 8, which distribute in the 8 vertex positions of the cube model. Change the node communication radius to analyze its impact on the performance of the algorithm.Figure 3
Node communication radius influence on the performance of TMDS.
(a)
(b)We can draw a conclusion form Figure3(a) that the proportion of accurate positioning nodes will increase with the increase of node communication radius. When the node communication radius increases to 8 m, the number of accurate positioning nodes reaches 50. And with the continuous increase of the node communication radius, accurate positioning of unknown nodes rate will be maintained at 1. We can draw from Figure 3(b) that the average error of accurate positioning of node localization gradually decreases with the increase of node communication radius. When node communication radius increases from 4 m to 8 m, the average error decreases fast. When node communication radius changes from 8 m to 12 m, the error is stable.When the communication radius is small, network connectivity is low, and the number of unknown nodes that can communicate with the node is reduced, and a small node communication radius (R
=
8 m) will get higher accurate positioning node and low node localization error rate in the TMDS test. The positioning result will be stable when the radius is increased.


### 4.2. Influence of Network Nodes on the Performance of TMDS

Figure4 shows that when the node communication radius R is 8, the network node influences the TMDS algorithm. According to the analysis of 4.1, when the communication radius is 8 m, it is easier to analyze other factors influence of nodes on the performance of the algorithm. So in this section, the simulation environment is set as follows: The number of anchor nodes M is 8, which are, respectively, distributed on the 8 vertex positions of the cube model. Nodes have the same radius (R
=
8 m) of communication. Change the proportion of anchor nodes by changing the number of unknown nodes, and then analyze the influence of network nodes on the performance of the algorithm.Figure 4
Influence of network nodes on the performance of TMDS.
(a)
(b)We can draw a conclusion from the curve of Figure4 that, with the number of nodes increasing from 38 to 78, that is, the numbers of unknown nodes increase from 30 to 70, accurate positioning of unknown nodes rate has been 1. When the network nodes number is 83, that is, the unknown nodes number is 75, accurate localization rate begins to decline. The results show that when TMDS algorithm works in an environment of few anchor nodes and many network nodes, the location accuracy of unknown nodes can be maintained at 1. So when the TMDS algorithm works in environment of few anchor nodes, the unknown nodes can be located accurately and the result is significant.


### 4.3. Influence of the Proportion of Anchor Nodes on the Performance of TMDS

Figure5 shows the proportion of anchor nodes influence on the performance of algorithm. The simulation environment is as follows: the number of unknown nodes N is 100, which are randomly distributed in the space model. Eight anchor nodes are distributed in the 8 vertex positions of the cube model, and others are distributed randomly in the space model. All the nodes have the same communication radius (R
=
8 m). Change the number of the anchor nodes to analyze the proportion of anchor impact on the performance of the algorithm.Figure 5
Influence of the proportion of anchor nodes on the performance of TMDS.
(a)
(b)We can draw form Figure5(a) that the number of accurate positioning nodes will increase with the increase of the proportion of anchor nodes. When the proportion of anchor nodes is 0.1, the number of accurate positioning nodes reaches 100. And the proportion of anchor nodes changes from 0.15 to 0.5; the rate of accurate positioning of unknown nodes will be maintained at 100. Namely, when the proportion of anchor nodes is greater than or equal to 0.15, TMDS algorithm can locate the unknown nodes accurately.We can draw from Figure5(b) that the unknown node localization error gradually decreases with the increase of the proportion of anchor nodes. When the proportion of anchor nodes changes from 0.1 to 0.16, the unknown nodes location error decreases fast. When the proportion of anchor nodes changes from 0.16 to 0.5, the average location error fluctuates a little. But the positioning error is within the threshold range. The result of accurate positioning of unknown nodes is stable.


### 4.4. The Comparison between MDS Algorithm and TMDS Algorithm

Tables2 and 3 represent MDS algorithm and TMDS algorithm for 10 times the continuous operation under the same simulation environment, respectively. The content of the table includes the average positioning error of unknown nodes, number of accurate positioning nodes, node location accuracy rate, and the program running time results data. The same simulation environment settings are as follows: the number of anchor nodes M is 8, which are, respectively, distributed on the 8 vertex positions on a cube model; all nodes have the same radius of communication (R
=
8 m).Table 2
MDS algorithm result.
Operation times
1
2
3
4
5
6
7
8
9
10
Average error (m)
0.2881
0.0238
0.0031
0.0144
0.0360
0.0274
0.0162
0.2670
0.0152
0.0226
Number of accurate positioning nodes
4
47
50
50
33
45
50
5
50
48
Node location accuracy rate
0.08
0.94
1
1
0.66
0.9
1
0.1
1
0.96
Program running time (s)
0.142
0.140
0.137
0.136
0.131
0.132
0.137
0.133
0.137
0.138Table 3
TMDS algorithm result.
Operation times
1
2
3
4
5
6
7
8
9
10
Average error (m)
0.0101
0.0147
0.0079
0.0104
0.0197
0.0065
0.0090
0.0064
0.0070
0.0054
Number of accurate positioning nodes
50
50
50
50
49
50
50
50
50
50
Node location accuracy rate
1
1
1
1
0.98
1
1
1
1
1
Program running time (s)
15.754
34.418
17.085
33.918
36.783
33.358
36.259
36.219
36.137
36.363From the accuracy of positioning algorithm, TMDS algorithm can achieve 9 times accurate positioning of all the unknown node in 10 times continuous operation, whose location accuracy rate was 1; only 1 time accurately positioning node number is 49 and its accurate localization rate is 0.98. We can draw from Tables2 and 3 that TMDS algorithm can basically realize accurate positioning of the node. MDS algorithm can achieve 4 times the accurate positioning of all the unknown node in 10 times the continuous operation and have 2 times the low positioning rate, respectively: 0.08 and 0.1.From the running time of the algorithm, TMDS and MDS can complete the algorithm in a relatively short period of time. Time of MDS algorithm that completes the basic algorithm within 13 s~14 s is relatively stable. TMDS takes a long time because of iterative computation of repeated optimization. The selection of the first local minimum value for repeating optimization of the algorithm of iterative calculation is random and the global optimal iterations time is different. The distribution of 50 unknown nodes in model space is random. So the time to complete the positioning of all nodes will be different. To sum up, the Tunneling Method is applied to solve the problem of local minimum value of repeated optimization algorithm and achieves good results in the positioning of WSN.


## 4.1. Node Communication Radius Influence on the Performance of the Algorithm

Figure3 shows the impact of node communication radius on the performance of TMDS algorithm. The simulation environment is as follows: the number of unknown nodes N is 50, which randomly distribute in a 10 m ∗ 10 m ∗ 10 m cube model. The number of anchor nodes M is 8, which distribute in the 8 vertex positions of the cube model. Change the node communication radius to analyze its impact on the performance of the algorithm.Figure 3
Node communication radius influence on the performance of TMDS.
(a)
(b)We can draw a conclusion form Figure3(a) that the proportion of accurate positioning nodes will increase with the increase of node communication radius. When the node communication radius increases to 8 m, the number of accurate positioning nodes reaches 50. And with the continuous increase of the node communication radius, accurate positioning of unknown nodes rate will be maintained at 1. We can draw from Figure 3(b) that the average error of accurate positioning of node localization gradually decreases with the increase of node communication radius. When node communication radius increases from 4 m to 8 m, the average error decreases fast. When node communication radius changes from 8 m to 12 m, the error is stable.When the communication radius is small, network connectivity is low, and the number of unknown nodes that can communicate with the node is reduced, and a small node communication radius (R
=
8 m) will get higher accurate positioning node and low node localization error rate in the TMDS test. The positioning result will be stable when the radius is increased.


## 4.2. Influence of Network Nodes on the Performance of TMDS

Figure4 shows that when the node communication radius R is 8, the network node influences the TMDS algorithm. According to the analysis of 4.1, when the communication radius is 8 m, it is easier to analyze other factors influence of nodes on the performance of the algorithm. So in this section, the simulation environment is set as follows: The number of anchor nodes M is 8, which are, respectively, distributed on the 8 vertex positions of the cube model. Nodes have the same radius (R
=
8 m) of communication. Change the proportion of anchor nodes by changing the number of unknown nodes, and then analyze the influence of network nodes on the performance of the algorithm.Figure 4
Influence of network nodes on the performance of TMDS.
(a)
(b)We can draw a conclusion from the curve of Figure4 that, with the number of nodes increasing from 38 to 78, that is, the numbers of unknown nodes increase from 30 to 70, accurate positioning of unknown nodes rate has been 1. When the network nodes number is 83, that is, the unknown nodes number is 75, accurate localization rate begins to decline. The results show that when TMDS algorithm works in an environment of few anchor nodes and many network nodes, the location accuracy of unknown nodes can be maintained at 1. So when the TMDS algorithm works in environment of few anchor nodes, the unknown nodes can be located accurately and the result is significant.


## 4.3. Influence of the Proportion of Anchor Nodes on the Performance of TMDS

Figure5 shows the proportion of anchor nodes influence on the performance of algorithm. The simulation environment is as follows: the number of unknown nodes N is 100, which are randomly distributed in the space model. Eight anchor nodes are distributed in the 8 vertex positions of the cube model, and others are distributed randomly in the space model. All the nodes have the same communication radius (R
=
8 m). Change the number of the anchor nodes to analyze the proportion of anchor impact on the performance of the algorithm.Figure 5
Influence of the proportion of anchor nodes on the performance of TMDS.
(a)
(b)We can draw form Figure5(a) that the number of accurate positioning nodes will increase with the increase of the proportion of anchor nodes. When the proportion of anchor nodes is 0.1, the number of accurate positioning nodes reaches 100. And the proportion of anchor nodes changes from 0.15 to 0.5; the rate of accurate positioning of unknown nodes will be maintained at 100. Namely, when the proportion of anchor nodes is greater than or equal to 0.15, TMDS algorithm can locate the unknown nodes accurately.We can draw from Figure5(b) that the unknown node localization error gradually decreases with the increase of the proportion of anchor nodes. When the proportion of anchor nodes changes from 0.1 to 0.16, the unknown nodes location error decreases fast. When the proportion of anchor nodes changes from 0.16 to 0.5, the average location error fluctuates a little. But the positioning error is within the threshold range. The result of accurate positioning of unknown nodes is stable.


## 4.4. The Comparison between MDS Algorithm and TMDS Algorithm

Tables2 and 3 represent MDS algorithm and TMDS algorithm for 10 times the continuous operation under the same simulation environment, respectively. The content of the table includes the average positioning error of unknown nodes, number of accurate positioning nodes, node location accuracy rate, and the program running time results data. The same simulation environment settings are as follows: the number of anchor nodes M is 8, which are, respectively, distributed on the 8 vertex positions on a cube model; all nodes have the same radius of communication (R
=
8 m).Table 2
MDS algorithm result.
Operation times
1
2
3
4
5
6
7
8
9
10
Average error (m)
0.2881
0.0238
0.0031
0.0144
0.0360
0.0274
0.0162
0.2670
0.0152
0.0226
Number of accurate positioning nodes
4
47
50
50
33
45
50
5
50
48
Node location accuracy rate
0.08
0.94
1
1
0.66
0.9
1
0.1
1
0.96
Program running time (s)
0.142
0.140
0.137
0.136
0.131
0.132
0.137
0.133
0.137
0.138Table 3
TMDS algorithm result.
Operation times
1
2
3
4
5
6
7
8
9
10
Average error (m)
0.0101
0.0147
0.0079
0.0104
0.0197
0.0065
0.0090
0.0064
0.0070
0.0054
Number of accurate positioning nodes
50
50
50
50
49
50
50
50
50
50
Node location accuracy rate
1
1
1
1
0.98
1
1
1
1
1
Program running time (s)
15.754
34.418
17.085
33.918
36.783
33.358
36.259
36.219
36.137
36.363From the accuracy of positioning algorithm, TMDS algorithm can achieve 9 times accurate positioning of all the unknown node in 10 times continuous operation, whose location accuracy rate was 1; only 1 time accurately positioning node number is 49 and its accurate localization rate is 0.98. We can draw from Tables2 and 3 that TMDS algorithm can basically realize accurate positioning of the node. MDS algorithm can achieve 4 times the accurate positioning of all the unknown node in 10 times the continuous operation and have 2 times the low positioning rate, respectively: 0.08 and 0.1.From the running time of the algorithm, TMDS and MDS can complete the algorithm in a relatively short period of time. Time of MDS algorithm that completes the basic algorithm within 13 s~14 s is relatively stable. TMDS takes a long time because of iterative computation of repeated optimization. The selection of the first local minimum value for repeating optimization of the algorithm of iterative calculation is random and the global optimal iterations time is different. The distribution of 50 unknown nodes in model space is random. So the time to complete the positioning of all nodes will be different. To sum up, the Tunneling Method is applied to solve the problem of local minimum value of repeated optimization algorithm and achieves good results in the positioning of WSN.


## 5. Conclusion

This paper uses the Tunneling Method technology in the WSN 3D node localization and proposes a new 3D wireless sensor network node positioning method based on Tunneling Method algorithm. Innovation points of the TMDS localization algorithm are as follows:(i)
TMDS algorithm is a kind of WSN distributed nodes localization algorithm based on anchor node multidimensional scaling technique. The location algorithm directly calculates the absolute location of the unknown nodes by Euclidean distance between anchor nodes and nodes, without coordinate transformation and network fusion operation. So it avoids the cumulative error.
(ii)
The core of TMDS is a kind of repeated optimization method based on the new anchor nodes. The method is deduced from STRESS algorithm, using Tunneling Method to solve the local minimum problem of repeated optimization method to improve the accuracy of the optimization results.
(iii)
The TMDS algorithm is an improved algorithm based on MDS, which makes use of the difference between the nodes. The calculation results are stable and the stability of the location effect is also better.The tunneling function algorithm is a certain global optimization method. It can search the global minimum point in the minimization problem search and avoid falling into local minimum to get a smaller minimum point. Repeat this process to obtain the global optimal solution. It improves the convergence speed of the algorithm and enhances the ability of the global optimization. The algorithm provides a new method in 3D WSN node positioning. The experimental result shows that the application of the repeated optimization algorithm and global optimization theory in 3D node localization algorithm in WSN improves the rate of accurate positioning of unknown nodes, reduces the unknown node location error, and ensures that the nodes which are randomly distributed in a three-dimensional wireless sensor network can be positioned accurately and stably. In addition, there are several limitations in the proposed method. The tunneling function requires its target function to be continuously differentiable and the search time and computation will increase when WSNs have large scale and high node density.



---

*Source: 2745109-2016-06-02.xml*