Asynchronous Time-of-Arrival-Based Source Localization With Sensor Position Uncertainties

• Published in: IEEE communications letters 2016-09, Vol.20 (9), p.1860-1863
• Main Authors: Zou, Yanbin, Wan, Qun
• Format: Article
• Language: English
• Subjects: Maximum likelihood estimation; Optimization; Position measurement; Programming; Robustness; semidefinite programming (SDP); Simulation; Source localization; Time measurement; time-of-arrival (TOA)
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2016.2589930

This letter considers the problem of source localization from signal time-of-arrival measurements with unknown start transmission time and sensor position uncertainties. Under the standard assumption of uncorrelated Gaussian distributed measurement errors, we formulate the maximum likelihood estimator (MLE). It is well known that minimization of a nonlinear and nonconvex MLE cost function is not a trivial problem. We use the semidefinite programming (SDP) method to convert the nonconvex MLE problem into convex problem. However, it is shown that the original SDP algorithm is not tight and cannot provide a high-quality solution. Previous research call the untightness of the original SDP algorithm as ambiguity, and they propose to add a penalty term to avoid the ambiguity. In this letter, we show that jointly adding the second-order-cone constraints and penalty term can significantly improve the tightness of the original SDP algorithm. Simulation results are included to evaluate the localization accuracy of the proposed algorithms by comparing with the state-of-the-art methods and the optimality benchmark of Cramér-Rao lower bound.