An Efficient Backup Routing Based on Potential-Minimized Path First for Mega Constellation Networks

This paper proposes an efficient backup routing scheme based on potential-minimized path first for Low Earth orbit mega-constellation network to solve the service interruption problem caused by satellite node failure, in which the potential-minimized path first strategy adopts the artificial potential field model to consider the network node congestion level and shortest path delay. This backup routing scheme optimizes both the primary and backup paths by weighting and summing the potentials of both paths. This weighting takes into account congestion and possible broken network nodes. It retains the property of distributed routing using potential functions to simplify complexity and signaling interactions. Simulation results show that the proposed backup routing scheme significantly reduces the outage time and data transmission delay, enhancing the reliability and stability compared to existing backup routing schemes such as intelligent backup multi-path ant colony routing algorithm, redundant multi-path routing algorithm and traffic-load-aware multipath routing algorithm.