Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Speaker: | Levent Tunçel |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
In this talk, we consider the problem of sensor network localization, where one locates unknown sensor positions from some known sensor positions (called anchors) and (noisy) distance measurements between neighboring sensors. This problem is NP-hard in general and has received much attention recently. In this talk, we discuss several convex relaxations for the sensor network localization problem. In particular, we compare the strength of SDP, ESDP and sparse-SOS relaxations, and show that zero individual trace certifies accuracy of sensor position when distance measurements are exact. We show by a counterexample that this condition is no longer sufficient in the presence of distance measurement noise, for all three relaxations. We then propose a fix so that small individual trace certifies accuracy of sensor position, when noise is small.
This is based on joint work with Joao Gouveia and Paul Tseng.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Office of Indigenous Relations.