Joint ranging and synchronization for an anchorless network of mobile nodes
Raj Thilak Rajan, Alle-Jan van der Veen

TL;DR
This paper introduces a joint model for ranging and synchronization in mobile wireless networks, proposing algorithms that estimate clock parameters and distances simultaneously, and demonstrating near-optimal performance through simulations.
Contribution
It presents a novel joint time-range model for mobile nodes and develops a global least squares algorithm with a constrained CCRB analysis, advancing synchronization and localization methods.
Findings
Proposed algorithms approach theoretical performance limits.
Joint estimation improves synchronization and ranging accuracy.
Simulations validate the effectiveness of the proposed methods.
Abstract
Synchronization and localization are critical challenges for the coherent functioning of a wireless network, which are conventionally solved independently. Recently, various estimators have been proposed for pairwise synchronization between immobile nodes, based on time stamp exchanges via two-way communication. In this paper, we consider a \textit{network of mobile nodes} for which a novel joint time-range model is presented, treating both unsynchronized clocks and the pairwise distances as a polynomial function of \textit{true} time. For a set of nodes, a pairwise least squares solution is proposed for estimating the pairwise range parameters between the nodes, in addition to estimating the clock offsets and clock skews. Extending these pairwise solutions to network-wide ranging and clock synchronization, we present a central data fusion based global least squares algorithm. A unique…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
