Max-Util: A Utility-Based Routing Algorithm for a Vehicular Delay Tolerant Network Using Historical Information

  • Milind R. Penurkar
  • Umesh A. Deshpande
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)


A vehicular delay tolerant network (VDTN) has emerged as special type of delay tolerant network (DTN), characterized by the non-existence of end-to-end connectivity between different source nodes and destination nodes thereby diminishing the possibility of delivering messages to the destination node. Hence, routing becomes a vital issue in VDTN. In this paper, a utility-based routing algorithm (Max-Util) for a VDTN has been proposed. This algorithm exploits the historical information of a node for computing the utility of a node to take a decision to forward a message among nodes. This history comprises the past encounters of a node with destination and relay nodes, the contact duration between nodes and the remaining buffer size of a node in contact. Our evaluations show that, Max-Util performs better in terms of message delivery ratio, overhead ratio and average delivery latency as compared to some existing DTN routing approaches like PRoPHET and Spray-and-Wait.


Vehicular delay tolerant networks Intermittent connectivity Routing Utility Forwarding Flooding 


  1. 1.
    Johnson, D., Maltz, d.: Dynamic source routing in ad-hoc wireless networks. In: ACM SIGCOMM, Aug 1996Google Scholar
  2. 2.
    Perkins, C., Royer, E.: Ad hoc on-demand distance vector routing. In: 2nd IEEE workshop on mobile computing systems and applications, Feb 1999Google Scholar
  3. 3.
    Spyropoulos, T., Rais, R.N.B., Turletti, T., Obraczka, K., Vasilakos, T.: Routing for Disruption Tolerant Networks: Taxonomy and Design. In: ACM/Kluwer Wireless, Networks (WINET), vol. 16. No. 8, (2010)Google Scholar
  4. 4.
    Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. Lect. Notes Comput. Sci. 3126, 239–254 (2004)CrossRefGoogle Scholar
  5. 5.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Wait: Efficient routing in intermittently connected mobile networks. In Proceedings of ACM SIGCOMM workshop on delay tolerant networking (WDTN-2005)Google Scholar
  6. 6.
    Spyropoulos, T., Turletti, T., Obraczka, K.: Routing in delay tolerant networks comprising heterogeneous node populations. IEEE Trans. Mob. Comput. (TMC) 8(8), 1132–1147 (2009)CrossRefGoogle Scholar
  7. 7.
    Jain, S., Fall, k., Patra, R.: Routing in a delay tolerant network. In: Annual international conference of the special interest group on data communication, ACM SIGCOMM’04, Aug 30-Sept 3: Portland. Oregon, USA (2004)Google Scholar
  8. 8.
    Spyropoulos, T., Psounis, K., Raghavendra, C.: Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceedings of IEEE PERCOM, on the international workshop on intermittently connected mobile ad hoc networks (ICMAN) (2007)Google Scholar
  9. 9.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report, CS-06, Duke University (2000)Google Scholar
  10. 10.
    Nelson, S.C., Bakht, M., Kravets, R.: Encounter-based routing in DTNs. In Proceedings of the IEEE INFOCOM. Rio de Janerio, Brazil (2009)Google Scholar
  11. 11.
    Rubinstein, M., et al.: Measuring the capacity of in-car to in-car vehicular networks. IEEE Commun. Mag. 47(11), 128–136 (2009)CrossRefGoogle Scholar
  12. 12.
    Ari Keränen, Jörg Ott, Teemu Kärkkäinen, The ONE Simulator for DTN Protocol Evaluation. In: Proceedings of the 2nd international conference on simulation tools and techniques, SIMU Tools’09, Rome, Italy (2009)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringVNITNagpurIndia

Personalised recommendations