Skip to Main Content
This work considers localization of nodes in a sensor network using distance measurements. Recent methods favor projection onto convex sets (POCS), since it overcomes the multimodality problem that plagues least-squares formulations. Previous efforts in this direction require either that the sensor be located in the convex hull of the anchor nodes, or that complicated hyperbolic geometric calculations be employed. Here we propose a new algorithm which projects onto the boundary of convex sets, and features a computationally simple update procedure. Both cyclic and random projection schedules are considered, and initial convergence proofs are offered.
Date of Conference: 18-20 March 2009