An Entropic Value-at-Risk-Inspired Load-Balancing Routing Algorithm for LEO Satellite Networks

In sixth-generation (6G) space–air–ground integrated networks, risk-neutral reinforcement-learning-based routing methods for low Earth orbit (LEO) satellite networks remain susceptible to severe tail latency. To address this issue, this paper proposes a novel Entropic Value-at-Risk (EVaR)-inspired routing algorithm with risk regularization for low-return actions. The routing process in an LEO satellite network is formulated as an event-driven partially observable Markov decision process. Within a multi-agent soft actor–critic framework, an EVaR-inspired state-level risk proxy for low-return actions is introduced and incorporated into the actor loss as a risk regularizer. This design enables the joint optimization of expected routing returns and the mitigation of low-return action risk. Simulation results obtained in a simplified LEO network using Iridium orbital parameters demonstrate that, compared with the multi-agent soft actor–critic algorithm, the proposed algorithm reduces the average end-to-end delay and the 99th-percentile end-to-end delay by 19.2% and 32.9%, respectively. It also reduces the average and maximum queueing delays by 79.4% and 57.0%, respectively, with approximately no packet loss observed during the simulations. These results demonstrate that the proposed algorithm enables efficient and reliable routing in LEO satellite networks under high-load conditions.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2026-10-19
DOI
https://doi.org/10.3390/s26206627
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Entropic Value-at-Risk-Inspired Load-Balancing Routing Algorithm for LEO Satellite Networks

Shuqi Wang, Huizi Guo, Weijie Deng
Sensors
Satellite Communication Systems
article

An Entropic Value-at-Risk-Inspired Load-Balancing Routing Algorithm for LEO Satellite Networks

Shuqi Wang, Huizi Guo, Weijie Deng
article en

Abstract

In sixth-generation (6G) space–air–ground integrated networks, risk-neutral reinforcement-learning-based routing methods for low Earth orbit (LEO) satellite networks remain susceptible to severe tail latency. To address this issue, this paper proposes a novel Entropic Value-at-Risk (EVaR)-inspired routing algorithm with risk regularization for low-return actions. The routing process in an LEO satellite network is formulated as an event-driven partially observable Markov decision process. Within a multi-agent soft actor–critic framework, an EVaR-inspired state-level risk proxy for low-return actions is introduced and incorporated into the actor loss as a risk regularizer. This design enables the joint optimization of expected routing returns and the mitigation of low-return action risk. Simulation results obtained in a simplified LEO network using Iridium orbital parameters demonstrate that, compared with the multi-agent soft actor–critic algorithm, the proposed algorithm reduces the average end-to-end delay and the 99th-percentile end-to-end delay by 19.2% and 32.9%, respectively. It also reduces the average and maximum queueing delays by 79.4% and 57.0%, respectively, with approximately no packet loss observed during the simulations. These results demonstrate that the proposed algorithm enables efficient and reliable routing in LEO satellite networks under high-load conditions.

SensorsVol. 26(20)
Xi'an University of Science and Technology (CN)
Openalex Percentile: Top 18%
Satellite Communication Systems
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.