小型卫星网络中受基因启发的接触计划设计

Cuiqin Dai, Huang Tang
{"title":"小型卫星网络中受基因启发的接触计划设计","authors":"Cuiqin Dai, Huang Tang","doi":"10.1109/CITS.2017.8035308","DOIUrl":null,"url":null,"abstract":"Aiming at scheduling links efficiently, Contact Plan Design (CPD) has been playing an increasingly prominent role in the resource-limited Small Satellite Networks (SSNs). In CPD, the transfer stages of bundles should be coordinated arrange. Neglecting such feature in the bundle transmission undoubtedly deteriorate the network performance. For this issue, an algorithm named Genetically Inspired Contact Plan (GICP) is proposed by jointly considering the features of Contact Plans (CPs) and Genetic Approaches (GAs). The first main step in the proposed scheme is encoding, which represents CPs as strings of binary values that easy to process. Then, the strings are repaired and evaluated that satisfy the requirements. Finally, a genetically inspired operation that simulate the biological competition is introduced to obtain CPs with lower delivery time. The simulation results show that GICP can outperform the traditional GAs in terms of delivery time and target fitness.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Genetically Inspired Contact Plan Design in Small Satellite Networks\",\"authors\":\"Cuiqin Dai, Huang Tang\",\"doi\":\"10.1109/CITS.2017.8035308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at scheduling links efficiently, Contact Plan Design (CPD) has been playing an increasingly prominent role in the resource-limited Small Satellite Networks (SSNs). In CPD, the transfer stages of bundles should be coordinated arrange. Neglecting such feature in the bundle transmission undoubtedly deteriorate the network performance. For this issue, an algorithm named Genetically Inspired Contact Plan (GICP) is proposed by jointly considering the features of Contact Plans (CPs) and Genetic Approaches (GAs). The first main step in the proposed scheme is encoding, which represents CPs as strings of binary values that easy to process. Then, the strings are repaired and evaluated that satisfy the requirements. Finally, a genetically inspired operation that simulate the biological competition is introduced to obtain CPs with lower delivery time. The simulation results show that GICP can outperform the traditional GAs in terms of delivery time and target fitness.\",\"PeriodicalId\":314150,\"journal\":{\"name\":\"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"volume\":\"153 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CITS.2017.8035308\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2017.8035308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

以高效调度链路为目标的接触计划设计(CPD)在资源有限的小卫星网络中发挥着越来越重要的作用。在CPD中,捆包的转移阶段应协调安排。在包传输中忽略这一特性无疑会降低网络的性能。针对这一问题,综合考虑接触计划(CPs)和遗传方法(GAs)的特点,提出了遗传启发接触计划(GICP)算法。该方案的第一个主要步骤是编码,它将CPs表示为易于处理的二进制值字符串。然后对满足要求的字符串进行修复和求值。最后,引入了一种模拟生物竞争的遗传启发操作,以获得更短的交付时间的CPs。仿真结果表明,GICP算法在交付时间和目标适应度方面优于传统的遗传算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Genetically Inspired Contact Plan Design in Small Satellite Networks
Aiming at scheduling links efficiently, Contact Plan Design (CPD) has been playing an increasingly prominent role in the resource-limited Small Satellite Networks (SSNs). In CPD, the transfer stages of bundles should be coordinated arrange. Neglecting such feature in the bundle transmission undoubtedly deteriorate the network performance. For this issue, an algorithm named Genetically Inspired Contact Plan (GICP) is proposed by jointly considering the features of Contact Plans (CPs) and Genetic Approaches (GAs). The first main step in the proposed scheme is encoding, which represents CPs as strings of binary values that easy to process. Then, the strings are repaired and evaluated that satisfy the requirements. Finally, a genetically inspired operation that simulate the biological competition is introduced to obtain CPs with lower delivery time. The simulation results show that GICP can outperform the traditional GAs in terms of delivery time and target fitness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信