Abstract
We show that face routing, the well-known local routing algorithm for plane graphs introduced by Kranakis and Urrutia, does not in fact succeed for embedded graphs on the torus or higher genus surfaces (contrary to conjecture). We then describe a generalization of face routing, and prove that this algorithm does provide a local routing algorithm for arbitrary graphs embedded in the torus. Finally we discuss extension of this type of algorithm to surfaces of genus g, describing the problems encountered in this setting.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kranakis, E., Singh, H., Urrutia, J.: Compass Routing on Geometric Networks. In: CCCG 1999. Proceedings of 11th Canadian Conference on Computational Geometry, August 15-18, 1999, Vancouver pp. 51–54 (1999)
Boone, P., Chavez, E., Gleitzky, L., Kranakis, E., Opatrny, J., Salazar, G., Urrutia, J.: Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-hoc Networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, Springer, Heidelberg (2004)
In: The 5th Workshop: Routing in Guanajuato comments of Jaroslav Opatrny (August 2006)
Kranakis, E., et al.: Routing in Mexico: The First Five Years and Beyond. In: Summary of problems discussed in the series of workshops. Routing in Morelia 2002, 2003, 2004 and Routing in Guanajuato 2005, 2006 with outlook to Routing in Oaxaca 2007 (August 2006)
Massey, W.S.: Algebraic Topology: An Introduction. Springer, New York (1967)
Fuchs, D.B., Fomenko, A.T., Gutenmacher, V.L.: A Course in Homotopic Topology, H Stillman Pub. (June 1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraser, M. (2007). Local Routing on Tori. In: Kranakis, E., Opatrny, J. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2007. Lecture Notes in Computer Science, vol 4686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74823-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-74823-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74822-9
Online ISBN: 978-3-540-74823-6
eBook Packages: Computer ScienceComputer Science (R0)