Wireless network positioning as a convex feasibility problem
Artikel i vetenskaplig tidskrift, 2011

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 con- sider 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 tech- niques based 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.

outer approximation

projection onto convex sets

convex feasibility problem

positioning algorithm

wireless sensor network

Författare

Mohammad Reza Gholami

Chalmers, Signaler och system, Kommunikations- och antennsystem, Kommunikationssystem

Henk Wymeersch

Chalmers, Signaler och system, Kommunikations- och antennsystem, Kommunikationssystem

Erik Ström

Chalmers, Signaler och system, Kommunikations- och antennsystem, Kommunikationssystem

Mats Rydström

Chalmers, Signaler och system, Kommunikations- och antennsystem, Kommunikationssystem

Eurasip Journal on Wireless Communications and Networking

1687-1472 (ISSN) 1687-1499 (eISSN)

1 161

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Signalbehandling

DOI

10.1186/1687-1499-2011-161

Mer information

Skapat

2017-10-07