A Theoretical Analysis of the Conditions for Unambiguous Node Localization in Sensor Networks
- A Theoretical Analysis of the Conditions for Unambiguous Node Localization in Sensor Networks
- Eren, Tolga
Belhumeur, Peter N.
- Computer Science
- Persistent URL:
- Columbia University Computer Science Technical Reports
- Part Number:
- Department of Computer Science, Columbia University
- Publisher Location:
- New York
- 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 distances or bearings to their neighbors. Distance information is the separation between two nodes connected by a sensing/communication link. Bearing is the angle between a sensing/communication link and the x-axis of a node's local coordinate system. We construct grounded graphs to model network localization and apply graph rigidity theory and parallel drawings to test the conditions for unique localizability and to construct uniquely localizable networks. We further investigate partially localizable networks.
- Computer science
- Item views
text | xml
- Suggested Citation:
- Tolga Eren, Walter Whiteley, Peter N. Belhumeur, 2004, A Theoretical Analysis of the Conditions for Unambiguous Node Localization in Sensor Networks, Columbia University Academic Commons, https://doi.org/10.7916/D8J394SD.