TY - JOUR
T1 - Centralized Caching and Delivery of Correlated Contents over Gaussian Broadcast Channels
AU - Yang, Qianqian
AU - Hassanzadeh, Parisa
AU - Gunduz, Deniz
AU - Erkip, Elza
N1 - Funding Information:
Manuscript received April 9, 2019; revised September 3, 2019; accepted October 16, 2019. Date of publication November 4, 2019; date of current version January 15, 2020. This work has been supported in part by NSF under grant #1619129, in part by NYU WIRELESS Industrial Affiliates Program, and in part by the European Research Council project BEACON under grant number 677854 and EC H2020-MSCA-ITN-2015 project SCAVENGE under grant number 675891. This article was presented in part at the IEEE International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Network (WiOpt), Shanghai, China, May 2018 [1]. The associate editor coordinating the review of this article and approving it for publication was L. Ong. (Corresponding author: Qianqian Yang.) Q. Yang and D. Gündüz are with the Electrical and Electronic Engineering Department, Imperial College London, London SW7 2AZ, U.K. (e-mail: q.yang14@imperial.ac.uk; d.gunduz@imperial.ac.uk).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2020/1
Y1 - 2020/1
N2 - 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. Two centralized caching schemes are proposed, both of which not only utilize the user's local caches, but also exploit the correlation among the contents in the database. The first scheme implements uncoded cache placement and delivers coded contents to users using superposition coding. The second scheme, which is proposed for small cache sizes, places coded contents in users' caches and jointly encodes the cached contents of users and the messages targeted at them. The performance of the proposed schemes, which provide upper bounds on the required transmit power for a given cache capacity, is characterized. The scheme based on coded placement improves upon the first one for small cache sizes, and under certain conditions meets the uncoded placement lower bound. A lower bound on the required transmit power is also presented assuming uncoded cache placement. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussian BC can provide significant energy savings.
AB - 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. Two centralized caching schemes are proposed, both of which not only utilize the user's local caches, but also exploit the correlation among the contents in the database. The first scheme implements uncoded cache placement and delivers coded contents to users using superposition coding. The second scheme, which is proposed for small cache sizes, places coded contents in users' caches and jointly encodes the cached contents of users and the messages targeted at them. The performance of the proposed schemes, which provide upper bounds on the required transmit power for a given cache capacity, is characterized. The scheme based on coded placement improves upon the first one for small cache sizes, and under certain conditions meets the uncoded placement lower bound. A lower bound on the required transmit power is also presented assuming uncoded cache placement. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussian BC can provide significant energy savings.
KW - Coded caching
KW - content correlation
KW - noisy broadcast channel
UR - http://www.scopus.com/inward/record.url?scp=85078337784&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078337784&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2019.2950930
DO - 10.1109/TCOMM.2019.2950930
M3 - Article
AN - SCOPUS:85078337784
SN - 1558-0857
VL - 68
SP - 122
EP - 136
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 1
M1 - 8890656
ER -