TY - JOUR
T1 - An End-To-End Rate Control Protocol for Intermittently Connected Networks
AU - Ko, Euiyul
AU - Kim, Dohyung
AU - Park, Hanjin
AU - Yeom, Ikjun
AU - Seo, Euiseong
N1 - Publisher Copyright:
© 2015, Springer Science+Business Media New York.
PY - 2015/9/14
Y1 - 2015/9/14
N2 - 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.
AB - 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.
KW - AIMD
KW - Delay tolerant network
KW - Intermittently connected network
KW - Rate control protocol
UR - https://www.scopus.com/pages/publications/84938971223
U2 - 10.1007/s11277-015-2608-7
DO - 10.1007/s11277-015-2608-7
M3 - Article
AN - SCOPUS:84938971223
SN - 0929-6212
VL - 84
SP - 287
EP - 303
JO - Wireless Personal Communications
JF - Wireless Personal Communications
IS - 1
ER -