Analytical model of epidemic routing for delay-tolerant networks

  • Authors:
  • Qingshan Wang;Zygmunt J. Haas

  • Affiliations:
  • Hefei University of Technology, Hefei, China;Cornell University, Ithaca, NY, USA

  • Venue:
  • Proceedings of the 1st ACM workshop on High performance mobile opportunistic systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Epidemic routing is considered as one of the most effective routing schemes for delay-tolerant networks; indeed, epidemic routing allows for shortest routing delays. Most of the analytical work in the technical literature concentrates on the latency from the packet creation time until its reception by the destination. However, gaining insight into the temporal nature of the epidemic routing process can be of significant value; e.g., in designing new variations of the epidemic routing protocol. In this paper, we derive an analytical iterative model for packet propagation in a mobile network, where the dynamic connectivity among network nodes is modeled by a random graph. We investigate the probability distribution function of the number of infected nodes, the average number of infected nodes, and the probability of all nodes becoming infected, all as functions of time. We also provide simulation results, which confirm our analytical model. As part of our study, we observed several interesting phenomena, e.g., the dramatic impact that even a modest increase of nodal speed has on the infection rate, especially at low speeds.