TY - GEN
T1 - Tradeoff of content sharing efficiency and secure transmission in coded caching systems
AU - Ding, Yinan
AU - Wang, Li
AU - Wu, Huaqing
AU - Shen, Xuemin
AU - Poor, H. Vincent
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China under Grant 61571056, Beijing Science and Technology Nova Program under Grant xx2018083, the U.S. National Science Foundation under Grants CNS-1702808 and ECCS-1647198, and the U.S. Army Research Office under Grant W911NF-16-1-0448.
PY - 2018/7/27
Y1 - 2018/7/27
N2 - Coded caching systems can facilitate traffic offloading from base stations and content sharing between content providers and content requesters via device- to-device (D2D) communications. In particular, dividing content items into mul-tiple pieces not only can enable the possibility of decreasing transmission delay and energy consumption, but also can contribute to secrecy enhancement since potential social outcasts can decode the content item only if they can obtain enough pieces. In this work, the tradeoff problem between content sharing efficiency and secure transmission in coded caching systems is investigated. First, to maximize the caching hit ratio with secrecy outage constraints, a joint optimization problem considering coding parameters, content placement, and power allocation is formulated. Further, a lower bound on the caching hit ratio and a upper bound on the secrecy outage probability are derived to simplify the original optimization problem. Numerical results demonstrate the effectiveness of the proposed scheme.
AB - Coded caching systems can facilitate traffic offloading from base stations and content sharing between content providers and content requesters via device- to-device (D2D) communications. In particular, dividing content items into mul-tiple pieces not only can enable the possibility of decreasing transmission delay and energy consumption, but also can contribute to secrecy enhancement since potential social outcasts can decode the content item only if they can obtain enough pieces. In this work, the tradeoff problem between content sharing efficiency and secure transmission in coded caching systems is investigated. First, to maximize the caching hit ratio with secrecy outage constraints, a joint optimization problem considering coding parameters, content placement, and power allocation is formulated. Further, a lower bound on the caching hit ratio and a upper bound on the secrecy outage probability are derived to simplify the original optimization problem. Numerical results demonstrate the effectiveness of the proposed scheme.
KW - Coded caching
KW - Power allocation
KW - Secure content sharing
UR - http://www.scopus.com/inward/record.url?scp=85051439837&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85051439837&partnerID=8YFLogxK
U2 - 10.1109/ICC.2018.8422139
DO - 10.1109/ICC.2018.8422139
M3 - Conference contribution
AN - SCOPUS:85051439837
SN - 9781538631805
T3 - IEEE International Conference on Communications
BT - 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Conference on Communications, ICC 2018
Y2 - 20 May 2018 through 24 May 2018
ER -