Location Optimization Based on Improved 3D DV-HOP Algorithm in Wireless Sensor Networks

Abstract

The Distance Vector Hop (DV-HOP) localization algorithm, as a non ranging node localization algorithm, its operation is simple, does not require additional measurement equipment support, with low cost. But wireless sensor network is generally used in three-dimensional complex environment. In response to the low positioning accuracy of this algorithm in an environment with randomly distributed nodes, research is conducted to optimize and improve it. Firstly, by combining multiple communication radii, the hops’ quantity in nodes is decimalized to diminish errors from the hops’ quantity. Then, it calculates the average jump distance of anchor nodes, sets a hop threshold, and eliminates anchor nodes with significant errors. It calculates the range existing anchor nodes and unknown nodes through taking the median. Finally, a particle swarm optimization algorithm was used instead of the maximum likelihood estimation method to obtain the optimized Hop distance correction multi communication radius Particle swarm optimization algorithm DV-HOP (HCMSPSO-DV-HOP) localization algorithm. The improved 3D DV-HOP algorithm was applied to a simulation environment, and through experiments, it was found that the algorithm’s average elapsed time was 0.49 seconds; The average positioning accuracy is 96.40%. Compared to other localization algorithms, the localization algorithm designed by the research institute has good localization performance. It provides technical support for WSN applications in various fields.

Keywords

• 3D DV-HOP algorithm
• wireless sensor network
• node positioning
• particle swarm optimization