Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
Journal article, 2013

We propose a distributed positioning algorithm to estimate the unknown positions of a number of target nodes, given distance measurements between target nodes and between target nodes and number of reference nodes at known positions. Based on a geometric interpretation, we formulate the positioning problem as an implicit convex feasibility problem in which some of the sets depend on the unknown target positions, and apply a parallel projection onto convex sets approach to estimate the unknown target node positions. The proposed technique is suitable for parallel implementation in which every target node in parallel can update its position and share the estimate of its location with other targets. We mathematically prove convergence of the proposed algorithm. Simulation results reveal enhanced performance for the proposed approach compared to available techniques based on projections, especially for sparse networks.

NODES

RELAXATION

SOURCE LOCALIZATION

Author

Mohammad Reza Gholami

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Luba Tetruashvili

Erik Ström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Yair Censor

IEEE Transactions on Signal Processing

1053-587X (ISSN)

Vol. 61 23 5830-5840

Areas of Advance

Information and Communication Technology

Subject Categories

Signal Processing

DOI

10.1109/TSP.2013.2279770

More information

Created

10/8/2017