A Concave-Convex Procedure for TDOA Based Positioning

This letter investigates the time-difference-of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the ℓ
₁
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.