Improved DV-Hop Localization Algorithm based on Surround from Anchors

Abstract

Advances in wireless and digital electronics have led to the invention of Wireless Sensor Network technology (WSN). The Wireless Sensor Network (WSN) is a network of tens or thousands of sensor nodes used for sensing, monitoring, and responding to events and phenomena in a specified environment. Then sent these events to places to process and analyze it and take the appropriate decisions. Many applications in Wireless Sensor Networks depend on knowing the positions of the sensor nodes. Therefore, research in localization algorithms for Wireless Sensor Networks has become an important topic. Using range-free algorithms such as the DV -hop algorithm has many drawbacks; it requires hardware support with more costs. In addition, it consumes more power. Also, it does not achieve a high rate of position accuracy. This paper presents an improvement for the traditional DV-hop algorithm. The enhanced protocol decreased the number of anchors to 5, 4 and 3 instead of using all anchors as references. This leads to enhance the position accuracy to face the needs of environmental monitoring applications. Through implementing a number of extensive simulation experiments, the enhanced algorithm outperformed the traditional DV-hop algorithm. It reduces the localization average error. That leads to improve the positioning accuracy compared with the traditional DV-hop localization algorithm. Blind nodes record the packet with the least hops from the anchors Every anchor node calculates its average hop distance and broadcast it in the entire the network Unknown nodes compute their distance to only the anchors (the nearest one + nodes with min(x),min(y) along with max(x),max(y) Blind nodes compute their positions using trilateration method Calculate the position accuracy End