Some Analytical Results for Routing in LEO Satellite Networks

The topological dynamics complicates the routing problem of satellite networks. In this paper, we further study the complexity of the routing problem in Low Earth Orbit (LEO) Satellite Networks (LSNs), which includes the packet routing problem, the Minimum Path Stretch Schedule (MIN-PSS), Maximum Path Contraction Schedule (MAX-PCS) and Maximum Constant Path Schedule (MAX-CPS) problems. Moreover, we put forward the local greedy algorithms for the MIN-PSS and MAX-CPS problem.