Wireless network positioning as a convex feasibility problem
Department of Signals and Systems, Chalmers University of Technology, Gothenberg, Sweden
EURASIP Journal on Wireless Communications and Networking 2011, 2011:161 doi:10.1186/1687-1499-2011-161Published: 10 November 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 consider 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 techniques 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.