Skip navigation
Skip navigation

Rigidity, Computation, and Randomization in Network Localization

Eren, Tolga; Goldenberg, David K; Whiteley, Walter; Yang, Yang Richard; Morse, A Stephen; Anderson, Brian; Belhumeur, Peter N

Description

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...[Show more]

CollectionsANU Research Publications
Date published: 2004
Type: Conference paper
URI: http://hdl.handle.net/1885/77583
Source: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies
DOI: 10.1109/INFCOM.2004.1354686

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator