Robust Distributed Positioning Algorithms for Cooperative Networks
Paper in proceedings, 2011

The problem of positioning targets based on distance estimates is studied for cooperative wireless sensor networks when there is limited a priori information about measurements noise. To solve this problem, two different methods of positioning are considered: statistical and geometrical. Based on a geometric interpretation, we show that the positioning problem can be rendered as finding the intersection of a number of convex sets. To find this intersection, we propose two different methods based on projection onto convex sets and outer-approximation. In the statistical approach, a partly novel two-step linear estimator is proposed which can be expressed in a closed-form solution. We also propose a new constrained non-linear least squares algorithm based on constraints derived in the outer-approximation approach. Simulation results show that the geometrical methods are more robust against non-line-of-sight measurements than the statistical approaches while in dense networks with line-of-sight measurements statistical approaches outperform geometrical methods.

Author

Mohammad Reza Gholami

Chalmers, Signals and Systems, Kommunikationssystem, informationsteori och antenner, Communication Systems

Henk Wymeersch

Chalmers, Signals and Systems, Kommunikationssystem, informationsteori och antenner, Communication Systems

Erik Ström

Chalmers, Signals and Systems, Kommunikationssystem, informationsteori och antenner, Communication Systems

Mats Rydström

Chalmers, Signals and Systems, Kommunikationssystem, informationsteori och antenner, Communication Systems

The 12th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

156 - 160 5990384

Areas of Advance

Information and Communication Technology

Subject Categories

Signal Processing

DOI

10.1109/SPAWC.2011.5990384

ISBN

978-1-4244-9332-6

More information

Created

10/8/2017