2019/03/06 by Ming‐Chun Lee, Andreas F. Molisch, Lee, Ming-Chun +1
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Wireless Networks and Protocols
paper · pdf · doi:10.48550/arxiv.1903.02705
openalex publication_date 2019/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Cache-aided wireless device-to-device (D2D) networks allow significant\nthroughput increase, depending on the concentration of the popularity\ndistribution of files. Many studies assume that all users have the same\npreference distribution; however, this may not be true in practice. This work\ninvestigates whether and how the information about individual preferences can\nbenefit cache-aided D2D networks. We examine a clustered network and derive a\nnetwork utility that considers both the user distribution and channel fading\neffects into the analysis. We also formulate a utility maximization problem for\ndesigning caching policies. This maximization problem can be applied to\noptimize several important quantities, including throughput, energy efficiency\n(EE), cost, and hit-rate, and to solve different tradeoff problems. We provide\na general approach that can solve the proposed problem under the assumption\nthat users coordinate, then prove that the proposed approach can obtain the\nstationary point under a mild assumption. Using simulations of practical\nsetups, we show that performance can improve significantly with proper\nexploitation of individual preferences. We also show that different types of\ntradeoffs exist between different performance metrics and that they can be\nmanaged through caching policy and cooperation distance designs.\n