A concave-convex procedure for TDOA based positioning
Date
2013
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
IEEE Communications Letters
Print ISSN
1089-7798
Electronic ISSN
Publisher
IEEE
Volume
17
Issue
4
Pages
765 - 768
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
This letter investigates the time-difference-of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the ℓ1 norm, minimization of the residual errors and formulate the positioning problem as a difference of convex functions (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. © 1997-2012 IEEE.