DV-Hop Localization Algorithm Based on Hop Amendment

Localization is one of the key supporting technologies in wireless sensor networks.The hops between all nodes of the traditional DV-Hop localization algoritnm were integer,to some extent,that reduced the positioning accuracy.To solve the problem of low positioning accuracy in traditional DV-Hop,a new localization algorithm based on hop amendment is proposed.This paper mainly focuses on two aspects:Firstly,the hops between all archor nodes are refined to make sure that hops between archor nodes are not only integer,but also decimal.Secondly,the hops between archor nodes and unknown nodes are refined to make the estimated distance more accurate.The simulation results show that the proposed improved algorithm has obviously better locating performance in positioning accuracy than that of the traditional localization algorithm without additional hardware.