Routing in LEO satellite networks: An implementation

Abstract

In this study, we investigated the routing problem in low earth orbit satellite communication systems with intersatellite links and using a greedy optimization, we tested the performance of a routing algorithm proposed in the literature. The routing problem is divided into two separate problems: UDL and ISL routing. For the ISL routing, the problem has been defined as a minimization problem with start and end satellites known, and minimizing the path handover to connect these end satellites. We used greedy optimization to solve the problem. In order to use the algorithm on traffic requiring guaranteed QoS, we added an end-to-end delay constraint into the optimization process.