Joint computing and communication resource allocation for satellite communication networks with edge computing
Joint computing and communication resource allocation for satellite communication networks with edge computing
复制标题
具有边缘计算的卫星通信网络联合计算和通信资源分配
DOI：
10.23919/jcc.2021.07.019
复制
发表时间：
2021
影响因子：
4.1
通讯作者：
Weidong Wang
中科院分区：
文献类型：
--
作者：
Shanghong Zhang;Gaofeng Cui;Yating Long;Weidong Wang
由于星上处理能力的增强和卫星-地面的高速链路，卫星边缘计算被认为是一种很有前途的技术，可以促进卫星通信网(SCN)计算密集型应用的执行。通过在卫星和网关站中部署边缘计算服务器，SCN可以以扩展资源管理的维度和复杂性为代价，实现计算能力的显著提升。因此，为了最小化计算密集型应用的执行延迟，本文研究了SCN的联合计算和通信资源管理问题，同时考虑了两种不同的卫星边缘计算场景和局部执行。此外，计算密集型服务的联合计算和通信资源分配问题被描述为一个混合整数规划问题。提出了一种基于博弈论和多对一匹配理论的方案(JCCRA-GM)来获得近似最优解。数值结果表明，该方法具有与Brute-force方法几乎相同的加权和延迟，且复杂度较低。
Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links, satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks (SCNs). By deploying edge computing servers in satellite and gateway stations, SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management. Therefore, in this paper, we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications, while two different satellite edge computing scenarios and local execution are considered. Furthermore, the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem. A game-theoretic and many-to-one matching theory-based scheme (JCCRA-GM) is proposed to achieve an approximate optimal solution. Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.