A Novel Ant Colony and Sparrow Search Optimization-Based Routing Algorithm for LEO Satellite Networks
To improve the convergence capability of ant colony routing in LEO satellite networks, a novel hybrid ant colony-sparrow search optimization routing algorithm is proposed. The sparrow algorithm is used to identify local optimal solutions in the ACO routing process and guide the algorithm to re-converge. Simulation results show that, compared to the traditional ACO algorithm, the proposed algorithm significantly improves communication delay and reduces communication costs.
Authors
- Weiying Feng (ORCID: https://orcid.org/0000-0001-8478-1171)
- Leijing Yang (ORCID: https://orcid.org/0000-0001-6505-8260)
- Furong Chai (ORCID: https://orcid.org/0000-0001-7017-1081)
- Qinghua Tian (ORCID: https://orcid.org/0000-0002-1169-9078)
- Yongjun Wang (ORCID: https://orcid.org/0000-0002-9671-8847)
- Xiaohu Li (ORCID: https://orcid.org/0000-0003-0888-8756)
- Feng Tian
- Qi Zhang (ORCID: https://orcid.org/0000-0001-7399-9992)
- Yuanfeng Li (ORCID: https://orcid.org/0000-0001-5275-4881)
- Fu Wang (ORCID: https://orcid.org/0000-0002-6653-3155)
- Meng Sun (ORCID: https://orcid.org/0009-0005-8995-6950)
Institutions
- Beijing University of Posts and Telecommunications (CN)
- Beihang University (CN)
Publication Details
- Published
- 2024-11-22
- DOI
- https://doi.org/10.1109/icdsca63855.2024.10859431
- Primary Topic
- Satellite Communication Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- National Key Research and Development Program of China