IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i3p325027.html
   My bibliography  Save this article

Routing Protocols for Vehicular Delay Tolerant Networks: A Survey

Author

Listed:
  • Hyunwoo Kang
  • Syed Hassan Ahmed
  • Dongkyun Kim
  • Yun-Su Chung

Abstract

Recently, the delay tolerant networks (DTN) have been utilized in various operational communication paradigms. This includes the communication scenarios that are subject to disruption and disconnection as well as the scenarios with high delay and frequent partitioning, that is, vehicular ad hoc networks (VANETs). Due to the several characteristics match, new research paradigm named as vehicular delay tolerant networks (VDTNs) is introduced. Through relays and store-carry-forward mechanisms, messages in VDTNs can be delivered to the destination without an end-to-end connection for delay-tolerant applications. However, the choice of routing algorithms in VDTNs is still under study. The main objective of routing protocols in VDTNs is to maximize the probability of delivery at the destination while minimizing the end-to-end delay. Until now, many routing protocols have been proposed to meet requirements of varying applications. In this paper, we, therefore, provide a detailed study of recently proposed routing schemes for VDTNs. We also perform comparative analysis on the basis of unique criterion such as forwarding metrics with their implementations. In addition, open challenges and future directions are provided to make room of interest for the research community.

Suggested Citation

  • Hyunwoo Kang & Syed Hassan Ahmed & Dongkyun Kim & Yun-Su Chung, 2015. "Routing Protocols for Vehicular Delay Tolerant Networks: A Survey," International Journal of Distributed Sensor Networks, , vol. 11(3), pages 325027-3250, March.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:3:p:325027
    DOI: 10.1155/2015/325027
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/325027
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/325027?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:3:p:325027. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.