Return
Distributed Routing Optimization Algorithm for FANET Based on Multiagent Reinforcement Learning
DOI:10.1109/JSEN.2024.3415127.png)
Abstract
En 中文
Recent advancements in protocol design and optimization for flying ad hoc networks (FANETs) have shown significant progress. However, the existing centralized optimization control algorithms pose conflicts with the distributed nature of these systems. To address this challenge, this article proposes a novel distributed routing optimization algorithm based on multiagent reinforcement learning (MARL), integrated with an adaptive multimode routing framework incorporating multiprotocol cooperation mechanisms. The algorithm adopts the decentralized execution multiagent deep deterministic policy gradient (DE-MADDPG) algorithm framework, enabling individual unmanned aerial vehicles (UAVs) to directly adjust the protocols and protocol parameters of the current node based solely on local network information. This optimization enhances network structure and overall performance without considering the transmission delay of control signals. The ns3-gym simulation platform is employed for performance evaluation, comparing the proposed algorithm with deep Q-network (DQN), multiagent deep deterministic policy gradient (MADDPG), and other algorithms. The experimental results demonstrate that, compared to the routing algorithm optimized based on DQN, the proposed algorithm exhibits the best overall performance, with a 26.31% reduction in energy consumption and a 19.69% decrease in end-to-end delay.
Keywords:
Routing
Routing protocols
Optimization
Autonomous aerial vehicles
Reinforcement learning
Sensors
Energy consumption
Multiagent deep deterministic policy gradient (MADDPG)
multiagent reinforcement learning (MARL)
network efficiency
unmanned aerial vehicles (UAVs)
Journal
IF:
4.5
Papers:
2.1W
Citations:
7.3W

