A concave-convex procedure for TDOA based positioning
IEEE Communications Letters
765 - 768
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21069
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.