Graph theoretic techniques in the analysis of uniquely localizable sensor networks

Localization Algorithms and Strategies for Wireless Sensor Networks

Volumn , Issue , 2009, Pages 146-173

  Jackson, Bill ^a   Jordán, Tibor ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84863728604     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60566-396-8.ch006     Document Type: Chapter

References (52)

1. Anderson, B.D.O., Belhumeur, P.N., Eren, T., Goldenberg, D.K., Morse, A.S., Whiteley, W. & Yang, Y.R. (2007) Graphical properties of easily localizable sensor networks.Wireless Netw., to appear
2. Aspnes, J., Eren, T., Goldenberg, D.K., Morse, A.S., Whiteley, W., Yang, Y.R., Anderson, B.D.O. & Belhumeur, P.N. (2006) A theory of network localization, IEEE Trans. on Mobile Computing, 5(12),1663-1678.
3. Aspnes, J., Goldenberg, D.K. & Yang, Y.R. (2004) On the computational complexity of sensor network localization, Springer Lecture Notes in Computer Science 3121, Algorithmic Aspects of Wireless Sensor Networks, (pp. 32-44). Berlin, Springer.
4. Berg, A. & Jordán, T. (2003/a) A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid, J. Combinatorial Theory, Ser. B. 88, 77-97.
5. Berg, A. & Jordán, T. (2003/b) Algorithms for graph rigidity and scene analysis, In G. Di Battista & U. Zwick, (Ed), 11th Annual European Symposium on Algorithms (ESA) (pp.78-89), Springer Lecture Notes in Computer Science 2832. Berlin, Springer.
6. Berger, B., Kleinberg, J. & Leighton, T. (1999) Reconstructing a three-dimensional model with arbitrary errors, Journal of the ACM, 46 (2), 212-235.
7. Bollobás, B. (1985) Random graphs, New York, Academic Press.
8. Bondy, J.A. & Murty, U.S.R. (2008) Graph theory, Springer.
9. Breu, H. & Kirkpatrick, D.G. (1998) Unit disk graph recognition is NP-hard. Comput, Geom. 9 (1-2), 3-24.
10. Cheung, M. & Whiteley, W. (2008) Transfer of global rigidity results among dimensions: graph powers and coning, preprint, York University.
11. Connelly, R. (1982) Rigidity and energy. Invent. Math., 66(1), 11-33.
12. Connelly, R. (1991) On generic global rigidity, Applied geometry and discrete mathematics, 147-155, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 4, Amer. Math. Soc., Providence, RI.
13. Connelly, R. (2005) Generic global rigidity. Discrete Comput, Geom. 33, 549-563.
14. Crapo, H. (1990) On the generic rigidity of plane frameworks, INRIA research report No. 1278.
15. Eren, T., Goldenberg, D., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O. & Belhumeur, P.N. (2004) Rigidity, Computation, and Randomization in Network Localization, In IEEE INFOCOM Conference, (pp. 2673-2684) Hong Kong.
16. Eren, T., Whiteley, W., Morse, A.S., Belhumeur, P.N. & Anderson, B.D.O. (2003) Sensor and network topologies of formations with direction, bearing and angle information between agents, In 42nd IEEE Conference on Decision and Control, (pp. 3064-3069).
17. Eren, T., Using angle of arrival (bearing) information for localization in robot networks, Turk J Elec Engin, Vol 15(2), 169-186.
18. Fekete, Z. (2006) Source location with rigidity and tree packing requirements, Operations Research Letters 34(6), 607-612.
19. Fekete, Z. & Jordán, T. (2006) Uniquely localizable networks with few anchors, In S. Nikoletseas, S. & Rolim, J.D.P. (Ed.) Algosensors 2006, (pp. 176-183). Springer Lecture Notes in Computer Science 4240.
20. Fekete, Z. & Jordán, T. (2008) Algorithms for minimum cost anchor sets in uniquely localizable networks, preprint.
21. Gabow, H.N. & Westermann, H.H. (1992) Forests, frames and games: Algorithms for matroid sums and applications, Algorithmica 7, 465-497.
22. Gluck, H. (1975) Almost all simply connected closed surfaces are rigid, Geometric topology (Proc. Conf., Park City, Utah, 1974), pp. 225-239. Lecture Notes in Math., 438, Springer, Berlin.
23. Goldenberg, D.K., Krishnamurthy, A., Maness, W.C., Yang, Y.R., Young, A., Morse, A.S., Savvides, A. & Anderson, B.D.O. (2005) Network localization in partially localizable networks, In IEEE INFOCOM Conference, (pp. 313-326), Miami.
24. Gortler, S.J., Healy, A.D. & Thurston, D.P. (2007) Characterizing generic global rigidity, arXiv:0710.0926v3.
25. Graver, J., Servatius, B. & Servatius, H. (2003) Combinatorial Rigidity, AMS Graduate Studies in Mathematics 2.
26. Hendrickson, B. (1992) Conditions for unique graph realizations SIAM J. Comput.21 (1), 65-84.
27. Hendrickson, B. & Jacobs, D. (1997) An algorithm for two-dimensional rigidity percolation: the pebble game, J. Computational Physics 137, 346-365.
28. Henneberg, L. (1911) Die graphische Statik der starren Systeme, Leipzig.
29. Hopcroft J.E. & Tarjan, R.E. (1973) Dividing a graph into triconnected components SIAM J. Comput. 2, 135-158.
30. Imai, H. (1985) On combinatorial structures of line drawings of polyhedra. Discrete Appl. Math. 10, 79-92.
31. Jackson, B. & Jordán, T. (2005) Connected rigidity matroids and unique realizations of graphs, J. Combinatorial Theory, Ser. B., 94, 1-29.
32. Jackson, B., Jordán, T. & Szabadka, Z. (2006) Globally linked pairs of vertices in equivalent realizations of graphs, Discrete and Computational Geometry, 35, 493-512.
33. Jackson, B. & Jordán, T. (2008a) A sufficient connectivity condition for generic rigidity in the plane, Discrete Applied Math, in press.
34. Jackson, B & Jordán, T. (2008b) Globally rigid circuits of the two-dimensional direction-length rigidity matroid, J. Combinatorial Theory, Ser. B., to appear.
35. Jackson, B & Jordán, T. (2008c) Operations preserving global rigidity of generic direction-length frameworks, Egerváry Research Group TR-2008-08, submitted.
36. Jackson, B., Servatius, B. & Servatius, H. (2007) The 2-dimensional rigidity of certain families of graphs, J. Graph Theory 54 (2), 154-166.
37. Jordán, T. & Szabadka, Z. (in press) Operations preserving the global rigidity of graphs and frameworks in the plane, Comput. Geom.
38. Katz, B., Gaertler, M. & D. Wagner, (2007) Maximum rigid components as means for direction-based localization in sensor networks, In Jan van Leeuwen et al. (Ed) SOFSEM 2007, LNCS 4362, (pp. 330-341), Springer, Berlin.
39. Laman, G. (1970) On graphs and rigidity of plane skeletal structures, J. Engineering Math. 4, 331-340.
40. Li, X-Y., Wan, P-J., Wang, Y. & Yi, C.-W. (2003) Fault tolerant deployment and topology control in wireless networks. In ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (pp. 117-128), Annapolis, MD.
41. Lovász, L. & Yemini, Y. (1982) On generic rigidity in the plane SIAM. J. Algebraic Discrete Methods 3 (1), 91-98.
42. Mao, G., Fidan, B. & Anderson, B.D.O. (2007) Localisation, In N.P. Mahalik (Ed.) Sensor networks and configuration (pp. 281-315), Springer, Berlin.
43. Recski, A. (1989) Matroid theory and its applications in electric network theory and in statics, Budapest, Akadémiai Kiadó.
44. Saxe, J.B. (1979) Embeddability of weighted graphs in k-space is strongly NP-hard, (Tech. Report), Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA.
45. Schrijver, A. (2003) Combinatorial Optimization, Berlin, Springer.
46. Servatius B. & Whiteley, W. (1999) Constraining plane configurations in CAD: Combinatorics of directions and lengths SIAM J. Discrete Math., 12, 136-153.
47. So, A.M. & Ye, Y. (2007) Theory of semidefinite programming for sensor network localization, Math. Program. 109 (3) Ser. B, 367-384.
48. Tay, T.S. & Whiteley, W. (1985) Generating isostatic frameworks, Structural Topology 11, pp. 21-69.
49. Whiteley, W. (1990) Vertex splitting in isostatic frameworks, Structural Topology 16, 23-30.
50. Whiteley, W. (1996) Some matroids from discrete applied geometry. Matroid theory (Seattle, WA, 1995), 171-311, Contemp. Math., 197, Amer. Math. Soc., Providence, RI.
51. Whiteley, W. (2004) Rigidity and scene analysis, In J. E. Goodman and J. O'Rourke (Eds.) Handbook of Discrete and Computational Geometry, (pp. 1327-1354), CRC Press, Second Edition.
52. Yemini, Y. (1979) Some theoretical aspects of position-location problems, In 20th Annual IEEE Symposium on Foundations of Computer Science, (pp. 1-8).