A Concave-Convex Procedure for TDOA Based Positioning
Artikel i vetenskaplig tidskrift, 2013

This letter investigates the time-difference- of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the l1 norm, minimization of the residual errors and formulate the positioning problem as a difference of convex function (DC) programming. We then employ a concave-convex procedure to solve the corresponding DC programming. Simulation results illustrate the improved performance of the proposed approach compared to existing methods.

difference of convex programming.

concave-convex pro- cedure

time-difference- of-arrival (TDOA)

DC programming

Wireless sensor network

Författare

Mohammad Reza Gholami

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

Sinan Gezici

Erik Ström

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

IEEE Communications Letters

1089-7798 (ISSN)

Vol. To appear

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

Signalbehandling

Mer information

Skapat

2017-10-08