On the Computational Complexity of Sensor Network Localization (2004)
Cached
Download Links
| Venue: | In Proceedings of First International Workshop on Algorithmic Aspects of Wireless Sensor Networks |
| Citations: | 47 - 4 self |
BibTeX
@INPROCEEDINGS{Aspnes04onthe,
author = {James Aspnes and David Goldenberg and Yang Richard Yang},
title = {On the Computational Complexity of Sensor Network Localization},
booktitle = {In Proceedings of First International Workshop on Algorithmic Aspects of Wireless Sensor Networks},
year = {2004},
pages = {32--44},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localization problem for sensor networks is to reconstruct the positions of all of the sensors in a network, given the distances between all pairs of sensors that are within some radius r of each other. In the past few years, many algorithms for solving the localization problem were proposed, without knowing the computational complexity of the problem. In this paper, we show that no polynomial-time algorithm can solve this problem in the worst case, even for sets of distance pairs for which a unique solution exists, unless RP = NP. We also discuss the consequences of our result and present open problems.
