Abstract
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 time-variant. 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.
| Original language | English |
|---|---|
| Pages (from-to) | 339-367 |
| Number of pages | 29 |
| Journal | China Communications |
| Volume | 20 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1 Jun 2023 |
Keywords
- coded multicast
- content delivery
- greedy algorithm
- satellite communication
Fingerprint
Dive into the research topics of 'Coded multicasting for content delivery over predictable time-varying satellite communication networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver