at
CAIMS -MITACS 2006 Joint Annual Conference
from Friday June 16 to june 20, 2006 at York University in Toronto, Ontario,
Operations Research and Optimization session.
(talk at 16:30-16:55)
Abstract
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.