CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility

Mohammad Reza Gholami (Institutionen för signaler och system, Kommunikationssystem) ; Luba Tetruashvili ; Erik G. Ström (Institutionen för signaler och system, Kommunikationssystem) ; Yair Censor
IEEE Transactions on Signal Processing (1053-587X). Vol. 61 (2013), 23, p. 5830-5840.
[Artikel, refereegranskad vetenskaplig]

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 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.

Nyckelord: SOURCE LOCALIZATION, RELAXATION, NODES



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-08-20. Senast ändrad 2013-12-16.
CPL Pubid: 181818

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)