Sensor network localization, euclidean distance matrix completions, and graph realization

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2008, Pages 129-134

  Ding, Yichuan ^a   Krislock, Nathan ^b   Qian, Jiawei ^c   Wolkowicz, Henry ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

Anchors; Euclidean distance matrix completions; Graph realization; Semidefinite programming; Sensor network localization

Indexed keywords

COMPLETION PROBLEMS; DISTANCE INFORMATIONS; EUCLIDEAN DISTANCE MATRIX COMPLETIONS; GRAPH REALIZATION; SDP RELAXATIONS; SEMIDEFINITE PROGRAMMING; SENSOR NETWORK LOCALIZATION; SIZE REDUCTIONS; SUBGRAPH; UNDERLYING GRAPHS;

ANCHORS; DEMODULATION; ELECTRIC DIPOLE MOMENTS; ELECTRIC DISCHARGE MACHINING; GLOBAL POSITIONING SYSTEM; MICROMACHINING; MOBILE COMPUTING; PROGRAMMING THEORY; SATELLITE NAVIGATION AIDS; SENSORS; SPATIAL VARIABLES MEASUREMENT; WIRELESS NETWORKS;

SENSOR NETWORKS;

EID: 60349086185     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1410012.1410042     Document Type: Conference Paper

References (20)

1. S. AL-HOMIDAN and H. WOLKOWICZ. Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming. Linear Algebra Appl., 406:109-141, 2005.
2. A. ALFAKIH, A. KHANDANI, and H. WOLKOWICZ. Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl., 12(1-3):13-30, 1999. Computational optimization - a tribute to Olvi Mangasarian, Part I.
3. M. BAKONYI and C. R. JOHNSON. The Euclidean distance matrix completion problem. SIAM J. Matrix Anal. Appl., 16(2):646-654, 1995.
4. P. BISWAS, T. LIANG, K. TOH, T. WANG, and Y. YE. Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Transactions on Automation Science and Engineering, 2006. To appear.
5. P. BISWAS, T. LIANG, K. TOH, and Y. YE. An SDP based approach for anchor-free 3D graph realization. Technical report, Operation Research, Stanford University, Stanford, CA, 2005.
6. P. BISWAS and Y. YE. Semidefinite programming for ad hoc wireless sensor network localization. In Information Processing In Sensor Networks, Proceedings of the third international symposium on Information processing in sensor networks, pages 46-54, Berkeley, Calif., 2004.
7. 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, volume 82 of Nonconvex Optim. Appl., pages 69-84. Springer, New York, 2006.
8. J. BORWEIN and H. WOLKOWICZ. Facial reduction for a cone-convex programming problem. J. Austral. Math. Soc. Ser. A, 30(3):369-380, 1980/81.
9. G. M. CRIPPEN and T. F. HAVEL. Distance geometry and molecular conformation. Research Studies Press Ltd., Letchworth, 1988.
10. J. ERIKSSON and M. GULLIKSSON. Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares. Math. Comp., 73(248):1865-1883 (electronic), 2004.
11. R. FAREBROTHER. Three theorems with applications to Euclidean distance matrices. Linear Algebra Appl., 95:11-16, 1987.
12. J. GOWER, Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra Appl., 67:81-97, 1985.
13. J. C. GOWER. Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra Appl., 67:81-97, 1985.
14. T. HAYDEN, J. WELLS, W.-M. LIU, and P. TARAZAGA. The cone of distance matrices. 144:153-169, 1991.
15. H. JIN. Scalable Sensor Localization Algorithms for Wireless Sensor Networks. PhD thesis, Toronto University, Toronto, Ontario, Canada, 2005.
16. C. JOHNSON and P. TARAZAGA. Connections between the real positive semidefinite and distance matrix completion problems. Linear Algebra Appl., 223/224:375-391, 1995. Special issue honoring Miroslav Fiedler and Vlastimil Pták.
17. M. LAURENT. A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems. In Topics in Semidefinite and Interior-Point Methods, volume 18 of The Fields Institute for Research in Mathematical Sciences, Communications Series, pages 51-76, Providence, Rhode Island, 1998. American Mathematical Society.
18. I. SCHOENBERG. Remarks to Maurice Frechet's article: Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert. Ann. Math., 36:724-732, 1935.
19. A. SO and Y. YE. Theory of semidefinite programming for sensor network localization. Math. Programming, to appear, 2006.
20. W. TORGERSON. Multidimensional scaling. I. Theory and method. Psychometrika, 17:401-419, 1952.