Article thumbnail

Evaluation of geocast routing trees on random and actual networks

By Berend Jan Meijerink, Mitra Baratchi, Geert Heijenk, Yevgeni Koucheryavy, Lefteris Mamatas, Ibrahim Matta, Aleksandr Ometov and Panagiotis Papadimitriou

Abstract

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

Topics: Geocast, Multicast, Routing, Shortest path tree, Steiner tree, Theoretical Computer Science, Computer Science(all)
Publisher: Springer
Year: 2017
DOI identifier: 10.1007/978-3-319-61382-6_11
OAI identifier:
Provided by: NARCIS
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.loc.gov/mods/v3 (external link)
  • https://ris.utwente.nl/ws/oai (external link)
  • https://research.utwente.nl/en... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.