TY - GEN
T1 - Routing in low earth orbit satellite systems based on the optimization
AU - Yiltas, Derya
AU - Zaim, A. Halim
PY - 2008
Y1 - 2008
N2 - Since the satellites become more common for today's communication area, the process and the improvements in the satellite networks are gaining importance. One of the challenges in satellite networks is the routing operation between two end nodes, because, these networks have dynamic changing satellite movements. During these movements, a satellite can give its coverage area service order to one of its neighboring satellites. Also some calls can be blocked when the call densities exceed the communication link's capacities or the signals interfere with each other. All of these situations make the routing operation quite complicated. In this study, we design a new routing algorithm for Low-earth orbit (LEO) satellite systems. We use dynamic satellite topologies containing different number of nodes. We apply the genetic algorithms during the optimization steps. We introduce a new objective function including the delay and the aging factor as the characteristic properties of the paths. Finally, we compare the paths with each other and select the optimal path having the best fitness value.
AB - Since the satellites become more common for today's communication area, the process and the improvements in the satellite networks are gaining importance. One of the challenges in satellite networks is the routing operation between two end nodes, because, these networks have dynamic changing satellite movements. During these movements, a satellite can give its coverage area service order to one of its neighboring satellites. Also some calls can be blocked when the call densities exceed the communication link's capacities or the signals interfere with each other. All of these situations make the routing operation quite complicated. In this study, we design a new routing algorithm for Low-earth orbit (LEO) satellite systems. We use dynamic satellite topologies containing different number of nodes. We apply the genetic algorithms during the optimization steps. We introduce a new objective function including the delay and the aging factor as the characteristic properties of the paths. Finally, we compare the paths with each other and select the optimal path having the best fitness value.
KW - Communication
KW - Genetic algorithms
KW - Low earth orbit
KW - Routing, satellite systems
UR - http://www.scopus.com/inward/record.url?scp=62949124522&partnerID=8YFLogxK
U2 - 10.1109/GLOCOMW.2008.ECP.102
DO - 10.1109/GLOCOMW.2008.ECP.102
M3 - Conference contribution
AN - SCOPUS:62949124522
SN - 9781424430628
T3 - 2008 IEEE Globecom Workshops, GLOBECOM 2008
BT - 2008 IEEE Globecom Workshops, GLOBECOM 2008
T2 - 2008 IEEE Globecom Workshops, GLOBECOM 2008
Y2 - 30 November 2008 through 4 December 2008
ER -