We investigate several routing algorithms used in low Earth orbit (LEO) satellite systems. In the literature, most of the routing algorithms designed for LEO systems are based on minimizing the delay. Only a few of them have taken minimization of the number of handoffs as the objective function. We also classify the routing algorithms in two main categories: dynamic and static. There are some other papers that compare dynamic and static routing algorithms. Most of the studies, on the other hand, use static routing algorithms due to the periodic and predictable nature of LEO satellite systems. Therefore, we also designed a static routing algorithm based on genetic algorithms. The results show that our method performs better than classical methods, from the point of view of both delay and number of handovers.
A new routing algorithm for LEO satellite systems using genetic algorithms
2005-01-01
727909 byte
Conference paper
Electronic Resource
English
School bus routing using genetic algorithms
SPIE | 1992
|Multi-Satellite Scheduling Using Genetic Algorithms
AIAA | 2004
|Satellite Close-Approach Filtering Using Genetic Algorithms
Online Contents | 2003
|