论文标题

用于二维缓存的超密集网络的编码缓存方案

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

论文作者

Cheng, Minquan, Xu, Jinwei, Zhang, Mingming, Wu, Youlong

论文摘要

编码的缓存技术是一种有效的方法,可以减少网络中的传输负载,并且近年来已经在异质网络设置中进行了研究。在本文中,我们考虑了一个新的广泛的缓存系统,称为$(k_1,k_2,u,u,r,m,n)$二维(2D)缓存的缓存超密集网络(UDN),其中包含$ n $ files的服务器,$ k_1k_2 $ cache nodes nodes and $ k_1k_2 $ cache nodes and $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1 $ k_1用户随机分布在缓存节点周围。每个缓存节点最多可以缓存,最多可以$ M \ leq n $文件,并且具有欧几里得距离的某个服务区域。服务器通过无错误的共享链接连接到用户,并且缓存节点服务区域中的用户可以自由检索此缓存节点的所有缓存内容。我们旨在为2D缓存的UDN系统设计一个编码的缓存方案,以减少最坏情况下的传输负载,同时满足所有可能的用户需求。首先,我们根据其地理位置将所有可能的用户分为四个类。然后,我们的一阶最佳方案是根据Maddah-Ali和Niesen方案提出的。此外,通过基于最大距离(MDS)代码的最大距离(MDS)代码来压缩我们第一个方案的传输信号,我们获得了一个改进的订单最佳方案,并具有较小的传输负载。

Coded caching technique is an efficient approach to reduce the transmission load in networks and has been studied in heterogeneous network settings in recent 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 neatly on a grid with $K_1$ rows and $K_2$ columns, and $U$ cache-less users randomly distributed around cache nodes. Each cache node can cache at most $M\leq N$ files and has a certain service region by Euclidean distance. The server connects to users through an error-free shared link and the users in the service region of a cache node can freely retrieve all cached contents of this cache node. We aim to design a coded caching scheme for 2D caching-aided UDN systems to reduce the transmission load in the worst case while meeting all possible users' demands. First, we divide all possible users into four classes according to their geographical locations. Then our first order optimal scheme is proposed based on the Maddah-Ali and Niesen scheme. Furthermore, by compressing the transmitted signals of our first scheme based on Maximum Distance Separable (MDS) code, we obtain an improved order optimal scheme with a smaller transmission load.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源