Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
From MaRDI portal
Abstract: We propose a distributed positioning algorithm to estimate the unknown positions of a number of target nodes, given distance measurements between target nodes and between target nodes and a number of reference nodes at known positions. Based on a geometric interpretation, we formulate the positioning problem as an implicit convex feasibility problem in which some of the sets depend on the unknown target positions, and apply a parallel projection onto convex sets approach to estimate the unknown target node positions. The proposed technique is suitable for parallel implementation in which every target node in parallel can update its position and share the estimate of its location with other targets. We mathematically prove convergence of the proposed algorithm. Simulation results reveal enhanced performance for the proposed approach compared to available techniques based on projections, especially for sparse networks.
Cited in
(5)- Adaptive subgradient method for the split quasi-convex feasibility problems
- Douglas-Rachford feasibility methods for matrix completion problems
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- A note on the moment problem for codimension greater than 1
- Single landmark based collaborative multi-agent localization with time-varying range measurements and information sharing
This page was built for publication: Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578830)
