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

Qiaolin Ouyang, Neng Ye*, Jihong Yu, Di Zhou, Guan Gui

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

摘要

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.

源语言英语
页(从-至)19943-19948
页数6
期刊IEEE Transactions on Vehicular Technology
73
12
DOI
出版状态已出版 - 2024

指纹

探究 'Potential-Minimized Path First: A Novel Load-Balancing Routing Scheme for Mega Constellation Networks' 的科研主题。它们共同构成独一无二的指纹。

引用此