Wireless network positioning as a convex feasibility problem
Journal article, 2011

In this semi-tutorial paper, the positioning problem is formulated as a convex feasibility problem (CFP). To solve the CFP for non-cooperative networks, we con- sider the well-known projection onto convex sets (POCS) technique, and study its properties for positioning. We also study outer-approximation (OA) methods to solve CFP problems. We then show how the POCS estimate can be upper bounded by solving a non-convex optimization problem. Moreover, we introduce two tech- niques based on OA and POCS to solve the CFP for cooperative networks and obtain two new distributed algorithms. Simulation results show that the proposed algorithms are robust against non-line-of-sight conditions.

outer approximation

projection onto convex sets

convex feasibility problem

positioning algorithm

wireless sensor network

Author

Mohammad Reza Gholami

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

Henk Wymeersch

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

Erik Ström

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

Mats Rydström

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

Eurasip Journal on Wireless Communications and Networking

1687-1472 (ISSN) 1687-1499 (eISSN)

1 161

Areas of Advance

Information and Communication Technology

Subject Categories

Signal Processing

DOI

10.1186/1687-1499-2011-161

More information

Created

10/7/2017