Analysis of Improved DV-Hop Algorithm with Distance Error

Wireless Sensor Network (WSN) contains the many sensing nodes that work together in the network to achieve a common goal. Localization means to know the position of the sensor node in the WSN. Various schemes are available designed by different authors for the localization of the sensor node categorized in to range based and range free schemes. All of the schemes available for the localization have some benefits and pitfalls. So we have proposed a new approach in this paper that is both range free and distributed. In this we are using the Basic Dv-Hop algorithm for the node localization with some changes. After implementing the algorithm, we analyzed the new algorithm that was proposed to produce the best results as collate to basic DV-Hop and improved DV-Hop. We collated our algorithm with localization error corresponding to three parameters such as: anchor nodes, number of nodes and range of the node.