Evaluation of geocast routing trees on random and actual networks

Berend Jan Meijerink, Mitra Baratchi, Geert Heijenk

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)

    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.

    Original languageEnglish
    Title of host publicationWired/Wireless Internet Communications
    Subtitle of host publication15th IFIP WG 6.2 International Conference, WWIC 2017, Proceedings
    EditorsYevgeni Koucheryavy, Lefteris Mamatas, Ibrahim Matta, Aleksandr Ometov, Panagiotis Papadimitriou
    PublisherSpringer
    Pages127-142
    Number of pages16
    ISBN (Electronic)978-3-319-61382-6
    ISBN (Print)978-3-319-61381-9
    DOIs
    Publication statusPublished - 2017

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume10372
    ISSN (Print)0302-9743

    Keywords

    • Geocast
    • Multicast
    • Routing
    • Shortest path tree
    • Steiner tree

    Fingerprint Dive into the research topics of 'Evaluation of geocast routing trees on random and actual networks'. Together they form a unique fingerprint.

  • Cite this

    Meijerink, B. J., Baratchi, M., & Heijenk, G. (2017). Evaluation of geocast routing trees on random and actual networks. In Y. Koucheryavy, L. Mamatas, I. Matta, A. Ometov, & P. Papadimitriou (Eds.), Wired/Wireless Internet Communications: 15th IFIP WG 6.2 International Conference, WWIC 2017, Proceedings (pp. 127-142). (Lecture Notes in Computer Science; Vol. 10372). Springer. https://doi.org/10.1007/978-3-319-61382-6_11