Session MD2 - Positive Semi-Definite Programming and Combinatorial
CORS/Optimization Days 2006
program now available).
Joint Conference, Montreal, May 8-10, 2006; and followed by
SPRING SCHOOL ON VEHICLE ROUTING at
HEC Montreal, May 10-12.
Many applications use ad hoc wireless sensor networks for monitoring
information. Typical networks include a large number of sensor nodes which
gather data and communicate among themselves. The location of a subset of the
sensors is known; these sensors are called anchors.
From the intercommunication, we are able to establish distances between a
subset of the sensors and anchors. The sensor localization problem is to
find/estimate the location of all the sensors.
We model this problem using Euclidean Distance Matrices.
We use semidefinite programming to exploit the special structure of
the problem and develop a robust interior-point algorithm.