Home

A Theoretical Analysis of the Conditions for Unambiguous Node Localization in Sensor Networks

Tolga Eren; Walter Whiteley; Peter N. Belhumeur

Title:
A Theoretical Analysis of the Conditions for Unambiguous Node Localization in Sensor Networks
Author(s):
Eren, Tolga
Whiteley, Walter
Belhumeur, Peter N.
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-032-04
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
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 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.
Subject(s):
Computer science
Item views:
177
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use