Research On Location Algorithm Of Wireless Sensor Network Based On DV-hop

Wireless Sensor Networks(WSN)is considered as one of the hot spots in recent years.In the past few years,many domestic and foreign scholars have carried out research work and the wireless sensor network has been rapidly developed.Wireless sensor networks are widely used in important fields such as health care,public safety,industrial control,environmental monitoring,smart home,defense and military affairs.WSN monitor and control a series of activities through the sensor node.To know their location,sensor nodes will be more meaningful,more help for the event,but the price of beacon nodes is more expensive than the unknown node,all node used as beacon node is not realistic,at this time you need to location technical support,with a small number of beacon nodes can be calculated around the location of unknown nodes.Node location is one of the hot spots in wireless sensor networks,and high-precision positioning is considered as one of the most challenging hot spots in wireless sensor networks.Many scholars put forward many improvements to the positioning algorithm to improve the positioning accuracy.This article also aims to improve the positioning accuracy of the DV-Hop algorithm,proposed two improved algorithms.The main work of this paper is as follows:(1)Briefly describe research background and significance of wireless sensor networks node location,consult the research status at home and abroad,analyze and summarize DV-Hop algorithm and its improved algorithm,and also introduce the basic node location calculation method and the classic method range-free measurement.(2)Study the calculation steps of DV-Hop algorithm,analyze the disadvantages of the classical DV-Hop algorithm.On the basis of our predecessors,we propose two improvements:The first one is the MCDV-hop algorithm — DV-Hop algorithm based on cosine theorem for multiple communication radii.The algorithm uses multiple communication radii to broadcast the position to obtain the minimum number of hops between the unknown node and the beacon node,and adjusts the estimated hop distance by using the cosine theorem after estimating the good hop distance,and finally uses the trilateration method or the maximum likelihood estimation method estimates the position coordinates.The second one is to take the different movement routes of anchor nodes and the number of anchor nodes as MARDV-Hop algorithm and MAQDV-Hop algorithm,respectively.The algorithm uses a fixed position to arrange the mobile anchor nodes,and then moves the anchor nodes to move to construct a plurality of virtual anchor nodes.Then,the unknown nodes calculate their coordinates according to the position information of each moving anchor node after moving,take the average as the last coordinate.(3)Doing simulation experiments for the proposed two improved algorithms of this paper,compared with the classic DV-Hop algorithm and the literature reference algorithm in the same environment for comparative analysis.Both algorithms have improved their positioning accuracy.