A Novel Range-Free Node Localization Method for Wireless Sensor Networks
Yong Jin, Lin Zhou, Lu Zhang, Zhentao Hu, Jing Han
Abstract
Solving the nonconvex and non-differentiable objective function of traditional range-free node localization methods will result in low localization accuracy or high computational complexity. To this end, a novel iterative localization algorithm called CVX-DV-hop is proposed in this letter. It first performs matrix transformation to reformulate the original optimization problem into one with a convex function and nonconvex constraints. And then, the first-order Taylor expansions are employed to tighten the nonconvex constraints into linear inequality constraints. Finally, a successive convex approximation method is designed to iteratively solve the optimization problem. Simulation results show that the proposed algorithm has higher localization accuracy and lower computational burden than those of the particle swarm optimization algorithm.