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

详细信息    查看全文

• 作者：Euiyul Ko ; Dohyung Kim ; Hanjin Park ; Ikjun Yeom…
• 关键词：Intermittently connected network ; Delay tolerant network ; Rate control protocol ; AIMD
• 刊名：Wireless Personal Communications
• 出版年：2015
• 出版时间：September 2015
• 年：2015
• 卷：84
• 期：1
• 页码：287-303
• 全文大小：1,224 KB
• 参考文献：1.Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In WDTN 鈥?5: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (pp. 252鈥?59). New York, NY: ACM.
  2.Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In SIGCOMM 鈥?3: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (pp. 27鈥?4). 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鈥?104.View Article
  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鈥?72.View Article
  5.Seligman, M., Fall, K., & Mundur, P. (2006). Alternative custodians for congestion control in delay tolerant networks. In CHANTS 鈥?6: Proceedings of the 2006 SIGCOMM workshop on challenged networks (pp. 229鈥?36). 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鈥?196.View Article
  8.Li, Y., Zhao, L., Liu, Z., & Liu, Q. (2009). N-drop: congestion control strategy under epidemic routing in dtn. In IWCMC 鈥?9: Proceedings of the 2009 international conference on wireless communications and mobile computing (pp. 457鈥?60). 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://鈥媤ww.鈥媔gh.鈥媍om.鈥媡r/鈥媡r/鈥媔ndex.鈥媝hp?鈥媍=鈥媝age&鈥媠ection=鈥媑ozhastaliklari
  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鈥?512.View Article
  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鈥?639.View Article
  13.Clark, D. D., & Fang, W. (1998, August). Explicit allocation of best-effort packet delivery service. IEEE/ACM Transactions on Network, 6, 362鈥?73. [Online]. doi:10.鈥?109/鈥?0.鈥?20870 .
  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 鈥?0. ICST, Brussels, Belgium, Belgium: ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (pp. 59:1鈥?9:6). [Online]. doi:10.鈥?108/鈥婭CST.鈥婼IMUTOOLS2010.鈥?650 .
  
• 作者单位：Euiyul Ko (1)
  Dohyung Kim (2)
  Hanjin Park (1)
  Ikjun Yeom (2)
  Euiseong Seo (2)
  
  1. Department of CS, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
  2. College of ICE, Sungkyunkwan University, Suwon, Republic of Korea
  
• 刊物类别：Engineering
• 刊物主题：Electronic and Computer Engineering
  Signal,Image and Speech Processing
  Processor Architectures
  
• 出版者：Springer Netherlands
• ISSN：1572-834X

文摘

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.