Distributed networked localization using neighboring distances only through a computational topology control approach

Abstract

For large-scale wireless sensor networks, the nonlinear localization problem where only neighboring distances are available to each individual sensor nodes have been attracting great research attention. In general, distributed algorithms for this problem are likely to suffer from the failures that localizations are trapped in local minima. Focusing on this issue, this article considers a fully distributed algorithm by introducing a novel mechanism, where each individual node is allowed to computationally interact with a random subset of its neighbors, for helping localizations escape from local minima. Theoretical analyses reveal that with the proposed algorithm, any local minimum of the localization will be unstable, and the global optimum would finally be achieved with probability 1 after enough time of iterations. Numerical simulations are given as well to demonstrate the effectiveness of the algorithm.

Robust Inter-Vehicle Distance Measurement Using Cooperative Vehicle Localization

“…In addition to single-vehicle localization, some safety-critical CAV applications, e.g., vehicle platoon, require accurate measurement of the inter-vehicle distance (IVD) [ 12 , 13 , 14 ]. The simplest IVD estimation method is differencing the vehicles’ position directly.…”

MNCE: Multi-Hop Node Localization Algorithm for Wireless Sensor Network Based on Error Correction

“…If an anomaly is detected, a response mechanism is triggered to respond. However, regardless of the direction to which it is applied, the information monitored by the sensor node deployed in the specified area will only work if location information is attached [3]. Otherwise, the information is meaningless.…”