2019/06/21 by Qianqian Yang, Yang, Qianqian, Parisa Hassanzadeh +6
Computer Science · Mathematics · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Opportunistic and Delay-Tolerant Networks #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1906.09970
This paper was presented in part at the IEEE Int'l Symp. on Modeling and Opt. in Mobile, Ad Hoc, and Wireless Netw. (WiOpt), Shanghai, China, May 2018. arXiv admin note: substantial text overlap with arXiv:1804.10152
arxiv created 2019/06/21 · openalex publication_date 2019/06/21 · arxiv updated 2019/06/25 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
Content delivery in a multi-user cache-aided broadcast network is studied, where a server holding a database of correlated contents communicates with the users over a Gaussian broadcast channel (BC). The minimum transmission power required to satisfy all possible demand combinations is studied, when the users are equipped with caches of equal size. Assuming uncoded cache placement, a lower bound on the required transmit power as a function of the cache capacity is derived. An achievable centralized caching scheme is proposed, which not only utilizes the user's local caches, but also exploits the correlation among the contents in the database. The performance of the scheme, which provides an upper bound on the required transmit power for a given cache capacity, is characterized. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussain BC can provide significant energy savings.