A dynamic routing algorithm in LEO satellite systems estimating call blocking probabilities

Abstract

Routing algorithms constitute an important area for the packet transmission in satellite networks. There are many studies about static routing algorithms in which the satellite systems are thought to be fixed on the sky. Thus the routing operation is made over a fixed topology in these studies. However in real world, the satellites move continuously in their orbits along the communications. So the dynamic routing is the most appropriate routing type for real applications. In this study, we investigated several routing algorithms and designed a new dynamic routing algorithm. Our path selections are based on the genetic algorithms through a new fitness function. Also we computed the Call Blocking Probabilities (CBPs) of all links on the paths formed the route of a packet transmission.