Improved DV-Hop Localization Algorithm Based on Dynamic Anchor Node Set for Wireless Sensor Networks

Node localization is a key issue in wireless sensor networks (WSN) area, and distance vector hop (DV-Hop) algorithm is widely adopted in WSN localization. Existing DV-Hop based algorithms employ all anchor nodes to localize the unknown node. However there is a large error of the estimated distance from the unknown node to some anchor nodes, which also results in the final unknown node localization error large. To improve the localization accuracy, we propose an improved DV-Hop algorithm based on dynamic anchor node set (DANS IDV-Hop). Differently to the existing DV-Hop based algorithms which apply total anchor nodes, DANS IDV-Hop utilizes part of anchor nodes to participate in localization. Firstly, the selection of anchor nodes is abstracted into a combinatorial optimization problem. For selecting appropriate anchor nodes, a novel binary particle coding scheme and fitness function are designed. Subsequently, the binary particle swarm optimization (BPSO) algorithm is applied to construct the dynamic anchor node set (DANS), and the localization is carried out on the DANS. Finally, the continuous particle swarm optimization (PSO) algorithm is utilized to further optimize the unknown node coordinates. Simulation results show that DANS IDV-Hop has excellent localization accuracy than that of the original DV-Hop and other DV-Hop based improved algorithms.