Graphical properties of easily localizable sensor networks
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]
|Collections||ANU Research Publications|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.