Space-to-Ground Optical Communication Downlink Scheduling Under Uncertainty of Link Availability

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Pei Lyu;Kanglian Zhao;Shihao Wang;Hangsheng Zhao
{"title":"Space-to-Ground Optical Communication Downlink Scheduling Under Uncertainty of Link Availability","authors":"Pei Lyu;Kanglian Zhao;Shihao Wang;Hangsheng Zhao","doi":"10.1109/LCOMM.2025.3555945","DOIUrl":null,"url":null,"abstract":"Space-to-ground optical communication (STGOC) utilizes laser beams to establish bidirectional links between satellites and ground stations (GSs), which are sensitive to cloud blockage. In practical STGOC downlink scheduling, the uncertainty of link availability caused by cloud motion and dissipation is inevitable. We are the first to address STGOC downlink scheduling under the uncertainty of link availability, where the objective function aims to maximize the amount of data downloaded from the satellites. We provide a formulation of the scheduling problem based on Scenario Generation Approximating (SGA) while preserving the formulation linearity. A Greedy Heuristic-based algorithm is designed to solve the problem. Simulation results indicate that considering uncertainty can enhance data throughput, with the average optimality gap being 0.61%, while the running time is reduced compared to Gurobi and Kuhn-Munkres-based methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1136-1140"},"PeriodicalIF":3.7000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10945431/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Space-to-ground optical communication (STGOC) utilizes laser beams to establish bidirectional links between satellites and ground stations (GSs), which are sensitive to cloud blockage. In practical STGOC downlink scheduling, the uncertainty of link availability caused by cloud motion and dissipation is inevitable. We are the first to address STGOC downlink scheduling under the uncertainty of link availability, where the objective function aims to maximize the amount of data downloaded from the satellites. We provide a formulation of the scheduling problem based on Scenario Generation Approximating (SGA) while preserving the formulation linearity. A Greedy Heuristic-based algorithm is designed to solve the problem. Simulation results indicate that considering uncertainty can enhance data throughput, with the average optimality gap being 0.61%, while the running time is reduced compared to Gurobi and Kuhn-Munkres-based methods.
链路可用性不确定条件下的空地光通信下行调度
空对地光通信(STGOC)利用激光束在卫星和地面站(GSs)之间建立双向链接,后者对云阻塞很敏感。在实际的STGOC下行调度中,由于云的运动和消散导致的链路可用性的不确定性是不可避免的。我们首次研究了链路可用性不确定情况下的STGOC下行调度问题,其目标函数是最大限度地从卫星下载数据量。在保持公式线性的前提下,提出了基于场景生成近似(SGA)的调度问题的公式。设计了一种基于贪婪启发式的算法来解决这一问题。仿真结果表明,与基于Gurobi和kuhn - munkres的方法相比,考虑不确定性可以提高数据吞吐量,平均最优性差距为0.61%,同时减少了运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信