TY - JOUR
T1 - Optimal Energy-Saving Multi-Path Routing for Space-Air-Ground Integrated Networks
AU - He, Lijun
AU - Li, Yutong
AU - Jia, Ziye
AU - Wang, Juncheng
AU - Min, Minghui
AU - Han, Zhu
N1 - This work was supported in part by the National Natural Science Foundation of China under Grant 62201463 and 62301251
Publisher Copyright:
© 2025 IEEE
PY - 2025/12/17
Y1 - 2025/12/17
N2 - Traditional multi-path routing schemes for Space-Air-Ground Integrated Networks (SAGINs) pose the prominent challenge in reducing energy consumption. To address this, we study the energy minimization problem in multi-path routing by jointly optimizing link assignment, storage allocation, power control, and network routing in SAGINs over dynamic topologies. We first propose a Two-scale Time-Expanded Graph (TTEG) model to capture both network topology changes in large-timescale slots and mission data transmission in small-timescale slots. Using this TTEG model, we formulate the studied problem into a Mixed-Integer Non-Linear Program (MINLP) to minimize total energy consumption. We then leverage the inherent structure of the MINLP to divide it into two smaller subproblems. These two subproblems are solved iteratively with information feedback between them, thereby determining an optimal solution to the original problem in a few iteration steps. Simulation results validate the correctness and efficiency of the proposed solution.
AB - Traditional multi-path routing schemes for Space-Air-Ground Integrated Networks (SAGINs) pose the prominent challenge in reducing energy consumption. To address this, we study the energy minimization problem in multi-path routing by jointly optimizing link assignment, storage allocation, power control, and network routing in SAGINs over dynamic topologies. We first propose a Two-scale Time-Expanded Graph (TTEG) model to capture both network topology changes in large-timescale slots and mission data transmission in small-timescale slots. Using this TTEG model, we formulate the studied problem into a Mixed-Integer Non-Linear Program (MINLP) to minimize total energy consumption. We then leverage the inherent structure of the MINLP to divide it into two smaller subproblems. These two subproblems are solved iteratively with information feedback between them, thereby determining an optimal solution to the original problem in a few iteration steps. Simulation results validate the correctness and efficiency of the proposed solution.
UR - https://www.scopus.com/pages/publications/105025716409
U2 - 10.1109/TVT.2025.3645238
DO - 10.1109/TVT.2025.3645238
M3 - Journal article
SN - 0018-9545
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
ER -