Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Buffer Scheme Optimization of Epidemic Routing in Delay Tolerant Networks

  • Shen, Jian (Jiangsu Engineering Center of Network Monitoring, Jiangsu Technology & Engineering Center of Meteorological Sensor Network, School of Computer and Software, Nanjing University of Information Science & Technology) ;
  • Moh, Sangman (Department of Computer Engineering, Chosun University) ;
  • Chung, Ilyong (Department of Computer Engineering, Chosun University) ;
  • Sun, Xingming (Jiangsu Engineering Center of Network Monitoring, School of Computer and Software, Nanjing University of Information Science & Technology)
  • Received : 2013.06.13
  • Accepted : 2014.07.24
  • Published : 2014.12.31
⟨ Previous Next ⟩

Abstract

In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.

Keywords

Acknowledgement

Supported by : National Research Foundation of Korea(NRF)

References

  1. K. Fall, "A delay-tolerant network architecture for challenged Internets," in Proc. ACM SIGCOMM, Aug. 2003, pp. 27-34.
  2. A. Krifa, C. Barakat, and T. Spyropoulos, "Optimal buffer management policies for delay tolerant networks," in Proc. IEEE SECON, June 2008, pp. 260-268.
  3. A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," ACM SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, pp. 19-20, July 2003. https://doi.org/10.1145/961268.961272
  4. A. Vahdat and D. Becker, "Epidemic routing for partially-connected ad hoc networks," Technical Report, CS-200006, Duke University, Apr. 2000.
  5. R. Ramanathan et al., "Prioritized epidemic routing for opportunistic networks," in Proc. ACM MobiOpp, June 2007, pp. 62-66.
  6. S. Jain, K. Fall, and R. Patra, "Routing in a delay tolerant network," in Proc. of ACM SIGCOMM, 2004, pp. 145-158.
  7. E. P. C. Jones and P. A. S. Ward, "Routing strategies for delay-tolerant networks," Comput. Commun. Rev., pp. 1-10, 2008.
  8. E. P. C. Jones, L. Li, and P. A. S.Ward, "Practical routing in delay-tolerant networks," in Proc. ACM SIGCOMM WDTN, Sept. 2005, pp. 237-243.
  9. C. Liu and J. Wu, "Scalable routing in delay tolerant networks," in Proc. MobiHoc, Sept. 2007, pp. 51-60.
  10. J. Shen, S. Moh, and I. Chung, "Routing protocols in delay tolerant networks: A comparative survey," in Proc. ITC-CSCC, July 2008, pp. 1577-1580.
  11. J. Shen, S. Moh, and I. Chung, "A priority routing protocol based on location and moving direction in delay tolerant networks," IEICE Trans. Inf. Syst., vol. E93.D, no. 10, pp. 2763-2775, 2010.
  12. T. Abdelkader et al., "A socially-based routing protocol for delay tolerant networks," in Proc. IEEE GLOBECOM, 2010, pp. 1-5.
  13. A. Sidera and S. Toumpis, "DTFR: A geographic routing protocol for wireless delay tolerant networks," in Proc.Med-Hoc-Net, 2011, pp. 33-40.
  14. G. Resta and P. Santi, "A framework for routing performance analysis in delay tolerant networks with application to noncooperative networks," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 1, pp. 2-10, 2012. https://doi.org/10.1109/TPDS.2011.99
  15. J. Wu and Y. Wang, "Social feature-based multi-path routing in delay tolerant networks," in Proc. IEEE INFOCOM, 2012, pp. 1368-1376.
  16. V. Soares, J. Rodrigues, and F. Farahmand, "Performance assessment of a geographic routing protocol for vehicular delay-tolerant networks," in Proc. IEEE WCNC, 2012, pp. 2526-2531.
  17. V. Soares et al., "Performance analysis of routing protocols for vehicular delay-tolerant networks," in Proc. SoftCOM, 2012, pp. 1-5.
  18. J. Chang and C. Chen, "CROP: Community-relevance-based opportunistic routing in delay tolerant networks," in Proc. IEEE WCNC, 2013, pp. 1938-1943.
  19. J. Sheu, C. Lee, and C. Ma, "An efficient transmission protocol based on network coding in delay tolerant networks," in Proc. IMIS, 2013, pp. 399-404.
  20. Y. Zhu et al., "A survey of social-based routing in delay tolerant networks: Positive and negative social effects," IEEE Commun. Surv. & Tut., vol. 15, no. 1, pp. 387-401, 2013. https://doi.org/10.1109/SURV.2012.032612.00004
  21. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multiple-copy case," IEEE/ACM Trans. Netw., pp. 77-90, Feb. 2008.
  22. X. Zhang et al., "Performance modeling of epidemic routing," Comput. Netw.: Internat. J. Comput. Telecommun. Netw., vol. 51, no. 10, pp. 2867-2891, July 2007.
  23. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Performance analysis of mobility-assisted routing," in Proc. ACM/IEEE MobiHoc, 2006, pp. 49-60.
  24. Z. J. Haas and T. Small, "A new networking model for biological applications of ad hoc sensor networks," IEEE/ACM Trans. Netw., vol. 14, no. 1, pp. 27-40, 2006. https://doi.org/10.1109/TNET.2005.863461
  25. R. Groenevelt, G. Koole, and P. Nain, "Message delay in MANET (extended abstract)," in Proc. ACM Sigmetrics, 2005, pp. 412-413.
  26. G. Neglia, G. Reina, and S. Alouf, "Distributed gradient optimization for epidemic routing: A preliminary evaluation," in Proc. WD, 2009, pp. 1-6.
  27. Q. Ayub, S. Rashid, and M. Zahid, "Optimization of epidemic router by new forwarding queue mode TSMF," Internat. J. Comput. Appl., vol. 7, no. 11, pp. 5-8, Oct. 2010.
  28. CMU Monarch Project. The CMU Monarch Project's wireless and mobility extensions to ns. [Online]. Available: http://ftp.monarch.cs.cmu. edu/pub/monarch/ wireless-sim/ns-cmu.ps
  29. R. Durrett, Probability: Theory and Examples, 2nd ed. Duxbury Press, 1995.
  30. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, University of California, Berkeley, 2002.
  31. IEEE Computer Society, "Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications," 1997.