Rigidity, computation, and randomization in network localization

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2004, Pages 2673-2684

  Eren, T ^a   Goldenberg, D K ^a   Whiteley, W ^b   Yang, Y R ^a   Morse, A S ^a   Anderson, B D O ^c   Belhumeur, P N ^d  

^a YALE UNIVERSITY   (United States)

^b YORK UNIVERSITY   (Canada)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^d Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRIC-AWARE ROUTING; GROUNDED GRAPHS; NETWORK LOCALIZATION PROBLEM; SENSOR NETWORKS;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GLOBAL POSITIONING SYSTEM; GRAPH THEORY; PROBLEM SOLVING; SENSORS; SET THEORY;

TELECOMMUNICATION NETWORKS;

EID: 8344261381     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1354686     Document Type: Conference Paper

References (48)

1. M. Weiser, "Some computer science problems in ubiquitous computing," Communications of ACM, July 1993.
2. G. H. Forman and J. Zahorjan, "The challenges of mobile computing," IEEE Computer, vol. 27, no. 4, pp. 38-47, Apr. 1994.
3. Brad Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks." in Proceedings of The Sixth International Conference on Mobile Computing and Networking (Mobicom) 2000, Boston, MA, Aug. 2000.
4. B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins, Global Positioning System: Theory and Practice, Fourth Edition, Springer-Verlag, 1997.
5. Andreas Savvides, Chih-Chieh Han, and Mani B. Strivastava, "Dynamic fine-grained localization in ad-hoc networks of sensors," in Proceedings of The Seventh International Conference on Mobile Computing and Networking (Mobicom) 2001, Rome, Italy, July 2001, pp. 166-179.
6. T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, "Range-free localization schemes in large scale sensor networks." in Proceedings of The Ninth International Conference on Mobile Computing and Networking (Mobicom) 2003, San Diego, CA, Sept 2003, pp. 81-95.
7. J.B. Saxe, "Embeddability of weighted graphs in k-space is strongly NP-hard," in Proceedings of the 17th Allerton Conference in Communications, Control and Computing, 1979, pp. 480-489.
8. T. Eren, P.N. Belhumeur, B.D.O. Anderson, and A.S. Morse, "A framework for maintaining formations based on rigidity," Proceedings of the 15th IFAC World Congress, Barcelona, Spain, 2002.
9. B. Roth, "Rigid and flexible frameworks," American Mathematical Monthly, vol. 88, pp. 6-21, 1981.
10. W. Whiteley, "Some matroids from discrete applied geometry," in Contemporary Mathematics, James G. Oxley Joseph E. Bonin and Brigitte Servatius, Eds., vol. 197. American Mathematical Society, 1996.
11. W. Whiteley, "Rigidity and scene analysis," in Handbook of Discrete and Computational Geometry, J. Goodman and J. O'Rourke, Eds., pp. 893-916. CRC Press, 1997.
12. T. Eren, W. Whiteley, A.S. Morse, and P.N. Belhumeur, "Sensor and network topologies of formations with distance-direction-angle constraints," Submitted to the 42nd IEEE Conference on Decision and Control, Hawaii, 2002.
13. B. Hendrickson, "Conditions for unique graph realizations," SIAM J. Comput., vol. 21(1), pp. 65-84, 1992.
14. G. Laman, "On graphs and rigidity of plane skeletal structures," Journal of Engineering Mathematics, vol. 4, pp. 331-340, 2002.
15. Bill Jackson and Tibor Jordàn, "Connected rigidity matroids and unique realizations of graphs," Tech. Rep. TR-2002-12, Eotvos University, Budapest, Hungary, Mar. 2003.
16. J. E. Hopcroft and R.E. Tarjan, "Dividing a graph into triconnected components." SIAM J. Comput., vol. 3, pp. 135-158, 1973.
17. G. L. Miller and V. Ramachandran, "A new graph triconnectivity algorithm and its parallelization," Combinatorica, vol. 12, pp. 53-76, 1992.
18. R. Connelly, "On generic global rigidity," preprint, 2003.
19. Alex Berg and Tibor Jordan, "A proof of Connelly's conjecture on 3-connected generic cycles," J. Comb. Theory B., 2002.
20. G.M. Crippen and T.F. Havel, Distance Geometry and Molecular Conformation, John Wiley & Sons, 1988.
21. Bruce Hendrickson. "The molecule problem: Exploiting structure in global optimization," SIAM Journal on Optimization, vol. 5, no. 4, pp. 835-857, 1995.
22. J. More and Z. Wu, "Global continuation for distance geometry problems," SIAM Journal on Optimization, vol. 7, pp. 814-836, 1997.
23. Don J. Jacobs and Bruce Hendrickson, "An algorithm for two dimensional rigidity percolation: The pebble game," J. Computational Physics, vol. 137, no. 2, pp. 346-365, 1997.
24. Bela Bollobás, Random Graph Theory, Academic Press, London, 1985.
25. 2," Adv. Applied Probability, vol. 29, pp. 567-581, 1997.
26. Mathew D. Penrose, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
27. Xiang-Yang Li, Peng-Jun Wan, Yu Wang, and Chih-Wei Yi, "Fault tolerant deployment and topology control in wireless networks," in Proceedings of The ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) 2003, Annapolis, MD, June 2003.
28. Roy Want, Andy Hopper, Veronica Falcão, and Jonathan Gibbons, "The active badge location system," Tech. Rep. 92.1, Olivetti Research Ltd. (ORL), 24A Trumpington Street, Cambridge CB2 1QA, 1992.
29. A. Ward, A. Jones, and A. Hopper, "A new location technique for the active office," IEEE Personal Communications, vol. 4, no. 5, pp. 42-47, 1997.
30. J. Werb and C. Lanzl, "Designing a positioning system for finding things and people indoors," IEEE Spectrum, vol. 35, no. 9, pp. 71-78, October 1998.
31. Deborah Estrin, Ramesh Govindan, John S. Heidemann, and Satish Kumar, "Next century challenges: Scalable coordination in sensor networks," in Proceedings of The Fifth International Conference on Mobile Computing find Networking (Mobicom) 1999, Seattle, WA, Nov. 1999, pp. 263-270.
32. Paramvir Bahl and Venkata N. Padmanabhan, "RADAR: An in-building RF-based user location and tracking system," in Proceedings of IEEE INFOCOM '00, Tel Aviv, Israel, Mar. 2000, pp. 775-784.
33. N. Bulusu, J. Heidemann, and D. Estrin, "GPS-less low-cost outdoor localization for very small devices," IEEE Personal Communications Magazine, vol. 7, no. 5, pp. 28-34, October 2000.
34. Nissanka B. Priyantha, Anit Chakraborty, and Hari Balakrishnan, "The cricket location-support system," in Proceedings of The Sixth International Conference on Mobile Computing and Networking (Mobicom) 2000, Boston, MA, Aug. 2000, pp. 32-43.
35. Srdan Capkun, Maher Hamdi, and Jean-Pierre Hubaux, "GPS-free positioning in mobile ad-hoc networks," in HICSS, 2001.
36. Jeffrey Hightower and Gaetano Borriella, "Location systems for ubiquitous computing," IEEE Computer, vol. 34, no. 8, pp. 57-66, 2001.
37. L. Girod and D. Estrin, "Robust range estimation using acoustic and multimodal sensing," in IEEE/RSI Int. Conf. on Intelligent Robots and Systems (IROS), 2001.
38. Joe Albowicz, Alvin Chen, and Lixia Zhang, "Recursive position estimation in sensor networks," in Proceedings of the 9th International Conference on Network Protocols '01, Riverside, CA, November 2001, pp. 35-41.
39. L. Doherty, K. S. J. Pister, and L. E. Ghaoui, "Convex position estimation in wireless sensor networks," in Proceedings of IEEE INFOCOM '01, Anchorage, AK, Apr. 2001, pp. 1655-1633.
40. D. Niculescu and B. Nath., "Ad-hoc positioning system.," in Proceedings of IEEE Globecom 2001, November 2001.
41. C. Savarese, J. Rabay, and K. Langendoen, "Robust positioning algorithms for distributed ad-hoc wireless sensor networks,'" in USENIX Technical Annual Conference, Monterey, CA, June 2002.
42. Dragos Niculescu and Badri Nath, "Ad hoc positioning system (APS) using AOA," in Proceedings of IEEE INFOCOM '03, San Francisco, CA, Apr. 2003.
43. Abdo Y. Alfakih, Amir Khandani, and Henry Wolkowicz, "Solving Euclidean distance matrix completion problems via semidefinite programming," Comput. Optim. Appl., vol. 12, no. 1-3, pp. 13-30, 1999.
44. L. Hennebera, Die Graphische Statik der starren Systeme, Johnson Reprint, 1911.
45. Bhaskar Krishnamachari, Stephen B. Wicker, and Ramon Bejar, "Phase transition phenomena in wireless ad-hoc networks," in Proceedings of Symposium on Ad-Hoc Wireless Networks, GlobeCom 2001, Antonio, Texas, 2001.
46. J. Díaz, J. Petit, and M. Serna, "Random scaled sector graphs," Tech. Rep. LSI-02-47-R, Departament de Llenguatges i Sistemes Inform'atics, Universitat Polit'ecnica de Catalunya, June 2002.
47. J. Díaz, J. Petit, and M. Serna, "A random graph model for optical networks of sensors," Tech. Rep. LSI-02-72-R, Departament de Llenguatges i Sistemes Inform'atics, Universitat Polit'ecnica de Catalunya, December 2002.
48. Andras Farago, "Scalable analysis and design of ad hoc networks via random graph theory," in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002, pp. 43-50, ACM Press.