Joint Power Allocation and Task Scheduling for Data Offloading in Non-Geostationary Orbit Satellite Networks

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Lijun He;Ziye Jia;Juncheng Wang;Erick Lansard;Zhu Han;Chau Yuen
{"title":"Joint Power Allocation and Task Scheduling for Data Offloading in Non-Geostationary Orbit Satellite Networks","authors":"Lijun He;Ziye Jia;Juncheng Wang;Erick Lansard;Zhu Han;Chau Yuen","doi":"10.1109/TNSM.2025.3561266","DOIUrl":null,"url":null,"abstract":"In Non-Geostationary Orbit Satellite Networks (NGOSNs) with a large number of battery-carrying satellites, proper power allocation and task scheduling are crucial to improving data offloading efficiency. In this work, we jointly optimize power allocation and task scheduling to achieve energy-efficient data offloading in NGOSNs. Our goal is to properly balance the minimization of the total energy consumption and the maximization of the sum weights of tasks. Due to the tight coupling between power allocation and task scheduling, we first derive the optimal power allocation solution to the joint optimization problem with any given task scheduling policy. We then leverage the conflict graph model to transform the joint optimization problem into an Integer Linear Programming (ILP) problem with any given power allocation strategy. We explore the unique structure of the ILP problem to derive an efficient semidefinite relaxation-based solution. Finally, we utilize the genetic framework to combine the above special solutions as a two-layer solution for the original joint optimization problem. Simulation results demonstrate that our proposed solution can properly balance the reduction of total energy consumption and the improvement of the sum weights of tasks, thus achieving superior system performance over the current literature.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2882-2896"},"PeriodicalIF":4.7000,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10966450/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In Non-Geostationary Orbit Satellite Networks (NGOSNs) with a large number of battery-carrying satellites, proper power allocation and task scheduling are crucial to improving data offloading efficiency. In this work, we jointly optimize power allocation and task scheduling to achieve energy-efficient data offloading in NGOSNs. Our goal is to properly balance the minimization of the total energy consumption and the maximization of the sum weights of tasks. Due to the tight coupling between power allocation and task scheduling, we first derive the optimal power allocation solution to the joint optimization problem with any given task scheduling policy. We then leverage the conflict graph model to transform the joint optimization problem into an Integer Linear Programming (ILP) problem with any given power allocation strategy. We explore the unique structure of the ILP problem to derive an efficient semidefinite relaxation-based solution. Finally, we utilize the genetic framework to combine the above special solutions as a two-layer solution for the original joint optimization problem. Simulation results demonstrate that our proposed solution can properly balance the reduction of total energy consumption and the improvement of the sum weights of tasks, thus achieving superior system performance over the current literature.
非地球静止轨道卫星网络数据卸载联合功率分配与任务调度
在具有大量载电池卫星的非地球静止轨道卫星网络中,合理的功率分配和任务调度是提高数据卸载效率的关键。在这项工作中,我们共同优化了非政府组织网络的功率分配和任务调度,以实现节能的数据卸载。我们的目标是适当地平衡总能耗的最小化和任务总权重的最大化。由于功率分配与任务调度之间的紧密耦合,我们首先推导了任意给定任务调度策略的联合优化问题的最优功率分配解。然后利用冲突图模型将联合优化问题转化为具有任意给定功率分配策略的整数线性规划(ILP)问题。我们探索了ILP问题的独特结构,得出了一个有效的基于半定松弛的解。最后,利用遗传框架将上述特殊解组合为原联合优化问题的两层解。仿真结果表明,我们提出的方案能够很好地平衡总能耗的降低和任务总权值的提高,从而获得优于现有文献的系统性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术官方微信