Theory of semidefinite programming for sensor network localization

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 405-414

  So, Anthony Man Cho ^a   Ye, Yinyu ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDEAN DISTANCE GEOMETRY APPLICATIONS; GRAPH RIGIDITY THEORY; SEMIDEFINITE PROGRAMMING (SDP); SENSOR NETWORK LOCALIZATION;

ALGORITHMS; COMPUTER PROGRAMMING; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

SENSOR DATA FUSION;

EID: 20744449134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. A. Y. Alfakih. Graph Rigidity via Euclidean Distance Matrices. Linear Algebra and Its Applications 310:149-165, 2000.
2. A. Y. Alfakih. On Rigidity and Realizability of Weighted Graphs. Linear Algebra and Its Applications 325:57-70, 2001.
3. A. Y. Alfakih, A. Khandani, H. Wolkowicz. Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming. Comput. Opt. and Appl. 12:13-30, 1999.
4. A. Y. Alfakih, H. Wolkowicz. On the Embeddability of Weighted Graphs in Euclidean Spaces. Research Report CORR 98-12, University of Waterloo, Dept. of Combinatorics and Optimization, 1998.
5. A. Y. Alfakih, H. Wolkowicz. Euclidean Distance Matrices and the Molecular Conformation Problem. Research Report CORR 2002-17, University of Waterloo, Dept. of Combinatorics and Optimization, 2002.
6. Farid Alizadeh. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM J. Opt. 5:13-51, 1995.
7. James Aspnes, David Goldenberg, Yang Richard Yang. On the Computational Complexity of Sensor Net work Localization. ALGOSENSORS 2004, in LNCS 3121:32-44, 2004.
8. M. Bǎdoiu. Approximation Algorithm for Embedding Metrics into a Two-Dimensional Space. Proc. 14th SODA 434-443, 2003.
9. M. Bǎdoiu, E. D. Demaine, M. T. Hajiaghayi, P. Indyk. Low-Dimensional Embedding with Extra Information. Proc. 20th SoCG 320-329, 2004.
10. A. Barvinok. Problems of Distance Geometry and Convex Properties of Quadratic Maps. Disc. Comp. Geom. 13:189-202, 1995.
11. A. Barvinok. A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints. Disc. Comp. Geom. 25(1):23-31, 2001.
12. A. Barvinok. A Course in Convexity. AMS, 2002.
13. P. Biswas, Y. Ye. Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization. Proc. 3rd IPSN 46-54, 2004.
14. S. Boyd, L. E. Ghaoui, E. Feron, V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory. SIAM, 1994.
15. L. Doherty, L. E. Ghaoui, S. J. Pister. Convex Position Estimation in Wireless Sensor Networks. Proc. 20th INFOCOM Volume 3:1655-1663, 2001.
16. T. Eren, D. K. Goldenberg, W. Whiteley, Y. R. Yang, A. S. Moore, B. D. O. Anderson, P. N. Belhumeur. Rigidity, Computation, and Randomization in Network Localization. Proc. 23rd INFOCOM, 2004.
17. D. Goldfarb, K. Scheinberg. Interior Point Trajectories in Semidefinite Programming. SIAM J. Opt. 8(4):871-886, 1998.
18. J. Graver, B. Servatius, H. Servatius. Combinatorial Rigidity. AMS, 1993.
19. B. Hendrickson. Conditions for Unique Graph Realizations. SIAM J. Comput. 21(1):65-84, 1992.
20. B. Hendrickson. The Molecule Problem: Exploiting Structure in Global Optimization. SIAM J. Opt. 5(4):835-857, 1995.
21. B. Jackson, T. Jordán. Connected Rigidity Matroids and Unique Realizations of Graphs. Preprint, 2003.
22. M. Laurent. Matrix Completion Problems. The Encyclopedia of Optimization 3:221-229, 2001.
23. N. Linial, E. London, Yu. Rabinovich. The Geometry of Graphs and Some of Its Algorithmic Applications. Combinatorica 15(2):215-245, 1995.
24. J. Moré, Z. Wu. Global Continuation for Distance Geometry Problems. SIAM J. Opt. 7:814-836, 1997.
25. C. Savarese, J. Rabay, K. Langendoen. Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks. USENIX Annual Technical Conference, 2002.
26. A. Savvides, C.-C. Han, M. B. Srivastava. Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors. Proc. 7th MOBICOM, 166-179, 2001.
27. A. Savvides, H. Park, M. B. Srivastava. The Bits and Flops of the n-hop Multilateration Primitive for Node Localization Problems. Proc. 1st WSNA, 112-121, 2002.
28. Y. Shang, W. Ruml, Y. Zhang, M. P. J. Fromherz. Localization from Mere Connectivity. Proc. 4th MO-BIHOC, 201-212, 2003.