The base station-mobile device communication traffic has dramatically increased recently due to mobile data, which in turn heavily overloaded the underlying infrastructure. To decrease Base Station (BS) interaction, intra-cell communication between local devices, known as Device-to-Device, is utilized for distributed data caching. Nevertheless, due to the continuous departure of existing nodes and the arrival of newcomers, the missing cached data may lead to permanent data loss. In this study, we propose and analyze a class of LDPC codes for distributed data caching in cellular networks. Contrary to traditional distributed storage, a novel repair algorithm for LDPC codes is proposed which is designed to exploit the minimal direct BS communication. To assess the versatility of LDPC codes and establish performance comparisons to classic coding techniques, novel theoretical and experimental evaluations are derived. Essentially, the theoretical/numerical results for repair bandwidth cost in presence of BS are presented in a distributed caching setting. Accordingly, when the gap between the cost of downloading a symbol from BS and from other local network nodes is not dramatically high, we demonstrate that LDPC codes can be considered as a viable fault-tolerance alternative in cellular systems with caching capabilities for both low and high code rates.

翻译：最近,由于移动数据,基站-移动设备通信流量急剧增加,这反过来又使基本基础设施负担过重。为了减少基地站(BS)的相互作用,使用当地设备(即设备到设备)之间的细胞内部通信进行分布式数据缓存。然而,由于现有节点的不断离开和新来者的到来,缺失的缓存数据可能导致永久数据丢失。在本研究中,我们提议和分析一组LDPC代码,用于移动电话网络中分布式数据封存。与传统的分布式存储相反,提出了一种LDPC代码的新修复算法,旨在利用最低限度的直接BS通信。为了评估LDPC代码的多功能,并确立与经典编码技术的性比,可以得出新的理论和实验性评估。基本上,在分布式缓存环境中,在使用 BS 的情况下,修理带宽成本的理论/数字结果可能会导致永久数据丢失。因此,当从BS 和其他本地网络节点下载一个符号的费用差距不高时,我们证明LDPC代码可以被视为一种可行的高的代码,在低的细胞系统中,同时可以被视为一种可行的低代码。