This website requires JavaScript.

# Coded Caching Schemes for Two-dimensional Caching-aided Ultra-Dense Networks

Dec 2022

Coded caching technique is an efficient approach to reduce the transmissionload in networks and has been studied in heterogeneous network settings inrecent years. In this paper, we consider a new widespread caching system called$(K_1,K_2,U,r,M,N)$ two-dimensional (2D) caching-aided ultra-dense network(UDN) with a server containing $N$ files, $K_1K_2$ cache nodes arranged neatlyon a grid with $K_1$ rows and $K_2$ columns, and $U$ cache-less users randomlydistributed around cache nodes. Each cache node can cache at most $M\leq N$files and has a certain service region by Euclidean distance. The serverconnects to users through an error-free shared link and the users in theservice region of a cache node can freely retrieve all cached contents of thiscache node. We aim to design a coded caching scheme for 2D caching-aided UDNsystems to reduce the transmission load in the worst case while meeting allpossible users' demands. First, we divide all possible users into four classesaccording to their geographical locations. Then our first order optimal schemeis proposed based on the Maddah-Ali and Niesen scheme. Furthermore, bycompressing the transmitted signals of our first scheme based on MaximumDistance Separable (MDS) code, we obtain an improved order optimal scheme witha smaller transmission load.

Q1论文试图解决什么问题？
Q2这是否是一个新的问题？
Q3这篇文章要验证一个什么科学假设？
0