Literature Database Entry


A. H. Cherify, K. Boussetta, G. Diaz and D. Fedoua, "Improving the performances of geographic VDTN routing protocols," Proceedings of 16th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2017), Budva, Montenegro, June 2017.


Vehicular Delay Tolerant Networks (VDTNs) routing protocols is a hot research topic in the global context of Intelligent Transport Systems (ITS). To cope with the intermittent connectivity of vehicular communications, numerous protocols based on Store Carry and Forward (SCF) paradigm were designed, ranging from an adaptation of generic Delay Tolerant Networks (DTNs) to those specifically dedicated to a vehicular mobility context. All these routing protocols use different kind of policies to decide when and to whom each node forwards its carried data. Typical strategies are based on epidemic dissemination, opportunistic forwarding or rely on some geographic information. GeOpps and GeoSpray are among the most referenced protocols within the geographic category. In this paper, we study multi-metric utility functions, which can be used in the routing decision. We also analyze the benefits of integrating custody and multi-copies strategies to propose a novel protocol, named GeoVDM. From the simulation results obtained under different scenarios combining the above strategies, we provide some guidelines regarding the design of our Geographic VDTN multi-metric routing protocol.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


A. H. Cherify
K. Boussetta
G. Diaz
D. Fedoua

BibTeX reference

    address = {Budva, Montenegro},
    author = {Cherify, A. H. and Boussetta, K. and Diaz, G. and Fedoua, D.},
    booktitle = {16th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2017)},
    doi = {10.1109/MedHocNet.2017.8001641},
    month = {6},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{Improving the performances of geographic VDTN routing protocols}},
    year = {2017},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.