Universal rigidity and edge sparsification for sensor network localization

SIAM Journal on Optimization

Volumn 20, Issue 6, 2010, Pages 3059-3081

  Zhu, Zhisu ^a   So, Anthony Man Cho ^b   Ye, Yinyu ^a  

^a Stanford University   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Edge sparsification; Rigidity theory; Semidefinite programming; Sensor network localization

Indexed keywords

COMPUTATIONAL EFFORT; COMPUTATIONAL RESULTS; CONVEX OPTIMIZATION TECHNIQUES; CONVEX PROGRAMS; GRAPH DECOMPOSITIONS; INPUT GRAPHS; LOCALIZATION PROPERTIES; MEMORY COMPLEXITY; SEMI-DEFINITE PROGRAMMING; SENSOR NETWORK LOCALIZATION; SOLUTION ACCURACY; SOLUTION TIME; SPARSIFICATION; SPEED-UPS; SUBGRAPHS;

CONVEX OPTIMIZATION; RIGIDITY;

SENSOR NETWORKS;

EID: 79251528892     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090772009     Document Type: Article

References (42)

1. A. Y. Alfakih, On bar frameworks, stress matrices and semidefinite programming, Math. Program., to appear.
2. A. Y. Alfakih, On the universal rigidity of generic bar frameworks, Contrib. Discrete Math., 5 (2010), pp. 7-17.
3. J. Aspnes, T. Eren, D. K. Goldenberg, A. S. Morse, W. Whiteley, Y. R. Yang, B. D. O. Anderson, and P. N. Belhumeur, A theory of network localization, IEEE Trans. Mob. Comput., 5 (2006), pp. 1663-1678.
4. J. Aspnes, D. Goldenberg, and Y. R. Yang, On the computational complexity of sensor network localization, in Proceedings of the 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2004), Lecture Notes in Comput. Sci. 3121, S. Nikoletseas and J. D. P. Rolim, eds., Springer-Verlag, Berlin, 2004, pp. 32-44.
5. M. Bǎdoiu, E. D. Demaine, M. Hajiaghayi, and P. Indyk, Low-dimensional embedding with extra information, Discrete Comput. Geom., 36 (2006), pp. 609-632.
6. A. Basu, J. Gao, J. S. B. Mitchell, and G. Sabhnani, Distributed localization using noisy distance and angle information, in Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2006), 2006, pp. 262-273.
7. M. Belk and R. Connelly, Realizability of graphs, Discrete Comput. Geom., 37 (2007), pp. 125-137.
8. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, Semidefinite programming based algorithms for sensor network localization, ACM Trans. Sensor Networks, 2 (2006), pp. 188-220.
9. P. Biswas, K.-C. Toh, and Y. Ye, A distributed SDP approach for large-scale noisy anchorfree graph realization with applications to molecular conformation, SIAM J. Sci. Comput., 30 (2008), pp. 1251-1277.
10. P. Biswas and Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, in Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN 2004), 2004, pp. 46-54.
11. P. Biswas and Y. Ye, A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization, in Multiscale Optimization Methods and Applications, Nonconvex Optim. Appl. 82, W. W. Hager, S.-J. Huang, P. M. Pardalos, and O. A. Prokopyev, eds., Springer, New York, 2006, pp. 69-84.
12. J. Bruck, J. Gao, and A. A. Jiang, Localization and routing in sensor networks by local angle information, ACM Trans. Sensor Networks, 5 (2009), article 7.
13. N. Bulusu, J. Heidemann, and D. Estrin, GPS-less low-cost outdoor localization for very small devices, IEEE Pers. Commun., 7 (2000), pp. 28-34.
14. M.W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye, SPASELOC: An adaptive subproblem algorithm for scalable wireless sensor network localization, SIAM J. Optim., 17 (2006), pp. 1102-1128.
15. R. Connelly, Tensegrity structures: Why are they stable?, in Rigidity Theory and Applications, Fundamental Materials Research, M. F. Thorpe and P. M. Duxbury, eds., Kluwer Academic/Plenum Publishers, New York, 1999, pp. 47-54.
16. R. Connelly, Generic global rigidity, Discrete Comput. Geom., 33 (2005), pp. 549-563.
17. G. M. Crippen and T. F. Havel, Distance Geometry and Molecular onformation, Chemometrics Series 15, Research Studies Press Ltd., Taunton, Somerset, England, 1988.
18. E. Cuthill and J. McKee, Reducing the bandwidth of sparse symmetric matrices, in Proceedings of the 1969 24th National Conference, 1969, pp. 157-172.
19. L. Doherty, K. S. J. Pister, and L. El Ghaoui, Convex position estimation in wireless sensor networks, in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), Vol. 3, 2001, pp. 1655-1663.
20. M. Fukuda, M. Kojima, K. Murota, and K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion I: General framework, SIAM J. Optim., 11 (2000), pp. 647-674.
21. S. J. Gortler, A. D. Healy, and D. P. Thurston, Characterizing generic global rigidity, Amer. J. Math., 132 (2010), pp. 897-939.
22. S. J. Gortler and D. P. Thurston, Characterizing the Universal Rigidity of Generic Frameworks, preprint, 2009.
23. J. Graver, B. Servatius, and H. Servatius, Combinatorial Rigidity, Grad. Stud. Math. 2, American Mathematical Society, Providence, RI, 1993.
24. B. Hendrickson, The molecule problem: Exploiting structure in global optimization, SIAM J. Optim., 5 (1995), pp. 835-857.
25. B. Jackson and T. Jordán, Connected rigidity matroids and unique realizations of graphs, J. Combin. Theory Ser. B, 94 (2005), pp. 1-29.
26. S. Kim, M. Kojima, M. Mevissen, and M. Yamashita, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Math. Program., to appear.
27. S. Kim, M. Kojima, and H. Waki, Exploiting sparsity in SDP relaxation for sensor network localization, SIAM J. Optim., 20 (2009), pp. 192-215.
28. N. Krislock and H. Wolkowicz, Explicit sensor network localization using semidefinite representations and facial reductions, SIAM J. Optim., 20 (2010), pp. 2679-2708.
29. X. Li, Wireless Ad Hoc and Sensor Networks: Theory and Applications, Cambridge University Press, New York, 2008.
30. D. Niculescu and B. Nath, Ad hoc positioning system (APS) using AOA, in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), Vol. 3, 2003, pp. 1734-1743.
31. J. Nie, Sum of squares method for sensor network localization, Comput. Optim. Appl., 43 (2006), pp. 151-179.
32. J. B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, in Proceedings of the 17th Allerton Conference in Communication, Control, and Computing, 1979, pp. 480- 489.
33. A. M.-C. So, A Semidefinite Programming Approach to the Graph Realization Problem: Theory, Applications and Extensions, Ph.D. thesis, Computer Science Department, Stanford University, Stanford, CA, 2007.
34. A. M.-C. So and Y. Ye, A semidefinite programming approach to tensegrity theory and realizability of graphs, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), 2006, pp. 766-775.
35. A. M.-C. So and Y. Ye, Theory of semidefinite programming for sensor network localization, Math. Program., 109 (2007), pp. 367-384.
36. J. F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11 (1999), pp. 625-653.
37. P. Tseng, Second-order cone programming relaxation of sensor network localization, SIAM J. Optim., 18 (2007), pp. 156-185.
38. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
39. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity, SIAM J. Optim., 17 (2006), pp. 218-242.
40. Z. Wang, S. Zheng, Y. Ye, and S. Boyd, Further relaxations of the semidefinite programming approach to sensor network localization, SIAM J. Optim., 19 (2008), pp. 655-673.
41. Z. Yang, Y. Liu, and X.-Y. Li, Beyond trilateration: On the localizability of wireless ad hoc networks, in Proceedings of the 28th Conference on Computer Communications (INFOCOM 2009), 2009, pp. 2392-2400.
42. Z. Zhu, A. M.-C. So, and Y. Ye, Universal rigidity: Towards accurate and efficient localization of wireless networks, in Proceedings of the 29th IEEE Conference on Computer Communications (INFOCOM 2010), 2010.