Individual Preference Aware Caching Policy Design in Wireless D2D Networks
Individual Preference Aware Caching Policy Design in Wireless D2D Networks
复制标题
DOI：
10.1109/twc.2020.2994581
复制
发表时间：
2019-03
影响因子：
10.4
通讯作者：
Ming-Chun Lee;A. Molisch
中科院分区：
文献类型：
--
作者：
Ming-Chun Lee;A. Molisch
缓存辅助的无线设备到设备（D2D）网络允许显著提高吞吐量，这取决于文件流行分布的集中程度。许多研究假设所有用户具有相同的偏好分布；然而，这在实践中可能并不正确。这项工作调查了关于个人偏好的信息是否以及如何使缓存辅助D2D网络受益。我们研究了一个集群网络，并推导了一个考虑用户分布和信道衰落影响的网络实用程序。我们还提出了一个设计缓存策略的效用最大化问题。这个最大化问题可以应用于优化几个重要的量，包括吞吐量、能源效率（EE）、成本和命中率，并解决不同的权衡问题。给出了在用户坐标假设下求解问题的一般方法，并证明了该方法在较温和的假设下可以得到平稳点。通过对实际设置的模拟，我们表明，适当利用个人偏好可以显著提高性能。我们还展示了不同性能指标之间存在不同类型的权衡，并且可以通过缓存策略和合作距离设计来管理这些权衡。
Cache-aided wireless device-to-device (D2D) networks allow significant throughput increase, depending on the concentration of the popularity distribution of files. Many studies assume that all users have the same preference distribution; however, this may not be true in practice. This work investigates whether and how the information about individual preferences can benefit cache-aided D2D networks. We examine a clustered network and derive a network utility that considers both the user distribution and channel fading effects into the analysis. We also formulate a utility maximization problem for designing caching policies. This maximization problem can be applied to optimize several important quantities, including throughput, energy efficiency (EE), cost, and hit-rate, and to solve different tradeoff problems. We provide a general approach that can solve the proposed problem under the assumption that users coordinate, then prove that the proposed approach can obtain the stationary point under a mild assumption. Using simulations of practical setups, we show that performance can improve significantly with proper exploitation of individual preferences. We also show that different types of tradeoffs exist between different performance metrics and that they can be managed through caching policy and cooperation distance designs.