Font Size: a A A

Research And Improvement Of DV-HOP Positioning Algorithm For Wireless Sensor Networks

Posted on:2018-12-19Degree:MasterType:Thesis
Country:ChinaCandidate:H HuangFull Text:PDF
GTID:2358330518460170Subject:Electronic and communication engineering
Abstract/Summary:PDF Full Text Request
Following the Internet,wireless sensor networks which was called the new intelligent network has been favored by more and more scientific scholars,and it was in-depth study by them.At the same time,the application field of wireless sensor networks has broad prospects for development.In WSN's many technologies,node positioning is one of the most basic technologies,acting as a "cornerstone" role.In many subsequent research of WSN,numerous aspects will be related to the location of the node,and in the real application scenarios,the location of the node information is the priority of all,is the basis to achieve positioning.In this paper,we will study and discuss the most widely used DV-Hop algorithm in many mainstream WSN algorithms,hoping to provide some reference for WSN's follow-up research.On the basis of studying a lot of literatures which were focused on the node localization algorithm,this text has analyzed the basic principle and positioning steps of DV-Hop algorithm in detail,and considered of the shortcomings of DV-Hop algorithm,and from this point of view,proposed several methods to improve the DV-Hop algorithm.The main contents are:(1)In order to improve the defects that exist a difference between the average hop distance and the real value of using the traditional DV-Hop algorithm,an modified strategy,DV-Hop triple localization algorithm,is proposed.The idea of the algorithm is that on the one hand,when the initial position of the unknown node is obtained by the user for the first time,it will be send to the beacon node as a known data.On the other hand,it is assumed that the user do not know the specific position of the beacon node,and it is also initialized to obtain the estimated coordinates,And then introduce the difference factor and weight,the revised data will be forwarded to the unknown node again,to obtain the final estimate of the unknown node location.The simulation results show that the improved method has a certain degree of optimization in the positioning effect.(2)Based on the introduction of RSSI technology,the number of hops is further modified,and then introduces the weighting mechanism to further improve the jump distance to get a new DV-Hop improved algorithm.The idea of this algorithm is that the correction of the number of hops is completed by using the RSSI ratio of the node on the basis of introducing the shadowing model,and then the three beacon nodes closest to the unknown node are selected in the network.According to the previous step,the weighting coefficient can be acquired by the number of hops which has been improved,and then put it into the solution of the average jump distance to obtain the final average jump distance.Finally,the position coordinates of the unknown node will be obtained.
Keywords/Search Tags:DV-Hop algorithm, Triple node location, RSSI ratio, Weighted, Hop optimization
PDF Full Text Request
Related items