Research On DV-Hop Localization Algorithm Based On Wireless Sensor Network

Wireless sensor network is a wireless network composed of a group of sensor nodes in a selforganized networking mode.It is a new technology that integrates multiple disciplines.It involves many fields such as modern military,medical health,forest fire monitoring and precision agriculture,and has extremely broad application prospects.Node localization technologies play an important role in realizing these applications.Among them,the distance vector hop(DV-Hop)algorithm,as a distributed non-ranging positioning algorithm,provides a simple,feasible and low-cost solution for the location-based service of sensor nodes,which has attracted widespread attention.This paper mainly solving the problem that the DV-Hop localization algorithm has poor localization effect under the complex network model,and proposes related improvement schemes.The main research contents and work are as follows:(1)In-depth analysis of wireless sensor network and its related positioning technology.Firstly,the internal structure,key technologies,popular applications and related localization algorithms of wireless sensor network are introduced.Secondly,the basic realization principle of the DV-Hop positioning algorithm,the reason for the error and the existing improvement scheme are mainly studied.(2)In order to slove the problem that the DV-Hop localization algorithm has poor localization effect in the irregular network topology environment,an improved optimal weighted DV-Hop localization algorithm(IOWDV-Hop)by integrating the optimal anchor node and the geometric constraint correction strategy is proposed.The algorithm uses the fourth power of the reciprocal hop count from the unknown node to the anchor node as the optimal weight function,and calculates the coordinates of the unknown node by weighted least squares;at the same time,the minimum error discrimination mechanism is used to select the best anchor node to participate in the calculation of the positioning result.Finally,for the problem of poor localization effect of nodes at the boundary of irregular regions,the geometric constraint algorithm is used to correct the abnormally located node positions.The experimental results show that in the four irregular network scenarios of C-shaped,Fshaped,L-shaped and H-shaped,the improved algorithm in this paper has higher positioning accuracy than other existing algorithms.(3)The distance measurement error of the DV-Hop positioning algorithm is large,and the standard particle swarm optimization algorithm is easy to fall into the local optimum problem when estimating the node position.An improved region-limited hybrid firefly particle swarm optimization DV-Hop localization algorithm(IRHFPSODV-Hop)is proposed.In the average hop distance ranging stage,the algorithm optimizes the average hop distance between anchor nodes using the idea of least mean square weighting and error factor correction,and uses the Min-Max positioning algorithm to limit the initial area where the unknown nodes are located.Finally,using the hybrid firefly particle swarm optimization algorithm,the positions of the unknown nodes are optimized.The experimental results show that in the square regular area and the O-shaped irregular area,the improved algorithm in this paper has strong environmental applicability and better positioning effect.