Rigidity, Computation, and Randomization in Network Localization (2004)
Cached
Download Links
| Venue: | In Proceedings of IEEE INFOCOM ’04, Hong Kong |
| Citations: | 61 - 13 self |
BibTeX
@INPROCEEDINGS{Eren04rigidity,computation,,
author = {T. Eren and D. K. Goldenberg and W. Whiteley and Y. R Yang and A. S. Morse and B. D. O. Anderson and P. N. Belhumeur},
title = {Rigidity, Computation, and Randomization in Network Localization},
booktitle = {In Proceedings of IEEE INFOCOM ’04, Hong Kong},
year = {2004},
pages = {2673--2684}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.
