{"paper":{"title":"TW-TOA Based Positioning in the Presence of Clock Imperfections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.AP","authors_text":"Erik G. Str\\\"om, Mohammad Reza Gholami, Sinan Gezici","submitted_at":"2014-07-19T12:13:45Z","abstract_excerpt":"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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5616","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}