Abstract
The sequence of adjacent nodes (graph walk) visited by a routing algorithm on a graph G between given source and target nodes s and t is a c-competitive route if its length in G is at most c times the length of the shortest path from s to t in G. We present 21.766-, 17.982- and 15.479-competitive online routing algorithms on the Delaunay triangulation of an arbitrary given set of points in the plane. This improves the competitive ratio on Delaunay triangulations from the previous best of 45.749. We present a 7.621-competitive online routing algorithm for Delaunay triangulations of point sets in convex position.
This work was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aurenhammer, F., Klein, R., Lee, D.-T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific (2013)
Bose, P., Brodnik, A., Carlsson, S., Demaine, E.D., Fleischer, R., López-Ortiz, A., Morin, P., Munro, I.: Online routing in convex subdivisions. Int. J. Comp. Geom. & App. 12(4), 283–295 (2002)
Bose, P., Carmi, P., Durocher, S.: Bounding the locality of distributed routing algorithms. Dist. Comp. 26(1), 39–58 (2013)
Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: ISVD, pp. 25–31 (2006)
Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theor. Comp. Sci. 324(2-3), 273–288 (2004)
Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comp. 33(4), 937–951 (2004)
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless N. 7(6), 609–616 (2001)
Braverman, M.: On ad hoc routing with guaranteed delivery. In: PODC, vol. 27, p. 418. ACM (2008)
Chen, D., Devroye, L., Dujmović, V., Morin, P.: Memoryless routing in convex subdivisions: Random walks are optimal. In: EuroCG, pp. 109–112 (2010)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)
Cui, S., Kanj, I.A., Xia, G.: On the stretch factor of Delaunay triangulations of points in convex position. Comp. Geom. 44(2), 104–109 (2011)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Disc. & Comp. Geom. 5, 399–407 (1990)
Durocher, S., Kirkpatrick, D., Narayanan, L.: On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wireless Net. 16, 227–235 (2010)
Fraser, M.: Local routing on tori. Adhoc and Sensor Wireless Net. 6, 179–196 (2008)
Fraser, M., Kranakis, E., Urrutia, J.: Memory requirements for local geometric routing and traversal in digraphs. In: CCCG, vol. 20, pp. 195–198 (2008)
Guan, X.: Face Routing in Wireless Ad-Hoc Networks. PhD thesis, University of Toronto (2009)
Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete euclidean graph. Disc. & Comp. Geom. 7, 13–28 (1992)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: CCCG, vol. 11, pp. 51–54 (1999)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile adhoc routing. In: DIALM, pp. 24–33. ACM (2002)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: DIALM-POMC, pp. 69–78. ACM (2003)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley Series in Probability and Statistics. Wiley (2009)
Si, W., Zomaya, A.Y.: New memoryless online routing algorithms for Delaunay triangulations. IEEE Trans. Par. & Dist. Sys. 23(8) (2012)
Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comp. 42(4), 1620–1659 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bose, P., De Carufel, JL., Durocher, S., Taslakian, P. (2014). Competitive Online Routing on Delaunay Triangulations. In: Ravi, R., Gørtz, I.L. (eds) Algorithm Theory – SWAT 2014. SWAT 2014. Lecture Notes in Computer Science, vol 8503. Springer, Cham. https://doi.org/10.1007/978-3-319-08404-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-08404-6_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08403-9
Online ISBN: 978-3-319-08404-6
eBook Packages: Computer ScienceComputer Science (R0)