A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks

  • Jinhee Chun
  • Akiyoshi Shioura
  • Truong Minh Tien
  • Takeshi Tokuyama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7718)


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.


geometric routing ad hoc network Delaunay graph greedy routing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33, 937–951 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. University of Southern California, Tech. Rep. ISI/RR-87-180 (1987)Google Scholar
  4. 4.
    Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. CCCG 1999, pp. 51–54 (1999)Google Scholar
  5. 5.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications, 2nd edn. Springer, Berlin (1999)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Si, W., Zomaya, A.Y.: Midpoint routing algorithms for Delaunay graphs. In: Proc. IPDPS 2010, pp. 1–7 (2010)Google Scholar
  8. 8.
    Stojmenovic, I.: Position based routing in ad hoc networks. IEEE Commun. Magazine 40, 128–134 (2002)CrossRefGoogle Scholar
  9. 9.
    Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. Commun. 32, 246–257 (1984)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jinhee Chun
    • 1
  • Akiyoshi Shioura
    • 1
  • Truong Minh Tien
    • 1
  • Takeshi Tokuyama
    • 1
  1. 1.GSISTohoku UniversitySendaiJapan

Personalised recommendations