An advanced DV-hop algorithm

The basic DV-Hop algorithm can be simply implemented in real Wireless Sensor Networks without any range measurement tools, but it has bad localization accuracy. In this paper we present an advanced DV-Hop algorithm. We tried to reduce the ranging error of DV-Hop algorithm by two ways. Firstly, when the distance between two nodes is less than or equal to its communication radius, corresponding hops remember as 1 in basic DV-Hop algorithm, the hop doesn't reflect distance between two nodes. So, hops are defined as continuous hops, and the paper names the continuous hops between beacon nodes by Euclidean distance. The paper define the continuous hops between others nodes by distance, which is measured by Shadowing model. Secondly, the average hop-size of the unknown nodes comes from a beacon node, but the nodes distribution is uneven in WSNs. We should fully use the information originated from more beacon nodes. The paper use trust degree of each beacon nodes to define the corresponding weighted value, after normalized weighted handing, the estimated hop-length of the unknown node is calculated. By simulation, we prove that advanced DV-Hop algorithm performs a better localization accuracy compared with DV-Hop algorithm, improved DV-Hop algorithm (Chen et al 2008) and improved DV-Hop algorithm (Su Bing al 2013), which is cause of better location accuracy.