Mobile Coded Caching in Small Cell Networks: Algorithm Design and Performance Analysis

Guangyu Zhu

doi:10.23919/JCC.2023.00.027

Mobile Coded Caching in Small Cell Networks: Algorithm Design and Performance Analysis

2023-06-01

2

PRE

AI

Guangyu Zhu (Guangyu Zhu)

DOI：10.23919/JCC.2023.00.027

原文链接

原文求助

摘要

En 中文

In coded caching, users cache pieces of files under a specific arrangement so that the server can satisfy their requests simultaneously in the broadcast scenario via eXclusive OR (XOR) operation and there-fore reduce the amount of transmission data. How-ever, when users' locations are changing, the upload-ing of caching information is frequent and extensive that the traffic increase outweighed the traffic reduc-tion that the traditional coded caching achieved. In this paper, we propose mobile coded caching schemes to reduce network traffic in mobility scenarios, which achieve a lower cost on caching information upload-ing. In the cache placement phase, the proposed scheme first constructs caching patterns, and then as-signs the caching patterns to users according to the graph coloring method and four color theorem in our centralized cache placement algorithm or randomly in our decentralized cache placement algorithm. Then users are divided into groups based on their caching patterns. As a benefit, when user movements occur, the types of caching pattern, rather than the whole caching information of which file pieces are cached, are uploaded. In the content delivery phase, XOR coded caching messages are reconstructed. Transmis-sion data volume is derived to measure the perfor-mance of the proposed schemes. Numerical results show that the proposed schemes achieve great improvement in traffic offloading.

Keyword:

coded caching

mobility

small-cell net-works

Mobile Coded Caching in Small Cell Networks: Algorithm Design and Performance Analysis

摘要

期刊

机构

引用论文