We consider the problem of precise range estimation between pairs of moving vehicles using periodic broadcast messages. The transmitter and receivers are not time synchronized and one needs to explicitly account for the clock offset and clock drift in addition to the vehicle motion to obtain accurate range estimates. We develop a range estimation algorithm based on a local polynomial smoothing of the vehicle motion and experimentally verify that the performance is close to that obtained using unicast round-trip time ranging. This broadcast approach is of interest particularly in the context of dedicated short-range communications (DSRC) wherein periodic broadcast safety messages are exchanged between vehicles. We propose to exploit these broadcast messages to perform ranging. Our scheme requires additional timestamp information to be transmitted as part of the DSRC messages, and we develop a novel timestamp compression algorithm to minimize the resulting overhead. We validate our proposed algorithm on experimental data and show that it is able to achieve sub-meter ranging accuracies in vehicular scenarios.
RTT-based systems are popular and well studied in various contexts. The IEEE 802.11mc task group defines a Fine-Timing-Measurement (FTM) protocol @cite_11 for RTT ranging in the WiFi signal spectrum. As described before, this eliminates the need for clock synchronization, but is inherently unicast in nature. There are quite a few works in the literature that consider the problem of range and location estimation in the presence of unknown clock offsets @cite_18 @cite_10 @cite_6 . Most of these are in the context of location estimation, wherein the location of a node or a set of nodes needs to be estimated from ranging measurements. These works explore the joint estimation of locations and clock offsets. The problem of joint estimation of clock parameters and distances between pairs of mobile nodes is considered in @cite_5 , which makes use of the local smoothness of the node trajectories to solve for the unknown variables.
@cite_18 @cite_6 @cite_5 @cite_10 @cite_11
2160625863 2087834451 2056445701 2101764391
Time-based localization approaches attract a lot of interest due to their high accuracy and potentially low cost for wireless sensor networks (WSNs). However, time-based localization is tightly coupled with clock synchronization. Thus, the reliability of timestamps in time-based localization becomes an important yet challenging task to deal with. In this paper, we propose robust time-based localization strategies to locate a target node with the help of anchors (nodes with known positions) in asynchronous networks. Two kinds of asynchronous networks are considered: one only with clock offsets, labeled quasi-synchronous networks, whereas the other with not only clock offsets but also clock skews, labeled fully asynchronous networks. A novel ranging protocol is developed for both networks, namely asymmetric trip ranging (ATR), to reduce the communication load and explore the broadcast property of WSNs. Regardless of the reliability of the timestamp report from the target node, closed-form least-squares (LS) estimators are derived to accurately estimate the target node position. As a result, we counter the uncertainties caused by the target node by ignoring the timestamps from this node. Furthermore, in order to simplify the estimator in fully asynchronous networks, localization and synchronization are decoupled. A simple yet efficient method is proposed to first Calibrate the Clock Skews of the anchors, and then Estimate the Node Position (CCS-ENP). Finally, Cramer-Rao bounds (CRBs) and simulation results corroborate the efficiency of our localization schemes. An asynchronous position measurement system is proposed for indoor localization in this paper. The demonstrated system consists of a UWB transmitter and several energy detection receivers whose positions are known. The position measurement process starts with the locator emitting a UWB pulse. Upon arrival, the pulse is amplified and retransmitted by the target to be located. Signals from both the locator and the target are captured by the receivers. No synchronization mechanism is implemented. Instead, the proposed system measures the differential TOA between the direct coupling signal of the locator and the target signal. Together with the knowledge of the locator transmitter and receiver positions, the absolute range that the pulse travels can be calculated. The sum of transmitter-target range and target-receiver range defines an ellipse and the target resides on the intersections of several such ellipses. It is shown via the Cramer-Rao lower bound that the absolute-range-based elliptical localization is potentially more accurate than the relative-range-based hyperbolic localization. Our proposed system is able to achieve positioning error bound comparable to synchronous absolute-range-based localization systems while eliminating the cost of synchronization. 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 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 functions of true time. For a pair of nodes, a 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 solution is nonexistent without a constraint on the cost function e.g., a clock reference node. Ergo, a constrained framework is proposed and a new Constrained Cramer–Rao Bound (CCRB) is derived for the joint time-range model. In addition, to alleviate the need for a single clock reference, various clock constraints are presented and their benefits are investigated using the proposed solutions. Simulations are conducted and the algorithms are shown to approach the theoretical limits. Recently, a few efficient timing synchronization protocols for wireless sensor networks (WSNs) have been proposed with the goal of maximizing the accuracy and minimizing the power utilization. This paper proposes novel clock skew estimators assuming different delay environments to achieve energy-efficient network-wide synchronization for WSNs. The proposed clock skew correction mechanism significantly increases the re-synchronization period, which is a critical factor in reducing the overall power consumption. The proposed synchronization scheme can be applied to the conventional protocols without additional overheads. Moreover, this paper derives the Cramer-Rao lower bounds and the maximum likelihood estimators under different delay models and assumptions. These analytical metrics serves as good benchmarks for the thus far reported experimental results