A Concave-Convex Procedure for TDOA Based Positioning
Journal article, 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

Author

Mohammad Reza Gholami

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Sinan Gezici

Erik Ström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

IEEE Communications Letters

1089-7798 (ISSN)

Vol. To appear

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Signal Processing

More information

Created

10/8/2017