Performance evaluation of adaptive and static routing algorithms and contention resolution techniques in LEO satellite constellations

Abstract

This paper evaluates static, adaptive, and semiadaptive routing algorithms and packet contention resolution techniques in a low earth orbit (LEO) satellite constellation in terms of throughput and fairness for both uniform and bursty traffic models. In order to make such an evaluation, It is crucial to find out how throughput and packet drop ratio is affected by various parameters, i.e. implementation of buffers at each satellite, number of transmitters per satellite, instantaneous network traffic load, type of the traffic (bursty vs uniform), and the burst size for non-uniform traffic. Simulations are made to Investigate the effects of these parameters. Moreover, simulation results are plotted to better illustrate these effects on throughput and fairness of packet contention resolutions schemes and routing algorithms. The contention resolution schemes employed during simulations are Shortest Hop Win (SHW), Oldest Packet Win (OPW)and Random Packet Win (RPW). The routing algorithms used are static routing and adaptive routing and semi-adaptive routing developed during the simulations.