Distributed localization in static and mobile sensor networks

Sensor networks are expected to revolutionize information gathering, processing and dissemination in many diverse environments. In this paper, we address a fundamental problem in designing sensor networks: localization, or determining the locations of nodes. We assume that a small fraction of the sensor nodes (called seeds) know their locations. We propose an algorithm that enables other nodes to estimate their locations by exchanging information between nodes and seeds. Unlike most existing work, in our algorithm, a node uses the location information of all its neighbors, not just the seed nodes. Unlike most existing algorithms our algorithm works for both static and mobile sensor networks. Using simulation experiments, we demonstrate that our algorithm significantly outperforms comparable existing algorithms like DV-hop [1] and MCL [2]