Distributed iterative cluster localization in wireless sensor networks

We designed a distributed algorithm for iterative cluster localization. Because this algorithm is especially designed for large scale networks, increase in the number of sensor nodes has no inefficiency effect on sensor node performances. A node has the information regarding every node within some vertices which are in range of the node. In the presented techniques every node only focused on localizing itself, however in our algorithm every node can localize itself individually or they obtain localization information from other nodes. And we see that each node likely to localizes itself after it has localized other nodes in its cluster which obviously shows the contribution of coordinate sharing. Although our algorithm is mostly dependent on sharing information, we show the messaging overhead is quite reasonable.