Routing Algorithm for AD Hoc Networks of LEO Satellites based on OSPF

Abstract

The static routing protocol is difficult to apply in the Low-Earth-Orbit (LEO) satellite network due to the large number of satellites, dense nodes in the same orbit plane and fast satellite motion speed. In order to solve the dynamic change problem of satellite topology, this paper proposes a routing algorithm for AD hoc networks of LEO satellites based on OSPF. On the basis of periodicity and predictability of satellite topology, network connectivity scenarios are established and routing table information is determined. For routing node loss, we dynamically compare the received predictive link state notification and LSDB to correct routing information. At the same time, we also design the route reconstruction mode to complete the reliable transmission of information. STK and NS3 are used for simulation verification, and the results show that: compared with OSPF, our algorithm can reduce the route convergence time by 94.22%, reduce the end-to-end delay by 56.17%, and reduce the packet loss rate by 64%.