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.
9 January 2024 in IEEE Transactions on Vehicular Technology
Current range-free node localization method experiences low localization accuracy in sparse anchors wireless sensor networks (WSN). To this end, a novel range-free node localization model based on minimize maximum error criterion is proposed in this letter. Moreover, an iterative localization algorithm called MinMax-DV-hop is proposed to tackle the nonconvex and non-differentiable objective function of proposed model too. Specifically, auxiliary variable is introduced to recast the minimum-maximum optimization into one with a linear object function, convex constraints and nonconvex constraints. And then, nonconvex constraints are tightened to linear inequality constraints by using its first-order Taylor expansions, thus a successive convex approximation method can be designed to iteratively solve the optimization problem finally. Simulations show that the MinMax-DV-hop experiences higher localization accuracy in sparse anchors WSN than those of the comparisons algorithm.