Skip navigation
Skip navigation

Graphical properties of easily localizable sensor networks

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


The sensor network localization problem is one of determining the Euclidean positions of all sensors in a network given knowledge of the Euclidean positions of some, and knowledge of a number of inter-sensor distances. This paper identifies graphical properties which can ensure unique localizability, and further sets of properties which can ensure not only unique localizability but also provide guarantees on the associated computational complexity, which can even be linear in the number of...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Wireless Networks
DOI: 10.1007/s11276-007-0034-9


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