Wireless network positioning as a convex feasibility problem

Mohammad Reza Gholami, Henk Wymeersch, Erik G Ström, Mats Rydström
2011 EURASIP Journal on Wireless Communications and Networking  
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
more » ... ed 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.
doi:10.1186/1687-1499-2011-161 fatcat:3xyl7brvhnahrna3sdlqihy73e