Skip to main content

A Novel Buffer Management Architecture for Epidemic Routing in Delay Tolerant Networks (DTNs)

  • Conference paper
Quality, Reliability, Security and Robustness in Heterogeneous Networks (QShine 2010)


Delay tolerant networks (DTNs) are wireless networks in which an end-to-end path for a given node pair can never exist for an extended period. It has been reported as a viable approach in launching multiple message replicas in order to increase message delivery ratio and reduce message delivery delay. This advantage, nonetheless, is at the expense of taking more buffer space at each node. The combination of custody and replication entails high buffer and bandwidth overhead. This paper investigates a new buffer management architecture for epidemic routing in DTNs, which helps each node to make a decision on which message should be forwarded or dropped. The proposed buffer management architecture is characterized by a suite of novel functional modules, including Summary Vector Exchange Module (SVEM), Networks State Estimation Module (NSEM), and Utility Calculation Module (UCM). Extensive simulation results show that the proposed buffer management architecture can achieve superb performance against its counterparts in terms of delivery ratio and delivery delay.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Delay tolerant networking research group,

  2. Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000)

    Google Scholar 

  3. Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communication Review 7(3) (2003)

    Google Scholar 

  4. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Efficient routing in intermittently connected mobile networks: The multiple-copy case. ACM/IEEE Transactions on Networking (February 2008)

    Google Scholar 

  5. Groenevelt, R., Koole, G., Nain, P.: Message delay in manet (extended abstract). In: Proc. ACM Sigmetrics (2005)

    Google Scholar 

  6. Elwhishi, A., Ho, P.-H.: SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks. In: GLOBECOM 2009, pp. 1–7 (2009)

    Google Scholar 

  7. Erramilli, V., Crovella, M., Chaintreau, A., Diot, C.: Delegation forwarding. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Hong Kong, Hong Kong, China (May 26-30, 2008)

    Google Scholar 

  8. Ip, Y.-K., Lau, W.-C., Yue, O.-C.: Performance modeling of epidemic routing with heterogeneous node types. In: Proc. of IEEE ICC (2008)

    Google Scholar 

  9. Zhang, X., Neglia, G., Kurose, J., Towsley, D.: Performance modeling of epidemic routing. In: Proceedings of IFIP Networking (2006)

    Google Scholar 

  10. Lindgren, A., Phanse, K.: Evaluation of Queueing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks. In: First International Conference on Communication System Software and Middleware (2006)

    Google Scholar 

  11. Krifa, A., Barakat, C., Spyropoulos, T.: Optimal buffer management policies for delay tolerant networks. In: Proc. of IEEE SECON (2008)

    Google Scholar 

  12. Nelson, S.C., Bakht, M., Kravets, R., Harris, A.F.: Encounter based routing in DTNs. SIGMOBILE Mob. Comput. Commun. Rev. 13(1), 56–59 (2009),

    Article  Google Scholar 

  13. Spyropoulos, T., Turletti, T., Obraczka, K.: Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations. IEEE Transactions on Mobile Computing 8(8), 1132–1147 (2009), doi:10.1109/TMC.2008.172

    Article  Google Scholar 

  14. Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (monograph in preparation),

  15. Balasubramanian, A., Levine, B., Venkataramani, A.: DTN routing as a resource allocation problem. In: Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Kyoto, Japan (August 27-31, 2007)

    Google Scholar 

  16. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Performance analysis of mobility-assisted routing. In: Proceedings of ACM MOBIHOC (2006)

    Google Scholar 

  17. Thomas Karagiannis, M.V., Le Boudec, J.-Y.: Power law and exponential decay of inter contact times between mobile devices. In: Proc. of ACM/IEEE MobiCom (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Elwhishi, A., Ho, PH., Naik, K., Shihada, B. (2012). A Novel Buffer Management Architecture for Epidemic Routing in Delay Tolerant Networks (DTNs). In: Zhang, X., Qiao, D. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 74. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29221-7

  • Online ISBN: 978-3-642-29222-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics