Cooperative and Distributed Localization for Wireless Sensor Networks in Multipath Environments

We consider the problem of sensor localization in a wireless network in a multipath environment, where time and angle of arrival information are available at each sensor. We propose a distributed algorithm based on belief propagation, which allows sensors to cooperatively self-localize with respect to one single anchor in a multihop network. The algorithm has low overhead and is scalable. Simulations show that although the network is loopy, the proposed algorithm converges, and achieves good localization accuracy

Reducing communication overhead for cooperative localization using nonparametric belief propagation

A number of methods for cooperative localization has been proposed, but most of them provide only location estimate, without associated uncertainty. On the other hand, nonparametric belief propagation (NBP), which provides approximated posterior distributions of the location estimates, is expensive mostly because of the transmission of the particles. In this paper, we propose a novel approach to reduce communication overhead for cooperative positioning using NBP. It is based on: i) communication of the beliefs (instead of the messages), ii) approximation of the belief with Gaussian mixture of very few components, and iii) censoring. According to our simulations results, these modifications reduce significantly communication overhead while providing the estimates almost as accurate as the transmission of the particles

Localization in wireless sensor networks with gradient descent

In this article, we present two distance-based sensor network localization algorithms. The location of the sensors is unknown initially and we can estimate the relative locations of sensors by using knowledge of inter-sensor distance measurements. Together with the knowledge of the absolute locations of three or more sensors, we can also determine the locations of all the sensors in the wireless network. The proposed algorithms make use of gradient descent to achieve excellent localization accuracy. The two gradient descent algorithms are iterative in nature and result is obtained when there is no further improvement on the accuracy. Simulation results have shown that the proposed algorithms have better performance than existing localization algorithms. A comparison of different methods is given in the paper. © 2011 IEEE.published_or_final_versionThe 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim), Victoria, B.C., 23-26 August 2011. In IEEE PacRim Conference Proceedings, 2011, p. 91-9

Soft-connected Rigid Body Localization: State-of-the-Art and Research Directions for 6G

This white paper describes a proposed article that will aim to provide a thorough study of the evolution of the typical paradigm of wireless localization (WL), which is based on a single point model of each target, towards wireless rigid body localization (W-RBL). We also look beyond the concept of RBL itself, whereby each target is modeled as an independent multi-point three-dimensional (3D), with shape enforced via a set of conformation constraints, as a step towards a more general approach we refer to as soft-connected RBL, whereby an ensemble of several objects embedded in a given environment, is modeled as a set of soft-connected 3D objects, with rigid and soft conformation constraints enforced within each object and among them, respectively. A first intended contribution of the full version of this article is a compact but comprehensive survey on mechanisms to evolve WL algorithms in W-RBL schemes, considering their peculiarities in terms of the type of information, mathematical approach, and features the build on or offer. A subsequent contribution is a discussion of mechanisms to extend W-RBL techniques to soft-connected rigid body localization (SCW-RBL) algorithms

Robust Component-based Network Localization with Noisy Range Measurements

Accurate and robust localization is crucial for wireless ad-hoc and sensor networks. Among the localization techniques, component-based methods advance themselves for conquering network sparseness and anchor sparseness. But component-based methods are sensitive to ranging noises, which may cause a huge accumulated error either in component realization or merging process. This paper presents three results for robust component-based localization under ranging noises. (1) For a rigid graph component, a novel method is proposed to evaluate the graph's possible number of flip ambiguities under noises. In particular, graph's \emph{MInimal sepaRators that are neaRly cOllineaR (MIRROR)} is presented as the cause of flip ambiguity, and the number of MIRRORs indicates the possible number of flip ambiguities under noise. (2) Then the sensitivity of a graph's local deforming regarding ranging noises is investigated by perturbation analysis. A novel Ranging Sensitivity Matrix (RSM) is proposed to estimate the node location perturbations due to ranging noises. (3) By evaluating component robustness via the flipping and the local deforming risks, a Robust Component Generation and Realization (RCGR) algorithm is developed, which generates components based on the robustness metrics. RCGR was evaluated by simulations, which showed much better noise resistance and locating accuracy improvements than state-of-the-art of component-based localization algorithms.Comment: 9 pages, 15 figures, ICCCN 2018, Hangzhou, Chin