Open Access
ARTICLE
Non-Linear Localization Algorithm Based on Newton Iterations
Jianfeng Lu*, Guirong Fei
Institute of Information Technology, Taizhou Polytechnic College, Taizhou, 225300, China
* Corresponding Author: Jianfeng Lu. Email:
Journal on Internet of Things 2020, 2(4), 129-134. https://doi.org/10.32604/jiot.2020.07196
Received 20 May 2020; Accepted 15 August 2020; Issue published 22 September 2020
Abstract
In order to improve the performance of time difference of arrival
(TDOA) localization, a nonlinear least squares algorithm is proposed in this
paper. Firstly, based on the criterion of the minimized sum of square error of
time difference of arrival, the location estimation is expressed as an optimal
problem of a non-linear programming. Then, an initial point is obtained using the
semi-definite programming. And finally, the location is extracted from the local
optimal solution acquired by Newton iterations. Simulation results show that
when the number of anchor nodes is large, the performance of the proposed
algorithm will be significantly better than that of semi-definite programming
approach with the increase of measurement noise.
Keywords
Cite This Article
J. Lu and G. Fei, "Non-linear localization algorithm based on newton iterations,"
Journal on Internet of Things, vol. 2, no.4, pp. 129–134, 2020. https://doi.org/10.32604/jiot.2020.07196