TY - JOUR
T1 - ADFPA – A deep reinforcement learning-based flow priority allocation scheme for throughput optimization in FANETs
AU - Lau, Wei Jian
AU - Lim, Joanne Mun-Yee
AU - Chong, Chun Yong
AU - Ho, Nee Shen
AU - Ooi, Thomas Wei Min
N1 - Funding Information:
This work was funded by the Collaborative Research In Engineering, Science And Technology Center (CREST), Intel Microelectronics (M) Sdn Bhd and Department of Electrical and Robotics Engineering, School of Engineering, Monash University Malaysia under the grant number, P05C1-18 . The authors would like to thank CREST for their continuous support in this research (Grant no. P05C1-18 ).
Funding Information:
This work is supported by CREST and Intel Technology Malaysia under the grant number P05C1-18 .
Publisher Copyright:
© 2023 Elsevier Inc.
PY - 2023/12
Y1 - 2023/12
N2 - Flying ad hoc networks (FANETs) are easy to deploy and cost-efficient, however they are limited by the static protocols used in 802.11 and CSMA-based networks to support high bandwidth multi-UAV applications. This work proposes an Anticipatory Dynamic Flow Priority Allocation (ADFPA) scheme to optimize the priority levels of outgoing traffic flows for a transmitting node to maximize the total network throughput. Unlike other deep reinforcement learning (DRL)-based schemes in centralized networks, ADFPA is designed to be distributed, multi-agent, and proactive. It uses current and forecasted multi-context information to optimize the priority levels of traffic flows in a decentralized and dynamic FANET. Furthermore, a traffic flow sampling and padding algorithm is proposed so that a trained agent can be redeployed in different environments without retraining to address the practicality issue. Our evaluations show that ADFPA outperforms other state-of-the-art schemes by a maximum of 37% and 59.4% in terms of the network throughput in the single and multi-transmitting nodes environment, respectively, while achieving the best fairness amongst all schemes. These improvements translate to better data transmission capabilities in a conventional FANET, and the proposed scheme can enable the use of a FANET architecture in more demanding applications without switching to centralized solutions.
AB - Flying ad hoc networks (FANETs) are easy to deploy and cost-efficient, however they are limited by the static protocols used in 802.11 and CSMA-based networks to support high bandwidth multi-UAV applications. This work proposes an Anticipatory Dynamic Flow Priority Allocation (ADFPA) scheme to optimize the priority levels of outgoing traffic flows for a transmitting node to maximize the total network throughput. Unlike other deep reinforcement learning (DRL)-based schemes in centralized networks, ADFPA is designed to be distributed, multi-agent, and proactive. It uses current and forecasted multi-context information to optimize the priority levels of traffic flows in a decentralized and dynamic FANET. Furthermore, a traffic flow sampling and padding algorithm is proposed so that a trained agent can be redeployed in different environments without retraining to address the practicality issue. Our evaluations show that ADFPA outperforms other state-of-the-art schemes by a maximum of 37% and 59.4% in terms of the network throughput in the single and multi-transmitting nodes environment, respectively, while achieving the best fairness amongst all schemes. These improvements translate to better data transmission capabilities in a conventional FANET, and the proposed scheme can enable the use of a FANET architecture in more demanding applications without switching to centralized solutions.
KW - Anticipatory Networking
KW - Reinforcement Learning
KW - Unmanned Aerial Vehicle
UR - http://www.scopus.com/inward/record.url?scp=85175147300&partnerID=8YFLogxK
U2 - 10.1016/j.vehcom.2023.100684
DO - 10.1016/j.vehcom.2023.100684
M3 - Article
AN - SCOPUS:85175147300
SN - 2214-2096
VL - 44
JO - Vehicular Communications
JF - Vehicular Communications
M1 - 100684
ER -