Graph Theoretic Techniques in the Analysis of Uniquely Localizable Sensor Networks

Graph Theoretic Techniques in the Analysis of Uniquely Localizable Sensor Networks

Bill Jackson (University of London, UK) and Tibor Jordán (Eötvös University, Hungary)
DOI: 10.4018/978-1-60566-396-8.ch006
OnDemand PDF Download:
$37.50

Abstract

In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist’s viewpoint.

Complete Chapter List

Search this Book:
Reset