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 2056445701 1966679468 2143229717
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. 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. The location of people, mobile terminals and equipment is highly desirable for operational enhancements in the mining industry. In an indoor environment such as a mine, the multipath caused by reflection, diffraction and diffusion on the rough sidewall surfaces, and the non-line of sight (NLOS) due to the blockage of the shortest direct path between transmitter and receiver are the main sources of range measurement errors. Unreliable measurements of location metrics such as received signal strengths (RSS), angles of arrival (AOA) and times of arrival (TOA) or time differences of arrival (TDOA), result in the deterioration of the positioning performance. Hence, alternatives to the traditional parametric geolocation techniques have to be considered. In this paper, we present a novel method for mobile station location using wideband channel measurement results applied to an artificial neural network (ANN). The proposed system, the wide band neural network-locate (WBNN-locate), learns off-line the location 'signatures' from the extracted location-dependent features of the measured channel impulse responses for line of sight (LOS) and non-line of sight (NLOS) situations. It then matches on-line the observation received from a mobile station against the learned set of 'signatures' to accurately locate its position. The location accuracy of the proposed system, applied in an underground mine, has been found to be 2 meters for 90 and 80 of trained and untrained data, respectively. Moreover, the proposed system may also be applicable to any other indoor situation and particularly in confined environments with characteristics similar to those of a mine (e.g. rough sidewalls surface). Recent advances in miniaturization and low-cost, low-power design have led to active research in large-scale networks of small, wireless, low-power sensors and actuators. Time synchronization is critical in sensor networks for diverse purposes including sensor data fusion, coordinated actuation, and power-efficient duty cycling. Though the clock accuracy and precision requirements are often stricter than in traditional distributed systems, strict energy constraints limit the resources available to meet these goals.We present Reference-Broadcast Synchronization, a scheme in which nodes send reference beacons to their neighbors using physical-layer broadcasts. A reference broadcast does not contain an explicit timestamp; instead, receivers use its arrival time as a point of reference for comparing their clocks. In this paper, we use measurements from two wireless implementations to show that removing the sender's nondeterminism from the critical path in this way produces high-precision clock agreement (1.85 ± 1.28μsec, using off-the-shelf 802.11 wireless Ethernet), while using minimal energy. We also describe a novel algorithm that uses this same broadcast property to federate clocks across broadcast domains with a slow decay in precision (3.68 ± 2.57μsec after 4 hops). RBS can be used without external references, forming a precise relative timescale, or can maintain microsecond-level synchronization to an external timescale such as UTC. We show a significant improvement over the Network Time Protocol (NTP) under similar conditions.