基于优化的近地轨道卫星系统路由

D. Yiltas, A. Halim Zaim
{"title":"基于优化的近地轨道卫星系统路由","authors":"D. Yiltas, A. Halim Zaim","doi":"10.1109/GLOCOMW.2008.ECP.102","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Routing in Low Earth Orbit Satellite Systems Based on the Optimization\",\"authors\":\"D. Yiltas, A. Halim Zaim\",\"doi\":\"10.1109/GLOCOMW.2008.ECP.102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":410930,\"journal\":{\"name\":\"2008 IEEE Globecom Workshops\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Globecom Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2008.ECP.102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2008.ECP.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

由于卫星在当今通信领域变得越来越普遍,卫星网络的进程和改进变得越来越重要。由于卫星的运动动态变化,卫星网络的两个端节点之间的路由操作是卫星网络的挑战之一。在这些移动过程中,一颗卫星可以向相邻的一颗卫星发出覆盖区域服务指令。另外,当呼叫密度超过通信链路的容量或信号相互干扰时,一些呼叫可能会被阻塞。所有这些情况都使路由操作变得相当复杂。在本研究中,我们设计了一种新的低地球轨道(LEO)卫星系统路由算法。我们使用包含不同数量节点的动态卫星拓扑。在优化步骤中应用遗传算法。我们引入了一个新的目标函数,包括延迟和老化因素作为路径的特征属性。最后,对路径进行比较,选出适应度值最佳的最优路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing in Low Earth Orbit Satellite Systems Based on the Optimization
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信