Complexity of Routing in Store-and-Forward LEO Satellite Networks

In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks.