pith. sign in

arxiv: 1407.5616 · v1 · pith:BO367DVVnew · submitted 2014-07-19 · 📊 stat.AP · cs.IT· math.IT

TW-TOA Based Positioning in the Presence of Clock Imperfections

classification 📊 stat.AP cs.ITmath.IT
keywords approachformulatedleastpositioningproblemsolvedtw-toaabsolute
0
0 comments X
read the original abstract

This paper studies the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in asynchronous wireless sensor networks. Since the optimal estimator for this problem involves difficult nonconvex optimization, we propose two suboptimal estimators based on squared-range least squares and least absolute mean of residual errors. The former approach is formulated as a general trust region subproblem which can be solved exactly under mild conditions. The latter approach is formulated as a difference of convex functions programming (DCP), which can be solved using a concave-convex procedure. Simulation results illustrate the high performance of the proposed techniques, especially for the DCP approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.