An As-Rigid-As-Possible approach to sensor network localization

ACM Transactions on Sensor Networks

Volumn 6, Issue 4, 2010, Pages 1-21

  Zhang, Lei ^a   Liu, Ligang ^a   Gotsman, Craig ^b   Gortler, Steven J ^c  

^a ZHEJIANG UNIVERSITY   (China)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c HARVARD UNIVERSITY   (United States)

Author keywords

As Rigid As Possible; Embedding; Localization; Sensor networks

Indexed keywords

EMBEDDING; INTERSENSOR; LOCAL STRUCTURE; LOCALIZATION; MEASUREMENT NOISE; OPTIMIZATION PROBLEMS; SENSOR NETWORK LOCALIZATION; STATE-OF-THE-ART ALGORITHMS;

SENSOR NETWORKS;

EID: 77954962534     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1777406.1777414     Document Type: Article

References (25)

1. BISWAS, P., LIAN, T. C., WANG, T. C., AND YE, Y. Y. 2006. Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sensor Netw. 2, 2, 188-220.
2. BOLLOBAS, B. 1998. Modern Graph Theory. Graduate Texts in Math. No. 184. Springer.
3. BORG, I. AND GROENEN, P. J. F. 1997. Modern Multidimensional Scaling: Theory and Applications. Springer-Verlag.
4. BRAND, M. 2002. Charting a manifold. In Proceedings of the Conference on Neural Information Processing Systems. ACM, 480-489.
5. CONNELLY, R. 2005. Generic global rigidity. Discr. Comput. Geom. 33, 4, 549-563.
6. EREN, T., GOLDENBERG, D. K., WHITELEY, W., YANG, Y. R., MORSE, A., ANDERSON, B. D. O., AND BELHUMEUR, P. N. 2004. Rigidity, computation, and randomization in network localization. In Proceedings of the IEEE Infocom Conference. IEEE Computer Society, 2673-2684.
7. GANSNER, E., KOREN, Y., AND NORTH, S. 2004. Graph drawing by stress majorization. Lecture Notes in Computer Science, vol. 3383, Springer, 239-250.
8. GOLDENBERG, D. K., KRISHNAMURTHY, A., MANESS, W. C., YANG, Y. R., YOUNG, A., MORSE, S., SAVVIDES, A., AND ANDERSON, B. D. O. 2005. Network localization in partially localizable network. In Procedings of the IEEE Infocom Conference. IEEE Computer Society, 313-326.
9. GOLUB, G. H. AND VAN LOAN, C. 1996. Matrix Computations. Johns Hopkins Unversity Press.
10. GORTLER, S., HEALY, A., AND THURSTON, D. 2007. Characterizing generic global rigidity. Amer. J. Math. To appear.
11. GOTSMAN, C. AND KOREN, Y. 2005. Distributed graph layout for sensor networks. J. Graph Algor. Appl. 9, 3, 327-346.
12. GOWER, J. C. AND DIJKSTERHUIS, G. B. 2004. Procrustes Problems. Oxford University Press.
13. JACKSON, B. AND JORDÁN, T. 2005. Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory Ser. B 94, 1, 1-29.
14. KOREN, Y., GOTSMAN, C., AND BEN-CHEN, M. 2005. Patchwork: Efficient localization for sensor networks by distributed global optimization. Tech. rep. http://www.cs.technion. ac.il/gotsman/AmendedPubl/Koren/patchwork-trpdf.
15. MAUVE, M., WIDMER, J., AND HARTENSTEIN, H. 2001. A survey on position-based routing in mobile ad-hoc networks. IEEE Netw. 15, 6, 30-39.
16. MOORE, D., LEONARD, J., RUS, D., AND TELLER, S. 2004. Robust distributed network localization with noisy range measurements. In Proceedings of the Conference on Embedded Networked Sensor Systems (SenSys). ACM, 50-61.
17. PRESS, W. H., TEUKOLSKY, S. A., VETTERLING, W. T., AND FLANNERY, B. P. 2002. Numerical Recipes in C++: The Art of Scientific Computing 2nd ed. Cambridge University Press.
18. ROWEIS, S. AND SAUL, L. 2000. Nonlinear dimensionality reduction by locally linear embedding. Sci. 290, 5500, 2323-2326.
19. SAAD, Y. 2003. Iterative Methods for Sparse Linear Systems 2nd ed. Society for Industrial and Applied Mathematics.
20. SAXE, J. B. 1979. Embeddability of weighted graphs in k-space is strongly NP-hard. In Proceedings of the 17th Allerton Conference on Communication, Control and Computing. Society for Industrial and Applied Mathematics, 480-489.
21. SHANG, Y. AND RUML, W. 2004. Improved MDS-based localization. In Proceedings of the IEEE Infocom Conference. IEEE Computer Society, 2640-2651.
22. SINGER, A. 2008. A remark on global positioning from local distances. Proc. Nation. Acad. Sci. 105, 28, 9507-9511.
23. SO, A. M.-C. AND YE, Y. 2005. Theory of semidefinite programming for sensor network localization. In Proceedings of the Symposium on Discrete Algorithms. SIAM, 405-414.
24. TUBAISHAT, M. AND MADRIA, S. 2003. Sensor networks: An overview. IEEE Potentials 22, 2, 20-23.
25. YEMINI, Y. 1979. Some theoretical aspects of position-location problems. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 1-8.