Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/INFCOM.2004.1354686 | IEEE INFOCOM 2004: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS |
Keywords | DocType | ISSN |
sensor network,intelligent networks,sensors,pervasive computing,satellites,graph theory,computational complexity,computer networks,computer vision,testing,global positioning system | Conference | 0743-166X |
Citations | PageRank | References |
113 | 8.41 | 26 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tolga Eren | 1 | 396 | 24.12 |
| David Kiyoshi Goldenberg | 2 | 381 | 23.98 |
| Walter Whiteley | 3 | 450 | 32.34 |
| Richard Yang | 4 | 3502 | 203.15 |
| A. Stephen Morse | 5 | 4285 | 588.67 |
| Brian D. O. Anderson | 6 | 3727 | 471.00 |
| Peter N. Belhumeur | 7 | 12242 | 1001.27 |