talk on
Explicit Sensor Network Localization using Semidefinite Programming and
Clique Reductions
Nathan Krislock (speaker) and Henry Wolkowicz
Univiversity of Waterloo
Department of Combinatorics and Optimization
Waterloo, Ont. CANADA
URL http://orion.math.uwaterloo.ca/~hwolkowi
abstract:
The sensor network localization, SNL, problem consists of locating the positions of sensors, given only the distances between sensors that are within radio range and the positions of some fixed sensors (called anchors). Using the theory of Euclidean Distance Matrices, we relax SNL to a semidefinite programming, SDP, problem. By finding explicit representations of the faces of the SDP cone corresponding to intersections of cliques, we derive a technique that solves SNL, with exact data.