TY - GEN
T1 - Load forecasting-based congestion control algorithm for delay-Tolerant networks
AU - Ji, Junwei
AU - Liu, Heng
AU - Wang, Aihua
AU - Hao, Yuanchen
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - Delay-Tolerant Networks (DTN) use 'carrystorage-forward' mechanism to deal with high latency and frequent interruption in the extreme network environment. It requires sufficient storage of nodes. As network load increases, buffer overload and network congestion of some essential nodes have been resistance to DTN development. For the issue of congestion control in DTN, this article proposes a congestion control algorithm based on load forecasting. As traffic conditions are complex and non-linear, we selected back propagation neural networks to predict the future load. First, a forecast function is trained based on the historical buffer information. And then forecast function is used to predict short-Term future buffer occupancy. Finally, the prediction result is broadcasted to surrounding nodes. When neighbor nodes have data to transmit, buffer occupancy forecast serves as reference to avoid that packets are transmitted to congestion nodes, thus reducing traffic input when node's buffer is almost full. Simulation results indicate that this algorithm performs well according to network indicators such as buffer occupancy and delivery ratio, which means it can effectively alleviate network congestion and improve network efficiency.
AB - Delay-Tolerant Networks (DTN) use 'carrystorage-forward' mechanism to deal with high latency and frequent interruption in the extreme network environment. It requires sufficient storage of nodes. As network load increases, buffer overload and network congestion of some essential nodes have been resistance to DTN development. For the issue of congestion control in DTN, this article proposes a congestion control algorithm based on load forecasting. As traffic conditions are complex and non-linear, we selected back propagation neural networks to predict the future load. First, a forecast function is trained based on the historical buffer information. And then forecast function is used to predict short-Term future buffer occupancy. Finally, the prediction result is broadcasted to surrounding nodes. When neighbor nodes have data to transmit, buffer occupancy forecast serves as reference to avoid that packets are transmitted to congestion nodes, thus reducing traffic input when node's buffer is almost full. Simulation results indicate that this algorithm performs well according to network indicators such as buffer occupancy and delivery ratio, which means it can effectively alleviate network congestion and improve network efficiency.
KW - Congestion control
KW - Delay-Tolerant networks
KW - Load forecasting
KW - Machine learning
UR - http://www.scopus.com/inward/record.url?scp=85105384836&partnerID=8YFLogxK
U2 - 10.1109/SAGC50777.2020.00023
DO - 10.1109/SAGC50777.2020.00023
M3 - Conference contribution
AN - SCOPUS:85105384836
T3 - Proceedings - 2020 International Conference on Space-Air-Ground Computing, SAGC 2020
SP - 62
EP - 66
BT - Proceedings - 2020 International Conference on Space-Air-Ground Computing, SAGC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1st International Conference on Space-Air-Ground Computing, SAGC 2020
Y2 - 4 December 2020 through 6 December 2020
ER -