By Topic

Network localization using graph decomposition and rigidity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fang, J. ; Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA ; Morse, A.S.

The sensor network localization problem with distance information is to determine the positions of all the sensors in a network given the positions of some sensors and the distances between some pairs of sensors. One approach to localize a large network is to divide the network into smaller subnetworks whereby each subnetwork is localized in its own coordinate system. We present two algorithms which use linear algebra methods for computing the actual sensor positions given the local solutions of a collection of subnetworks. We also use graph rigidity theory to characterize collections of subnetworks for which the algorithms are applicable.

Published in:

Decision and Control, 2008. CDC 2008. 47th IEEE Conference on

Date of Conference:

9-11 Dec. 2008