Coded Multicasting for Content Delivery over Predictable Time-Varying Satellite Communication Networks  

作　　者：Fan Xu Shuo Shao Meixia Tao Qin Huang Qifa Yan Xiaohu Tang 

机构地区：[1]Peng Cheng Laboratory,Shenzhen,Guangdong 518000,China [2]Department of Electronic Engineering,Shanghai Jiao Tong University,Shanghai 200240,China [3]School of Electronics and Information Engineering,BeiHang University,Beijing 100191,China [4]School of Information Science and Technology,Southwest Jiaotong University,Chengdu,Sichuan 611756,China

出　　处：《China Communications》2023年第6期339-367,共29页中国通信（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grants 61941106,61901261,12031011,and 62071026。

摘　　要：With the development of astronautic technology, communication satellites now have a tremendous gain in both quantity and quality, and have already shown their capability on multi-functional converged communication other than telecommunication. Under this circumstance, increasing the transmission efficiency of satellite communication network becomes a top priority. In this paper, we focus on content delivery service on satellite networks, where each ground station may have prefetched some file fragments. We cast this problem into a coded caching framework so as to exploit the coded multicast gain for minimizing the satellite communication load. We first propose an optimization-based coded multicast scheme by considering the special property that the satellite network topology is predictable and timevariant. Then, a greedy based fast algorithm is proposed, which can tremendously reduce the computation complexity with a small loss in optimality. Simulation experiments conducted on two Walker constellation satellite networks show that our proposed coded multicast method can efficiently reduce the communication load of satellite networks.

关 键 词：satellite communication content delivery coded multicast greedy algorithm 

分 类 号：TN927.2[电子电信—通信与信息系统]