Skip to main content

An Epidemic Routing with Low Message Exchange Overhead for Delay Tolerant Networks

  • Conference paper
Progress in Systems Engineering

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 366))

Abstract

Epidemic routing strategy enables mobile nodes in Delay-Tolerant Networks (DTN) to send messages to destinations without requiring any predetermined path between source nodes to destination nodes. However, it can cause a large number of message exchanges and consequently degrades network performance. In this article, we propose a novel epidemic routing strategy called the Epidemic Message with Message List Advertisement (EM-MA) that exploits broadcasting nature of wireless medium and slotted time communication to reduce network congestion and nodes’ energy consumption without affecting the message delivery time. Additionally, we conduct intensive simulations to demonstrate and compare the performance of EM-MA with other existing routing strategies. The results show that EM-MA outperforms the existing routing strategies and is suitable to be used in DTN.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss, “Delay-tolerant networking: an approach to interplanetary internet,” Communications Magazine, IEEE 41(6), pp. 128–136, 2003.

    Google Scholar 

  2. M. J. Khabbaz, C. M. Assi, and W. F. Fawaz, “Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges,” Communications Surveys & Tutorials, IEEE 14(2), pp. 607–640, 2012.

    Google Scholar 

  3. S. Grasic and A. Lindgren, “An analysis of evaluation practices for dtn routing protocols,” in Proceedings of the seventh ACM international workshop on Challenged networks, pp. 57–64, ACM, 2012.

    Google Scholar 

  4. S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, vol. 34, ACM, 2004.

    Google Scholar 

  5. S. Kapadia, B. Krishnamachari, and L. Zhang, “Data delivery in delay tolerant networks: A survey,” Mobile Ad-hoc Networks: Protocol Design, pp. 565–578, 2011.

    Google Scholar 

  6. E. P. Jones and P. A. Ward, “Routing strategies for delay-tolerant networks,” Submitted to ACM Computer Communication Review (CCR), 2006.

    Google Scholar 

  7. Y. Cao and Z. Sun, “Routing in delay/disruption tolerant networks: A taxonomy, survey and challenges,” Communications Surveys & Tutorials, IEEE 15(2), pp. 654–677, 2013.

    Google Scholar 

  8. E. P. Jones, L. Li, J. K. Schmidtke, and P. A. Ward, “Practical routing in delay-tolerant networks,” Mobile Computing, IEEE Transactions on 6(8), pp. 943–959, 2007.

    Google Scholar 

  9. A. Vahdat, D. Becker, et al., “Epidemic routing for partially connected ad hoc networks,” tech. rep., Technical Report CS-200006, Duke University, 2000.

    Google Scholar 

  10. X. Lu and P. Hui, “An energy-efficient n-epidemic routing protocol for delay tolerant networks,” in Networking, Architecture and Storage (NAS), 2010 IEEE Fifth International Conference on, pp. 341–347, IEEE, 2010.

    Google Scholar 

  11. F. De Rango and S. Amelio, “Performance evaluation of scalable and energy efficient dynamic n-epidemic routing in delay tolerant networks,” in Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2013 International Symposium on, pp. 167–173, IEEE, 2013.

    Google Scholar 

  12. IEEE-SA, “Ieee std 802.11-2012,” 2012.

    Google Scholar 

  13. L. G. Roberts, “Aloha packet system with and without slots and capture,” ACM SIGCOMM Computer Communication Review 5(2), pp. 28–42, 1975.

    Google Scholar 

  14. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, “Epidemic algorithms for replicated database maintenance,” in Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pp. 1–12, ACM, 1987.

    Google Scholar 

  15. i. Cisco Systems, “Capacity, coverage, and deployment considerations for ieee 802.11g,” 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Teerapong Choksatid .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Choksatid, T., Prabhavat, S. (2015). An Epidemic Routing with Low Message Exchange Overhead for Delay Tolerant Networks. In: Selvaraj, H., Zydek, D., Chmaj, G. (eds) Progress in Systems Engineering. Advances in Intelligent Systems and Computing, vol 366. Springer, Cham. https://doi.org/10.1007/978-3-319-08422-0_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08422-0_63

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08421-3

  • Online ISBN: 978-3-319-08422-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics