Exploiting routing information in Wireless Sensor Networks localization

In this work, an integrated solution to jointly solve the localization and data routing problems in sensor networks is proposed. It is based on a scalable “divide et impera” approach. The network is divided into 1-hop cluster and the localization is hierarchically performed inside each cluster, thereafter among clusters. The key advantage of the algorithm is that no additional communication is required to perform localization, which is obtained by a ranging technique, exploiting network topology provided by the routing algorithm. To this end, Shadow Edges, a novel class of links, are introduced to encompass the lack of communication among nodes. The proposed dual procedure to solve the localization and routing, represents a novel trend for Wireless Sensor Networks, where multiple problems are jointly solved by providing affordable and integrated solutions.