AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (4.4 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Optimizing Routing Algorithms for Next-Generation Networks: A Resilience-Driven Framework for Space-Air-Ground Integrated Networks

Peiying Zhang1,2Yihong Yu1,2Jia Luo3,4( )Nguyen Gia Ba5Lizhuang Tan6,7Lei Shi8
Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, 266580, China
Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software, Qingdao, 266580, China
College of Economics and Management, Beijing University of Technology, Beijing, 100124, China
Chongqing Research Institute, Beijing University of Technology, Chongqing, 401121, China
Faculty of Information Technology, Hung Yen University of Technology and Education, Hung Yen, 17000, Vietnam
Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250014, China
Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing, Shandong Fundamental Research Center for Computer Science, Jinan, 250014, China
State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing, 100024, China
Show Author Information

Abstract

Next-Generation Networks (NGNs) demand high resilience, dynamic adaptability, and efficient resource utilization to enable ubiquitous connectivity. In this context, the Space-Air-Ground Integrated Network (SAGIN) architecture is uniquely positioned to meet these requirements. However, conventional NGN routing algorithms often fail to account for SAGIN’s intrinsic characteristics, such as its heterogeneous structure, dynamic topology, and constrained resources, leading to suboptimal performance under disruptions such as node failures or cyberattacks. To meet these demands for SAGIN, this study proposes a resilience-oriented routing optimization framework featuring dynamic weighting and multi-objective evaluation. Methodologically, we define three core routing performance metrics, quantified through a four-dimensional model, encompassing robustness Rd, resilience Rr, adaptability Ra, and resource utilization efficiency Ru, and integrate them into a comprehensive evaluation metric. In simulated SAGIN environments, the proposed Multi-Indicator Weighted Resilience Evaluation Algorithm (MIW-REA) demonstrates significant improvements in resilience enhancement, recovery acceleration, and resource optimization. It maintains 82.3% service availability even with a 30% node failure rate, reduces Distributed Denial of Service (DDoS) attack recovery time by 43%, decreases bandwidth waste by 23.4%, and lowers energy consumption by 18.9%. By addressing challenges unique to the SAGIN network, this research provides a flexible real-time solution for NGN routing optimization that balances resilience, efficiency, and adaptability, advancing the field.

References

【1】
【1】
 
 
Computers, Materials & Continua
Article number: 50

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Zhang P, Yu Y, Luo J, et al. Optimizing Routing Algorithms for Next-Generation Networks: A Resilience-Driven Framework for Space-Air-Ground Integrated Networks. Computers, Materials & Continua, 2026, 87(2): 50. https://doi.org/10.32604/cmc.2026.076690

4

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 25 November 2025
Accepted: 04 January 2026
Published: 12 March 2026
© The Author 2026.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.