Optimization Online


Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility

Mohammad R. Gholami(moreza***at***chalmers.se)
Luba Tetruashvili(lubate***at***techunix.technion.ac.il)
Erik G. Strom(erik.strom***at***chalmers.se)
Yair Censor(yair***at***math.haifa.ac.il)

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.

Keywords: Positioning, Cooperative wireless sensor network, Parallel projections onto convex sets, Convex feasibility problem, Implicit convex feasibility

Category 1: Applications -- Science and Engineering (Facility Planning and Design )

Category 2: Nonlinear Optimization

Citation: IEEE Transactions on Signal Processing, accepted for publication.

Download: [PDF]

Entry Submitted: 08/20/2013
Entry Accepted: 08/20/2013
Entry Last Modified: 08/20/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society