Inter cluster routing algorithm for air sea cross domain clustering network based on improved grey wolf optimization algorithm
Traditional clustering routing algorithms do not consider factors such as network hierarchy, node types, and inter node channel types, and are not suitable for air sea cross domain networks. This article is based on the DEEC algorithm for improvement, introducing an improved grey wolf optimization algorithm for routing scheme planning in the inter cluster routing stage of air sea cross domain networks. A cluster routing algorithm based on the improved grey wolf algorithm (CRGA) is proposed for inter cluster routing. The improved strategy of grey wolf optimization algorithm includes differential evolution and survival of the fittest, and the fitness function includes distance factor, remaining energy of the next hop, and balance of node energy. After simulation verification, CRGA has the advantages of longer network lifespan, slower total node energy consumption, better network energy balance, and higher average packet delivery success rate compared to LEACH and DEEC.
Authors
- Yu Han (ORCID: https://orcid.org/0009-0001-8335-2954)
- He Li (ORCID: https://orcid.org/0000-0003-4325-6631)
- Mo Li (ORCID: https://orcid.org/0000-0002-8943-0191)
- Zhigang Shang (ORCID: https://orcid.org/0009-0005-1383-3639)
Institutions
- Harbin Engineering University (CN)
Publication Details
- Published
- 2025-04-11
- DOI
- https://doi.org/10.1109/wccct65447.2025.11027998
- Citations
- 1
- Primary Topic
- Satellite Communication Systems
- Type
- article
- Field-Weighted Citation Impact
- 4.99
Funders
- National Key Research and Development Program of China