【24h】

Linear Network Coded Wireless Caching

机译:线性网络编码的无线缓存

获取原文

摘要

This paper studies a K×M multiple-input multiple-output (MIMO) wireless caching that consists of a library, K base stations (BSs), and M users, where each BS and user are equipped with NTand NRantennas respectively. Consider that each BS has a local cache that can prefetch some popular data requested by users from the library. We propose a linear network coding (NC) assisted wireless caching, considering the finite cache size and the variability of the user requests. In the cache placement phase, we design a joint NC caching function at K BSs to store linear combinations of messages from the library. In the content delivery phase, each user can successfully decode its requested messages by the receiver shaping and reverse NC operation. Our analytical results verify that, without any shared caching messages at different BSs, the proposed caching scheme is compatible with distinct user requests. In particular, for a 2 × 2 MIMO wireless caching network, the proposed caching scheme can achieve a higher total degree of freedom (DoF) of min(2NT, 2NR) - 1 while consuming a smaller cache size, compared with the existing caching scheme.
机译:本文研究了一个K×M多输入多输出(MIMO)无线缓存,它由一个库,K个基站(BS)和M个用户组成,其中每个BS和用户都配备了N个 T 和N R 天线。考虑每个BS具有本地缓存​​,该本地缓存可以预取用户从库请求的一些流行数据。考虑到有限的缓存大小和用户请求的可变性,我们提出了一种线性网络编码(NC)辅助的无线缓存。在缓存放置阶段,我们在K个BS处设计了一个联合NC缓存功能,以存储来自库的消息的线性组合。在内容交付阶段,每个用户都可以通过接收器整形和反向NC操作成功解码其请求的消息。我们的分析结果证明,在不同的BS上没有任何共享的缓存消息的情况下,所提出的缓存方案与不同的用户请求兼容。特别是,对于2×2 MIMO无线缓存网络,所提出的缓存方案可以实现更高的min(2N)总自由度(DoF)。 T ,2N R )-1,与现有的缓存方案相比,占用的缓存较小。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号