Enhancement of Localization Algorithm in Wireless Sensor Networks

Localization is that the main sensible issue in wireless sensor networks as a result of several applications need the sensing element to understand their actual position with a high degree of exactitude. In WSN, due to limitations of nodes energy, energy potency is a vital factor which should be considered when protocols are designing. In wireless sensor network due to Varied localization methods supported mobile anchor nodes are projected for helping the sensing element in node to see their location. Consequently, this paper presents a path designing theme, which ensures that the flight of the mobile anchor node minimizes the localization error and guarantees that everyone of the sensing element node will verify their location further as LEACH protocol plays a vital role in response to the uneven energy distribution that-s caused by the randomness of cluster heads forming. The performance of the projected theme is evaluated through a series of simulations with the. NET. The result shows that, shortest path finds by using Dijkstra-s algorithm.