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

Derya Yiltas*, A. Halim Zaim

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference on Recent Advances in Space Technologies, RAST 2007
Pages541-545
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event3rd International Conference on Recent Advances in Space Technologies, RAST 2007 - Istanbul, Turkey
Duration: 14 Jun 200716 Jun 2007

Publication series

NameProceedings of the 3rd International Conference on Recent Advances in Space Technologies, RAST 2007

Conference

Conference3rd International Conference on Recent Advances in Space Technologies, RAST 2007
Country/TerritoryTurkey
CityIstanbul
Period14/06/0716/06/07

Fingerprint

Dive into the research topics of 'A dynamic routing algorithm in LEO satellite systems estimating call blocking probabilities'. Together they form a unique fingerprint.

Cite this