A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Theory of semidefinite programming for sensor network localization
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Reformulating the least-square source localization problem with contracted distances
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
| Hi-index | 0.00 |
We present evidence that multihop node-to-anchor distance information is sufficient to allow accurate self-localization in multihop wireless networks (such as ad hoc and sensor networks, as well as future cellular systems based on LTE). To this purpose we have implemented two new distance-based source localization algorithms, which prove highly robust to inaccurate range information characterized by distance estimates exceeding the correct ones. Our contribution is a contrasting alternative to current distributed self-localization algorithms, which are founded on the idea of "diffusing" the known location of a few nodes (anchor) to the entire the network via a typically large number of message exchanges amongst neighbors, resulting in high communications costs, low robustness to mobility, and little (location) privacy to end users. To the best of our knowledge, this work is the first example that the aforementioned disadvantages are not an unavoidable price to be payed for accurate location information in multihop networks.