Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks

For mega-constellation networks (MCNs), balancing network congestion and signaling overhead under high overloading is a critical challenge. This letter presents potential minimized path first (PMPF), a distributed potential-field-based routing policy where congestion notifications are selectively sent depending on their impact on network performance. The potential field effectively estimates the shortest path delay using ephemeris information and mimics the delay increase due to congestion with a concise potential model. With each satellite optimizing its routing decision based on potential minimization, signaling overhead is reduced by prioritizing the congestion notifications that significantly impact the potential. Also, routing stability is improved by updating the routing table only when it would significantly improve network performance. Simulation results show PMPF's potential to outperform a global state routing algorithm by up to 43% with less than 8% signaling messages, demonstrating its superior performance in joint scheduling among links.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2024-08-26
DOI
https://doi.org/10.1109/tvt.2024.3449804
Citations
3
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
3.90

Funders

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

Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks

Qiaolin Ouyang, Neng Ye, Guan Gui, Di Zhou et al.
3 citations
IEEE Transactions on Vehicular Technology
Satellite Communication Systems
3.90
article

Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks

Qiaolin Ouyang, Neng Ye, Guan Gui, Di Zhou, Jihong Yu
article en
3 citations

Abstract

For mega-constellation networks (MCNs), balancing network congestion and signaling overhead under high overloading is a critical challenge. This letter presents potential minimized path first (PMPF), a distributed potential-field-based routing policy where congestion notifications are selectively sent depending on their impact on network performance. The potential field effectively estimates the shortest path delay using ephemeris information and mimics the delay increase due to congestion with a concise potential model. With each satellite optimizing its routing decision based on potential minimization, signaling overhead is reduced by prioritizing the congestion notifications that significantly impact the potential. Also, routing stability is improved by updating the routing table only when it would significantly improve network performance. Simulation results show PMPF's potential to outperform a global state routing algorithm by up to 43% with less than 8% signaling messages, demonstrating its superior performance in joint scheduling among links.

IEEE Transactions on Vehicular TechnologyVol. 73(12)
Beijing Institute of Technology (CN), Xidian University (CN), Nanjing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 6%
Satellite Communication Systems
3.90
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.

Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks — Qiaolin Ouyang, Neng Ye, et al. · IEEE Transactions on Vehicular Technology (2024) | TGRS Research Map | TGRS