Skip to main content
Log in

An End-To-End Rate Control Protocol for Intermittently Connected Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this study, we propose a rate control algorithm for intermittently connected networks (ICNs), a type of delay/disruption-tolerant network. The different characteristics of ICNs compared with traditional TCP/IP networks lead to problems that do not occur in legacy networks, such as network partitioning, long and varying delays, high loss probability, and asymmetric data transmission rates. To overcome these issues, much recent research has been carried out. However, while the results have helped achieve smooth communication between nodes, there are still certain shortcomings. For example, if many messages are input by the nodes in a network, these schemes do not work well. To resolve this problem, we propose a novel sending rate control algorithm in an additive increase/multiplicative decrease manner. To detect network congestion, we measure the receiving rate, one-way delay, and average number of copies. When the measured receiving rate increases, the congestion window (cwnd) also increases; otherwise, cwnd decreases. The simulations show that the proposed algorithm can adjust the sending rate of nodes to avoid network congestion and provide a fair share of the network for the nodes.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. http://www.dtnrg.org.

References

  1. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In WDTN ’05: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (pp. 252–259). New York, NY: ACM.

  2. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In SIGCOMM ’03: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (pp. 27–34). New York, NY: ACM.

  3. Niyato, D., & Wang, P. (2009). Optimization of the mobile router and traffic sources in vehicular delay-tolerant network. IEEE Transactions on Vehicular Technology, 58(9), 5095–5104.

    Article  Google Scholar 

  4. Floyd, S., & Fall, K. (1999). Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Transactions on Network, 7(4), 458–472.

    Article  Google Scholar 

  5. Seligman, M., Fall, K., & Mundur, P. (2006). Alternative custodians for congestion control in delay tolerant networks. In CHANTS ’06: Proceedings of the 2006 SIGCOMM workshop on challenged networks (pp. 229–236). New York, NY: ACM.

  6. Burleigh, S., Jennings, E., & Schoolcraft, J. (2006). Autonomous congestion control in delay-tolerant networks. In Proceedings of the AIAA 9th international conference on space operations (SpaceOps).

  7. Seligman, M., Fall, K., & Mundur, P. (2007). Storage routing for dtn congestion control: Research articles. Wireless Communications and Mobile Computing, 7(10), 1183–1196.

    Article  Google Scholar 

  8. Li, Y., Zhao, L., Liu, Z., & Liu, Q. (2009). N-drop: congestion control strategy under epidemic routing in dtn. In IWCMC ’09: Proceedings of the 2009 international conference on wireless communications and mobile computing (pp. 457–460). New York, NY: ACM.

  9. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks.

  10. Thompson, N., Nelson, S., Bakht, M., Abdelzaher, T., & Kravets, R. H. (2010, March). Retiring replicants: Congestion control for intermittently connected networks. In Proceedings IEEE INFOCOM. [Online]. http://www.igh.com.tr/tr/index.php?c=page&section=gozhastaliklari

  11. Li, Y., Jiang, Y., Jin, D., Su, L., Zeng, L., & Wu, D. (2010). Energy-efficient optimal opportunistic forwarding for delay-tolerant networks. IEEE Transactions on Vehicular Technology, 59(9), 4500–4512.

    Article  Google Scholar 

  12. Zhu, H., Lin, X., Lu, R., Fan, Y., & Shen, X. (2009). Smart: A secure multilayer credit-based incentive scheme for delay-tolerant networks. IEEE Transactions on Vehicular Technology, 58(8), 4628–4639.

    Article  Google Scholar 

  13. Clark, D. D., & Fang, W. (1998, August). Explicit allocation of best-effort packet delivery service. IEEE/ACM Transactions on Network, 6, 362–373. [Online]. doi:10.1109/90.720870.

  14. Ko, E., Park, H., & Yeom, I. (2010). A new event-driven network simulator for delay-tolerant networks (DTNs). In Proceedings of the 3rd international ICST conference on simulation tools and techniques, ser. SIMUTools ’10. ICST, Brussels, Belgium, Belgium: ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (pp. 59:1–59:6). [Online]. doi:10.4108/ICST.SIMUTOOLS2010.8650.

Download references

Acknowledgments

This research was supported by the Next-Generation Information Computing Development Program (2012-0006423) and Basic Research Promotion Fund (2008-313-D00883) through the National Research Foundation of Korea (NRF) funded by the Korean government.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Euiseong Seo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ko, E., Kim, D., Park, H. et al. An End-To-End Rate Control Protocol for Intermittently Connected Networks. Wireless Pers Commun 84, 287–303 (2015). https://doi.org/10.1007/s11277-015-2608-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2608-7

Keywords

Navigation