Abstract
The main aim of this paper is to give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we firstly present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that some known greedy routing algorithms such as Greedy Routing, Compass Routing, and Midpoint Routing can be regarded as special cases of the generalized greedy routing algorithm. In addition, inspired by the unified view of greedy routing, we propose three new greedy routing algorithms. We then derive a sufficient condition for our generalized greedy routing algorithm to guarantee packet delivery on every Delaunay graph. This condition makes it easier to check whether a given routing algorithm guarantees packet delivery, and the class of objective functions with this condition is closed under convex combination. We show that Greedy Routing, Midpoint Routing, and the three new greedy routing algorithms proposed in this paper satisfy the sufficient condition, i.e., they guarantee packet delivery on Delaunay graphs, and then compare the merits and demerits of these methods.
This is a preview of subscription content, log in via an institution to check access.
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
Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33, 937–951 (2004)
Bose, P., Devroye, L., Loeffler, M., Snoeyink, J., Verma, V.: The spanning ratio of the Delaunay triangulation is greater than π/2. In: Proc. CCCG 2009, pp. 165–167 (2009)
Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. University of Southern California, Tech. Rep. ISI/RR-87-180 (1987)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. CCCG 1999, pp. 51–54 (1999)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications, 2nd edn. Springer, Berlin (1999)
Rührup, S.: Theory and practice of geometric routing. In: Liu, H., Chu, X., Leung, Y.-W. (eds.) Ad Hoc and Sensor Wireless Networks: Architectures, Algorithms and Protocols. Bentham Science (2009)
Si, W., Zomaya, A.Y.: Midpoint routing algorithms for Delaunay graphs. In: Proc. IPDPS 2010, pp. 1–7 (2010)
Stojmenovic, I.: Position based routing in ad hoc networks. IEEE Commun. Magazine 40, 128–134 (2002)
Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32, 246–257 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chun, J., Shioura, A., Tien, T.M., Tokuyama, T. (2013). A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)