Uniquely localizable networks with few anchors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4240 LNCS, Issue , 2006, Pages 176-183

  Fekete, Zsolt ^a   Jordán, Tibor ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

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

Author keywords

[No Author keywords available]

Indexed keywords

ANCHOR NODES; GRAPH RIGIDITY THEORY; LOCALIZATION PROBLEMS; MATROID THEORY; NETWORK LOCALIZATION; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; TWO-DIMENSION;

ANCHORS; APPROXIMATION ALGORITHMS; LOCATION; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; RIGIDITY; SENSOR NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 75649092864     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11963271_16     Document Type: Conference Paper

References (17)

1. J. ASPNES, T. EREN, D.K. GOLDENBERG, A.S. MORSE, W. WHITELEY, Y.R. YANG, B.D.O. ANDERSON, P.N. BELHUMEUR, A theory of network localization, Trans. Mobile Computing, to appear.
2. A.R. BERG AND T. JORD́AN, Algorithms for graph rigidity and scene analysis, Proc. 11th Annual European Symposium on Algorithms (ESA) 2003, (G. Di Battista, U. Zwick, eds) Springer Lecture Notes in Computer Science 2832, pp. 78-89, 2003.
3. T. EREN, D. GOLDENBERG, W. WHITELEY, Y. R. YANG, A. S. MORSE, B. D. O. ANDERSON, AND P. N. BELHUMEUR, Rigidity, Computation, and Randomization in Network Localization, Proc. of the IEEE INFOCOM Conference, Hong-Kong, March 2004, pp. 2673-2684.
4. Z. FEKETE AND T. JORD́AN, Uniquely localizable networks with few anchors, EGRES TR-2006-07, www.egres.hu/egres/
5. B. HENDRICKSON, Conditions for unique graph realizations, SIAM J. Comput. 21 (1992), no. 1, 65-84.
6. J.E. HOPCROFT AND R.E. TARJAN, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973), 135-158.
7. B. JACKSON AND T. JORD́AN, Connected rigidity matroids and unique realizations of graphs, J. Combinatorial Theory, Ser. B., Vol. 94, 1-29, 2005.
8. B. JACKSON, T. JORD́AN, AND Z. SZABADKA, Globally linked pairs of vertices in equivalent realizations of graphs, Discrete and Computational Geometry, Vol. 35, 493-512, 2006.
9. G. LAMAN, On graphs and rigidity of plane skeletal structures, J. Engineering Math. 4 (1970), 331-340.
10. M. LOREA, Hypergraphes et matroides, Cahiers Centre Etud. Rech. Oper. 17 (1975) pp. 289-291.
11. L. LOV́ASZ, The matroid matching problem, in: Algebraic methods in graph theory, Proc. Conf. Szeged (1978).
12. L. LOV́ASZ AND Y. YEMINI, On generic rigidity in the plane, SIAM J. Algebraic Discrete Methods 3 (1982), no. 1, 91-98.
13. M. MAKAI, Matroid matching with Dilworth truncation, Proc. EuroComb 2005, Berlin.
14. A. RECSKI, Matroid theory and its applications in electric network theory and in statics, Akad́emiai Kiad́o, Budapest, 1989.
15. A. SCHRIJVER, Combinatorial Optimization, Springer, Berlin, 2003.
16. A. MAN-CHO SO AND Y. YE, Theory of semidefinite programming for sensor network localization, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005.
17. W. WHITELEY, Some matroids from discrete applied geometry, in Matroid theory (J.E. Bonin, J.G. Oxley and B. Servatius eds., Seattle,WA, 1995), Contemp. Math., 197, Amer. Math. Soc., Providence, RI, 1996, 171-311.