Noisy Sensor Network Localization using Semidefinite Representations and Facial Reduction ∗

In this paper we extend a recent algorithm for solving the sensor network localization problem (SNL ) to include instances with noisy data. In particular, we continue to exploit the implicit degeneracy in the semidefinite programming (SDP ) relaxation of SNL . An essential step involves finding good initial estimates for a noisy Euclidean distance matrix, EDM , completion problem. After finding the EDM completion from the noisy data, we rotate the problem using the original positions of the anchors. This is a preliminary working paper, and is a work in progress. Tests are currently on-going.

[1]  Qunfeng Dong,et al.  A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data , 2003, J. Glob. Optim..

[2]  Paul Tseng,et al.  (Robust) Edge-based semidefinite programming relaxation of sensor network localization , 2011, Math. Program..

[3]  Chris Savarese.  LOCATIONING IN DISTRIBUTED AD-HOC WIRELESS SENSOR NETWORKS , 2001 .

[4]  Carlile Lavor,et al.  Extending the geometric build-up algorithm for the molecular distance geometry problem , 2008, Inf. Process. Lett..

[5]  Kim-Chuan Toh,et al.  Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements , 2006, IEEE Transactions on Automation Science and Engineering.

[6]  Jiawang Nie,et al.  Sum of squares method for sensor network localization , 2006, Comput. Optim. Appl..

[7]  Masakazu Kojima,et al.  Exploiting Sparsity in SDP Relaxation for Sensor Network Localization , 2009, SIAM J. Optim..

[8]  Carlile Lavor,et al.  On generating Instances for the Molecular Distance Geometry Problem , 2006 .

[9]  Nathan Krislock,et al.  Sensor network localization, euclidean distance matrix completions, and graph realization , 2008, MELT '08.

[10]  Masakazu Kojima,et al.  User Manual for SFSDP: a Sparse Version of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems , 2009 .

[11]  Henry Wolkowicz,et al.  Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming , 1999, Comput. Optim. Appl..

[12]  Stephen P. Boyd,et al.  Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization , 2008, SIAM J. Optim..

[13]  Qunfeng Dong,et al.  A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances , 2002, J. Glob. Optim..

[14]  Paul Tseng,et al.  Second-Order Cone Programming Relaxation of Sensor Network Localization , 2007, SIAM J. Optim..

[15]  Michael A. Saunders,et al.  SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization , 2006, SIAM J. Optim..

[16]  Hoai An Le Thi,et al.  Large Scale Molecular Conformation via the Exact Distance Geometry Problem , 2000 .

[17]  Nathan Krislock,et al.  Explicit Sensor Network Localization using Semidefinite Representations and Clique Reductions , 2009 .

[18]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[19]  H. Wolkowicz,et al.  Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming , 2005 .