Adaptive Variable Length Sliding Window Network Coding for Low Latency Transmission in FANETs via Deep Reinforcement Learning

Future flying ad-hoc networks (FANETs) need to address issues related to delay and channel interference while ensuring high data transmission accuracy. In this letter, we propose a proximal policy optimization (PPO)-based adaptive adjustment algorithm for sliding window-based network coding to mitigate channel contention and signal degradation caused by increased traffic load. We model the adaptive adjustment of the sliding window size as a Markov decision process, considering effective rate, node congestion, and total delay in the reward function. To further improve the algorithm’s performance, we enhance PPO with long short-term memory (LSTM) networks to process time-series data. Experimental results demonstrate that our method reduces delay, improves packet delivery rate and throughput compared with traditional sliding window network coding algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2025-02-20
DOI
https://doi.org/10.1109/lwc.2025.3543921
Citations
1
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Variable Length Sliding Window Network Coding for Low Latency Transmission in FANETs via Deep Reinforcement Learning

Yaqi Ke, Lei Xu, Yuwang Yang, Xiulin Qiu et al.
1 citations
IEEE Wireless Communications Letters
Advanced MIMO Systems Optimization
0.73
article

Adaptive Variable Length Sliding Window Network Coding for Low Latency Transmission in FANETs via Deep Reinforcement Learning

Yaqi Ke, Lei Xu, Yuwang Yang, Xiulin Qiu, Bo Song
article en
1 citations

Abstract

Future flying ad-hoc networks (FANETs) need to address issues related to delay and channel interference while ensuring high data transmission accuracy. In this letter, we propose a proximal policy optimization (PPO)-based adaptive adjustment algorithm for sliding window-based network coding to mitigate channel contention and signal degradation caused by increased traffic load. We model the adaptive adjustment of the sliding window size as a Markov decision process, considering effective rate, node congestion, and total delay in the reward function. To further improve the algorithm’s performance, we enhance PPO with long short-term memory (LSTM) networks to process time-series data. Experimental results demonstrate that our method reduces delay, improves packet delivery rate and throughput compared with traditional sliding window network coding algorithms.

IEEE Wireless Communications LettersVol. 14(5)
Nanjing University of Science and Technology (CN), Jiangsu University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 31%
Advanced MIMO Systems Optimization
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.