Effect of Node Density and Node Movement Model on Performance of a VDTN

  • Kevin Bylykbashi
  • Evjola SpahoEmail author
  • Leonard Barolli
  • Makoto Takizawa
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 2)


In this paper, we evaluate the effect of node density and node movement model in a many-to-one communication in a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. The performance is analyzed for three routing protocols for delivery probability and average latency metrics. For both scenarios the effect of node density and node movement model is evaluated. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used.


Destination Node Movement Model Node Density Vehicular Network Delivery Probability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Keranen, J. Ott, and T. Karkkainen, “The ONE Simulator for DTN Protocol Evaluation,” in Proceedings of the 2-nd International Conference on Simulation Tools and Techniques (SIMUTools-2009), 2009,
  2. 2.
    K. Fall, “A delay-tolerant network architecture for challenged Internets,” in Proceedings of the International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, ser. SIGCOMM 03, 2003, pp. 2734.Google Scholar
  3. 3.
    “Delay- and disruption-tolerant networks (DTNs) tutorial,” NASA/JPLs Interplanetary Internet (IPN) Project, 2012,
  4. 4.
    N. Laoutaris, G. Smaragdakis, P. Rodriguez, and R. Sundaram, “Delay tolerant bulk data transfers on the Internet,” in Proceedings of the 11-th International Joint Conference on Measurement and Modeling of Computer Systems (SIGMETRICS09), 2009, pp. 22923.Google Scholar
  5. 5.
    V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, “Delay-tolerant networking architecture,” IETF RFC 4838 (Informational), April 2007.Google Scholar
  6. 6.
    K.Massri, A. Vernata, A. Vitaletti, “Routing Protocols for Delay Tolerant Networks: a Quantitative Evaluation,” In Proceedings of ACM workshop PM2HW2N’12, pp.107-114, 2012.Google Scholar
  7. 7.
    S. Ishikawa, T. Honda, M. Ikeda, and L. Barolli, “Performance analysis of vehicular DTN routing under urban environment,” in Proceedings of CISIS-2014, July 2014.Google Scholar
  8. 8.
    M. Demmer, K. Fall. “DTLSR: Delay Tolerant Routing for Developing Regions,” in Proceedings of the 2007 ACM workshop on Networked systems for developing regions, 6 pages, 2007.Google Scholar
  9. 9.
    A. A. Ilham, M. Niswar, Agussalim, “Evaluated and Optimized of Routing Model on Delay Tolerant Network (DTN) for Data Transmission to Remote Area” In Proceedings of FORTEI, Indonesia University Jakarta, pp.24-28, 2012.Google Scholar
  10. 10.
    S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” in Proceedings of ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Portland, Oregon, USA, August 30-September 3, 2004, pp. 145-158, 2004.Google Scholar
  11. 11.
    Z. Zhang, “Routing In Intermittently Connected Mobile Ad Hoc Networks And Delay,” Communications Surveys & Tutorials, IEEE (Volume:8, Issue:1), pp. 24-37, January 2006.Google Scholar
  12. 12.
    V. N. G. J. Soares, J. J. P. C. Rodrigues, and F. Farahmand, “GeoSpray: a geographic routing protocol for vehicular delay-tolerant networks,” Information Fusion, vol. 15, no. 1, pp. 102-113, 2014.Google Scholar
  13. 13.
    A. Vahdat, D. Becker “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-200006, Duke University, April 2000.Google Scholar
  14. 14.
    T. Spyropoulos, K. Psounis, C.S. Raghavendra, “Spray and Wait: an efficient routing scheme for intermittently connected mobile networks,” In Proceedings of ACM SIGCOMM 2005 Workshop on Delay Tolerant Networking and Related Networks (WDTN-05), Philadelphia, PA, USA, pp. 252-259, 2005.Google Scholar
  15. 15.
    J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, “Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networks”in Proceedings of the IEEE Infocom, April 2006.Google Scholar
  16. 16.
    A. Lindgren, A. Doria, E. Davies, S. Grasic, “Probabilistic Routing Protocol for Intermittently Connected Networks,” draft-irtf-dtnrg-prophet-09. (
  17. 17.
    “Open street map,”

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Kevin Bylykbashi
    • 1
  • Evjola Spaho
    • 2
    Email author
  • Leonard Barolli
    • 3
  • Makoto Takizawa
    • 4
  1. 1.Faculty of Information TechnologyPolytechnic University of TiranaTiranaAlbania
  2. 2.Department of Electronics and Telecommunication, Faculty of Information TechnologyPolytechnic University of TiranaTiranaAlbania
  3. 3.Department of Information and Communication EngineeringFukuoka Institute of Technology (FIT)Higashi-KuJapan
  4. 4.Department of Advanced SciencesHosei UniversityKoganei-shiJapan

Personalised recommendations