A novel routing algorithm based on dynamic clustering for LEO satellite networks

The performance of satellite networks largely depends on their routing algorithm. Existing routing algorithms for satellite networks usually are not quite adaptive or have the disadvantage of a large consumption in both computation and storage resources. In this paper, we propose a novel routing algorithm based on dynamic clustering for LEO satellite networks. By dynamic forming cluster of the satellite network, the routing algorithm is both adaptive, computational effective and need much less storage space. Simulation results show that our routing algorithm performs better and are more robust when the network topology changes.