On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks
On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks
复制标题
DOI：
--
复制
发表时间：
2017-12
期刊：
影响因子：
--
通讯作者：
Jinyu Wang;Minquan Cheng;Qifa Yan;Xiaohu Tang
中科院分区：
文献类型：
--
作者：
Jinyu Wang;Minquan Cheng;Qifa Yan;Xiaohu Tang
编码高速缓存方案是作为在设备到设备（简称D2 D）通信中的峰值时间期间减少无线网络负担的解决方案的有效技术。在编码缓存方案中，每个文件块应该被分成$F$个包。设计一种码率和$F$尽可能小的编码缓存方案，特别是在D2 D网络的实际应用中具有重要意义。在本文中，我们首先通过一个简单的阵列称为D2 D放置交付阵列（DPDA在镜头）的D2 D网络的编码缓存方案的特点。因此，可以借助于适当的DPDA来讨论用于D2 D网络的一些编码缓存方案。其次，我们推导出的DPDA的速率和$F$的下界。根据这两个下界，我们证明了先前已知的由Ji等人提出的确定方案，(IEEE Trans.通知。Theory，62（2）：849- 869，2016）达到了我们的速率下限，但对于某些参数，不满足F$的下限。最后，对于这些参数，我们构造了三类DPDA，满足我们的两个下界。基于这些DPDA，获得了三类低速率和较低$F$的D2 D网络编码缓存方案。
The coded caching scheme is an efficient technique as a solution to reduce the wireless network burden during the peak times in a Device-to-Device (D2D in short) communications. In a coded caching scheme, each file block should be divided into $F$ packets. It is meaningful to design a coded caching scheme with the rate and $F$ as small as possible, especially in the practice for D2D network. In this paper we first characterize coded caching scheme for D2D network by a simple array called D2D placement delivery array (DPDA in shot). Consequently some coded caching scheme for D2D network can be discussed by means of an appropriate DPDA. Secondly we derive the lower bounds on the rate and $F$ of a DPDA. According these two lower bounds, we show that the previously known determined scheme proposed by Ji et al., (IEEE Trans. Inform. Theory, 62(2): 849-869,2016) reaches our lower bound on the rate, but does not meet the lower bound on $F$ for some parameters. Finally for these parameters, we construct three classes of DPDAs which meet our two lower bounds. Based on these DPDAs, three classes of coded caching scheme with low rate and lower $F$ are obtained for D2D network.