Research On Wireless Sensor Network Positioning Algorithm Based On DV-hop

Wireless sensor network(WSN)has been fully studied and developed in the Internet age because of its ability to perceive,transmit and process the regional information efficiently and easily through collaborative means.In the course of constructing wireless sensor network,the sensor node is usually randomly broadcast in the target area or evenly deployed in a specific area for data collection and transmission.In the research of wireless sensor network,location technology is an important theoretical foundation,and it is also an indispensable link in the application of data monitoring,communication and management related to wireless sensor network.If the node location information is not accurate,it will have a direct impact on the further research data information;It may even cause major mistakes in related research work,wasting resources and failing to reach the expected goals.Therefore,it has become an important issue in the research of wireless sensor network to study how to locate the node accurately.The positioning algorithm of the wireless sensor network can be divided into a Range-based positioning algorithm and a range-free positioning algorithm.The location algorithm based on ranging needs the support of the external equipment,and the measurement is accurate.However,the measurement equipment is limited in the complex environment and can not achieve the better positioning effect.The location algorithm that does not require ranging can estimate the location of unknown nodes only through network node related information.It does not require external hardware equipment support and is cheap.In the unmeasured location algorithm,the DV-Hop positioning algorithm has become a popular algorithm that attracts the attention and research of a large number of scholars because of its simple,easy to implement,and acceptable positioning accuracy compared to other algorithms.This paper analyzes the principle and error of DV-Hop positioning algorithm,studies the literature data of DV-Hop improved algorithm,and discusses and improves DV-Hop positioning algorithm.main tasks are:Through the analysis and study of the nature and principle of the DV-Hop algorithm,it is understood that the reasons for the error of the algorithm are divided into subjective and objective aspects.The subjective aspect is mainly due to the improper proportion of anchor nodes in the network nodes and the unreasonable algorithm itself,which causes errors in the calculation of the number of jumps between anchor nodes and unknown nodesin the network and the calculation of the average distance value per jump.The objective aspect is mainly caused by the random distribution of nodes and the existence of complex environments,obstacles,or equipment failures.An improved DV-Hop location algorithm based on obstacles is proposed.According to the shortcomings of DV-Hop algorithm,in order to reduce the accumulation of errors,the data transmission range of nodes is limited.Then,according to the error caused by the obstruction blocking node information propagation in the monitoring environment,the anchor node is screened to improve the average jump distance of the anchor node.Then the error of the average jump distance of the anchor node is calculated,and the error weighted correction of the average jump distance is carried out according to the error.In order to calculate the distance between unknown node and anchor node by means of trigonometric function combined with the exact distance between the two anchor nodes,the positioning result is more accurate.Finally,the particle swarm optimization algorithm is used to optimize the positioning node.The simulation results show that the improved positioning algorithm can improve the accuracy of the traditional algorithm and reduce the error of the location.A new algorithm based on convex optimization is proposed for the location of WSN-based obstacle environment.For the DV-Hope algorithm in the positioning process,due to the error in the estimation of the average distance per jump,the number of jumps caused by the random distribution of nodes is caused by the number of jumps.As a result,the distance error between the unknown node and the anchor node jump section causes the problem of low positioning accuracy to be optimized.Since the local optimal solution to the convex optimization problem must be the characteristic of the global optimal solution,the optimal solution of the optimization problem can be obtained iteratively,which greatly reduces the difficulty of calculation.The simulation results show that the DV-Hop improved algorithm reduces the error and improves the positioning accuracy of the node without adding additional equipment.Through the study of the structure characteristics of wireless sensor network and WSN network positioning algorithm,this paper analyzes the causes of error and improves the accuracy of the network positioning by optimizing the DV-Hop algorithm at each positioning stage according to different conditions.Enhanced its applicability.