Half-space proximal: A new local test for extracting a bounded dilation spanner of a unit disk graph

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

Volumn 3974 LNCS, Issue , 2006, Pages 235-245

  Chavez, Edgar ^a   Dobrev, Stefan ^b   Kranakis, Evangelos ^c   Opatrny, Jaroslav ^d   Stacho, Ladislav ^e   Tejeda, Héctor ^a   Urnitia, Jorge ^f  

^a Escuela de Ciencias Físico Matemáticas de la Universidad Michoacana   (Mexico)

^b UNIVERSITY OF OTTAWA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

^d Dept of Electrical and Computer Engineering   (Canada)

^e SIMON FRASER UNIVERSITY   (Canada)

^f UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

HALF-SPACE; LOCAL TESTS; METRIC SPACES; MINIMUM WEIGHT SPANNING TREES; ROTATION INVARIANT; SIMPLE ALGORITHM; STRONGLY CONNECTED; SUBGRAPHS; UNIT DISK GRAPHS; YAO GRAPHS;

GEOMETRY; TESTING;

DIRECTED GRAPHS;

EID: 84870836209     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795490_19     Document Type: Conference Paper

References (18)

1. S. Arya, G. Das, D. M. Mount, J. S. Salowe, M. Smid, Euclidean spanners: short, thin, and lanky, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.489-498, 1995.
2. L. Barriere, P. Fraignaud, L. Narayanan, and J. Opatrny, Robust position-based routing in wireless ad hoc networks with unstable transmission ranges, In the Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 19-27, 2001.
3. P. Boone, E. Chavez, L. Gleitzky, E. Kranakis, J.Opatrny, G. Salazar, J. Urrutia, Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-hoc Networks, Proceedings of SIROCCO 2004, LNCS 3104, pp. 23-34, 2004.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In the Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 48-55, 1999.
5. J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Mobile Computing and Networking, pp. 85-97, 1998.
6. S. Datta, I. Stojmenovic, and J. Wu. Internai node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. IEEE Int. Conf. on Distributed Computing and Systems Workshops; Cluster Computing, pp. 461-466, 2001.
7. K. Gabriel and R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259-278, 1969.
8. J. Gao, L. Guibas, J. Hershberger, L. Zhang, A. Zhu, Geometric Spanner for Routing in Mobile Networks, Proceedings of the 2nd ACM International Symposium on Mobile Ad hoc Networking and Computing, pp. 45-55, 2001.
9. J. W. Jaromczyk and G. T. Toussaint, Relative neighborhood graphs and their relatives, Proc. IEEE, vol. 80, No. 9, pp. 1502-1517, 1992.
10. J.M. Keil and C.A. Gutwin, Classes of Graphs which approximate the complete euclidean graph, Discrete Comp. Geom., vol 7, pp 13-28, 1992.
11. E. Kranakis, H. Singh, and J. Urrutia, Compass Routing on Geometric Networks, In Proceedings of 11th Canadian Conference on Computational Geometry, pp. 51-54, Vancouver, August, 1999.
12. F. Kuhn, R. Wattenhofer, and A. Zollinger, Asymptotically Optimal Geometric Mobile Ad-Hoc Routing. In Proc. of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 24-33, 2002.
13. X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder, Sparse Power Efficient Topology for Wireless Networks, HICSS '02: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9, 296.2, 2002.
14. X. Li and Y. Wang, Efficient construction of low weight bounded degree planar spanner, in COCOON 2003, 2003.
15. Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks X.-Y. Li, G. Calinescu, and P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc wireless networks In IEEE INFOCOM, 2002.
16. C. E. Perkins, editor, Ad Hoc Networking, Addison Wesley, 2001.
17. G. Toussaint, The relative neighbourhood graph of a finite planar set, Pattern Recognition, 12(4):261-268, 1980. (Pubitemid 11447300)
18. A.C.-C. Yao, On constructing minimum spanning trees in k- dimensional spaces and related problems, SIAM Journal on Computing 11(4) (1982) 721-736.