Evaluation of Geocast Routing Trees on Random and Actual Networks

  • Bernd MeijerinkEmail author
  • Mitra Baratchi
  • Geert Heijenk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10372)


Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study addressing the efficiency of possible routing trees for geocast packets. We evaluate the Shortest Path Tree, Minimum Spanning Tree and a Steiner Heuristic based routing tree for geocast packet distribution on real world networks and random graphs. We compare the results to those for multicast routing for which such evaluations have been performed in the past. Our results show that due to the correlation of geographic distance and network distance in most wired networks, Shortest Path forwarding efficiency can come close to an ideal Steiner Tree. We also identify a correlation between the forwarding efficiency and network characteristics such as the node degree and betweenness. This information could be useful in deciding on a choice of routing method or even help with network design.


Geocast Multicast Routing Shortest Path Tree Steiner tree 


  1. 1.
    Karagiannis, G., Heijenk, G., Festag, A., Petrescu, A., Chaiken, A.: Internet-wide geo-networking problem statement (2013).
  2. 2.
    Navas, J.C., Imielinski, T.: GeoCast - geographic addressing and routing. In: Pap, L., Sohraby, K., Johnson, D.B., Rose, C. (eds.) MOBICOM, pp. 66–76. ACM (1997)Google Scholar
  3. 3.
    Doar, M., Leslie, I.: How bad is naive multicast routing? In: Proceedings of the Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future (INFOCOM 1993), pp. 82–89. IEEE (1993)Google Scholar
  4. 4.
    Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J. Sel. Areas Commun. 15(3), 332–345 (1997)CrossRefGoogle Scholar
  5. 5.
    Meijerink, B., Baratchi, M., Heijenk, G.: An efficient geographical addressing scheme for the internet. In: Mamatas, L., Matta, I., Papadimitriou, P., Koucheryavy, Y. (eds.) WWIC 2016. LNCS, vol. 9674, pp. 78–90. Springer, Cham (2016). doi: 10.1007/978-3-319-33936-8_7 CrossRefGoogle Scholar
  6. 6.
    Nguyen, U.T., Xu, J.: Multicast routing in wireless mesh networks: minimum cost trees or shortest path trees? IEEE Commun. Mag. 45(11), 72–77 (2007)CrossRefGoogle Scholar
  7. 7.
    Knight, S., Nguyen, H., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765–1775 (2011)CrossRefGoogle Scholar
  8. 8.
    Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15(2), 141–145 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy 2008), Pasadena, pp. 11–15, August 2008Google Scholar
  10. 10.
    Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  • Bernd Meijerink
    • 1
    Email author
  • Mitra Baratchi
    • 1
  • Geert Heijenk
    • 1
  1. 1.University of TwenteEnschedeThe Netherlands

Personalised recommendations