Dynamic-Anchor Distributed Localization in Wireless Sensor Networks

In recent years there has been a growing interest in wireless sensor networks(WSN)applications. Such sensor networks can be used to control temperature, humidity,contamination,pollution etc.Positon information of individual nodes is useful in implementing functions such as routing and querying in ad-hoc networks. The DV- Hop is a main stream localization algorithm.Since the DV-Hop algorithm is not accurate as the nodes scattered uneven, quantities huge, and topology dynamicly change, we proposed a distributed localization algorithm called DA, which can overcome these disadvantages of the DV-Hop. In the DA algorithm, the most appropriate node is selected to substitute the centroid of the area through the measurement of the RSSI, and the selected node is dynamicly promoted to be an anchor in order to enhance the anchor density. The simulation results demonstrate that the DA is more efficient in precision than the DV-Hop.