Aug 2026· Journal of Computer Science· 0 citations· 36 references
TL;DR
Simulation results validate the holistic integration with federated multi-agent learning, with emphasis on contention awareness and energy balancing is essential for scalable and efficient routing in next-generation dense FANETs.
Abstract
: In dense multi-drone FANET environments, routing efficiency is often reduced due to constant competition for a wireless channel, frequent changes in network topology, and uneven energy consumption between UAV nodes. These factors lead to a decrease in the packet delivery ratio, an increase in delays on the busiest or most unstable routes, and a reduction in the total network lifespan. Although many existing routing methods utilize mobility forecasting or reinforcement learning, most are based on independent decision-making by individual agents. As a result, such approaches may create a significant service load and insufficiently account for competition for the communication channel, as well as the fair distribution of energy consumption between network nodes. To overcome these integrated challenges, this paper proposes FL-CARE, a Federated Learning-based Contention-Aware and Energy-balanced Routing protocol. In FL-CARE, each UAV acts as a learning agent using a multidimensional state (predicted link stability, channel contention, queue occupancy, residual energy) and a tail-latency-sensitive reward function. A lightweight federated learning mechanism enables collaborative, swarm-level intelligence with bounded communication overhead. Extensive MATLAB simulations demonstrate that FL-CARE outperforms state-of-the-art protocols MP-QGRD and RL-MPEAOLSR, improving PDR by 12-18%, reducing average delay by 20 – 25% and tail latency (p99) by up to 30%. Additionally, FL-CARE yields a 15-22% energy consumption per bit delivered, and control overhead reduction of 35-45%, and advances network lifetime by approx. 25% in dense network deployments. The proposed framework maintains low computational and communication overhead through lightweight local learning and compact federated model updates, while adaptive aggregation intervals facilitate efficient collaborative learning and scalable operation under varying network conditions. These simulation results validate the holistic integration with federated multi-agent learning, with emphasis on contention awareness and energy balancing is essential for scalable and efficient routing in next-generation dense FANETs.
Deep Q-learning with a rapidly converging local search method based on permutation-equivariant neural networks for unseen environments in the given network scenarios is incorporated to ensure faster convergence and a minimal memory footprint.
M. Lakshmi, Arram. Mahesh Babu· Journal of Circuits, Systems...· 0 citations
The paper introduces RML-ZEREM to solve existing limitations, which functions as a Reinforcement Learning (RL) based Zone-Based Leader-Aware Energy-Efficient Routing Protocol for MANETs, which serves next-generation MANET applications.
Rani Sahu, Babita Rathore· Journal of Intelligent Compu...· 0 citations
A new Enhanced Intelligent-based Energy and Mobility, and Obstacle-aware Clustering (EIEMOC) protocol to control the network congestion while meeting End-to-End Delay (E2D) constraints in delay-constrained FANET applications.
J. Rajeswari, R. Kousalya· International Journal of Ele...· 0 citations
Simulation results obtained demonstrate that Q-WeCBR outperforms CBR, DSDV, and GPSR in terms of packet delivery ratio and throughput, confirming the effectiveness of clustering combined with learning-based routing for dynamic vehicular networks.
Ahlam Boussadia· International journal of inf...· 0 citations
This paper proposes ASGRR (Adaptive Swarm-Guided Graph Policy Routing), a novel hybrid routing framework that integrates Message Passing Neural Networks, Policy Gradient Reinforcement Learning (PGRL), and the Artificial Bee Colony algorithm in a self-adaptive hybrid form.
Mehdi Hosseinzadeh, Parisa Khoshvaght, Amir Masoud Rahmani et al.· Cluster Computing· 0 citations
Future sixth-generation (6G)-oriented networks require programmable control that can adapt routing to latency and congestion without unsafe online exploration. This study evaluates offline multi-agent deep deterministic policy gradient (MADDPG) with behavior-adjusted training rewards for latency-aware path control in software-defined networking (SDN). Each traffic pair is modeled as an agent selecting one of three retained candidate paths, while centralized critics learn coordinated decisions from topology-specific Ryu–Mininet transition datasets. Nine policies are compared using ten paired seeds on fat-tree, mesh-grid, and WAN-corridors topologies under a deployed utilization–latency weighting of 0.60/0.40, together with flow-completion, latency, congestion, architectural-comparison, sensitivity, robustness, statistical, and controller-overhead analyses. The utilization-aware path heuristic achieves the strongest overall reward ranking. MADDPG is the strongest learned policy on fat-tree, is not significantly outperformed by any evaluated policy on mesh-grid, and remains statistically tied with completion-matched policies on WAN-corridors. Behavior adjustment is topology-dependent rather than uniformly beneficial. The exported policy requires approximately 52μs per joint decision, whereas complete control-loop timing is dominated by network-statistics polling. These results support offline multi-agent SDN control as a competitive, low-overhead option when interpreted jointly with topology structure, flow completion, and strong heuristic baselines.
A. Kyzyrkanov, Y. Nurakhov, Zhenis Otarbay et al.· Technologies· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.