The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Approximate Conditional Distributions of Distances between Nodes in a Two-Dimensional Sensor Network
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Efficient broadcast on random geometric graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The design space of wireless sensor networks
IEEE Wireless Communications
| Hi-index | 0.00 |
The localization problem is a central one in the field of wireless sensor networks, but despite the ingenuity of previous attempts at solution, developing an efficient and accurate localization method has remained essentially an open problem. This is so, in our view, because there has been a lack of theoretical results to support more solid advances. In this paper, we build on the semi-analytical approach we developed elsewhere, by exploiting its results regarding the relationship between Euclidean distances and hop distances in wireless sensor networks to improve on one of the most robust localization methods we know of, the well-known DV-hop. Our improvements result in better accuracy, reduced communication costs and local processing, as well as time and energy savings. The results we present are based on simulations through which we compare the new method with the original DV-hop. In addition to the new, more efficient localization method, we also provide a new perspective on the distance relationships, and thereby also contribute to furthering the establishment of a better theoretical understanding of the subject.