Abstract
Geometric routing by using virtual locations is an elegant way for solving network routing problem. In its simplest form, greedy routing, a message is forwarded to a neighbor that is closer to the destination. One major drawback of this approach is that the virtual coordinates requires Ω(nlogn) bits to represent, which makes this scheme infeasible in some applications.
In this paper, we introduce a modified version of greedy routing which we call generalized greedy routing algorithm. Instead of relying on decreasing distance for routing decision, our routing algorithms use other criterion to determine routing path, solely based on local information. We present simple generalized greedy routing algorithms based on Schnyder coordinates (consisting of three integers between 0 and 2n), which are derived from Schnyder realizer for plane triangulations and Schnyder wood for 3-connected plane graphs. The algorithms are simple and can be easily implemented in linear time.
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
Angelini, P., Battista, G.D., Frati, F.: Succinct greedy drawings do not always exist. In: Proc. GD 2009 (to appear, 2009)
Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 26–37. Springer, Heidelberg (2009)
Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected planar graph. Algorithmica 47, 399–420 (2007)
Ben-Chen, M., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: Proc. SoCG 2007, pp. 210–219 (2007)
Comer, D.: Internetworking with TCP/IP, Principles, Protocols, and Architecture, vol. 1. Prentice-Hall, Inc., Upper Saddle River (2006)
Dhandapani, R.: Greedy drawings of triangulations. In: SODA 2008, pp. 102–111 (2008)
Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive Reporting of Disjoint Paths. Algorithmica 23(4), 302–340 (1999)
Eppstein, D., Goodrich, M.T.: Succinct greedy graph drawing in the hyperbolic plane. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 14–25. Springer, Heidelberg (2009)
Felsner, S.: Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. Order 18, 19–37 (2001)
Felsner, S.: Geodesic Embeddings and Planar Graphs. Order 20, 135–150 (2003)
Felsner, S., Zickfeld, F.: Schnyder Woods and Orthogonal Surfaces. Discreate Comput. Geom. 40, 103–126 (2008)
Funke, S.: Topological hole detection in wireless sensor networks and its applications. In: DIALM-POMC 2005: Proc. the 2005 joint workshop on Foundations of mobile computing, pp. 44–53 (2005)
Goodrich, M.T., Strash, D.: Succinct Greedy Geometric Routing in the Euclidean Plane, submitted to arXiv: 0812.3893v3 (October 2009)
Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: Proc. FOCS 2008, pp. 337–346 (2008)
Lillis, K.M., Pemmaraju, S.V.: On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 69–86. Springer, Heidelberg (2008)
Muhammad, R.B.: A distributed geometric routing algorithm for ad hoc wireless networks. In: Proc. 4th Inter. Conf. on Info. Tech (ITNG 2007), pp. 961–963 (2007)
Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science 344(1), 3–14 (2005)
Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proc. Mobicom 2003, pp. 96–108 (2003)
Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)
Schnyder, W.: Embedding planar graphs on the grid. In: Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138–148 (1990)
Tanenbaum, A.S.: Computer networks, 4th edn. Prentice-Hall, Englewood Cliffs (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, X., Zhang, H. (2010). Schnyder Greedy Routing Algorithm. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-13562-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13561-3
Online ISBN: 978-3-642-13562-0
eBook Packages: Computer ScienceComputer Science (R0)