Table of Content

Open Access


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.

Received 20 May 2020; Accepted 15 August 2020; Issue published 22 September 2020


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.


Wireless localization; non-linear programming; time difference of arrival; newton Iteration

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.

This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1460


  • 932


  • 0


Share Link

WeChat scan