{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:52:46Z","timestamp":1760143966037,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62361146853","62071115","62371129","2024A03"],"award-info":[{"award-number":["62361146853","62071115","62371129","2024A03"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Fund of the National Mobile Communications Research Laboratory, Southeast University","award":["62361146853","62071115","62371129","2024A03"],"award-info":[{"award-number":["62361146853","62071115","62371129","2024A03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>D2D coded caching, originally introduced by Ji, Caire, and Molisch, significantly improves communication efficiency by applying the multi-cast technology proposed by Maddah-Ali and Niesen to the D2D network. Most prior works on D2D coded caching are based on the assumption that all users will request content at the beginning of the delivery phase. However, in practice, this is often not the case. Motivated by this consideration, this paper formulates a new problem called request-robust D2D coded caching. The considered problem includes K users and a content server with access to N files. Only r users, known as requesters, request a file each at the beginning of the delivery phase. The objective is to minimize the average and worst-case delivery rate, i.e., the average and worst-case number of broadcast bits from all users among all possible demands. For this novel D2D coded caching problem, we propose a scheme based on uncoded cache placement and exploiting common demands and one-shot delivery. We also propose information-theoretic converse results under the assumption of uncoded cache placement. Furthermore, we adapt the scheme proposed by Yapar et al. for uncoded cache placement and one-shot delivery to the request-robust D2D coded caching problem and prove that the performance of the adapted scheme is order optimal within a factor of two under uncoded cache placement and within a factor of four in general. Finally, through numerical evaluations, we show that the proposed scheme outperforms known D2D coded caching schemes applied to the request-robust scenario for most cache size ranges.<\/jats:p>","DOI":"10.3390\/e26030250","type":"journal-article","created":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:14:40Z","timestamp":1710245680000},"page":"250","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4288-4528","authenticated-orcid":false,"given":"Wuqu","family":"Wang","sequence":"first","affiliation":[{"name":"National Mobile Communications Research Laboratory, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Tao","sequence":"additional","affiliation":[{"name":"Huawei Technologies, Nanjing 210012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4155-0685","authenticated-orcid":false,"given":"Nan","family":"Liu","sequence":"additional","affiliation":[{"name":"National Mobile Communications Research Laboratory, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Kang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3619","DOI":"10.1109\/ACCESS.2017.2779844","article-title":"A Survey on 5G Networks for the Internet of Things: Communication Technologies and Challenges","volume":"6","author":"Akpakwu","year":"2018","journal-title":"IEEE Access"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/MCOM.2013.6495773","article-title":"Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution","volume":"51","author":"Golrezaei","year":"2013","journal-title":"IEEE Commun. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental Limits of Caching","volume":"60","author":"Niesen","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"5770","DOI":"10.1109\/TVT.2022.3158363","article-title":"Hierarchical Coded Caching for Multiscale Content Sharing in Heterogeneous Vehicular Networks","volume":"71","author":"Wei","year":"2022","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TNET.2014.2317316","article-title":"Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff","volume":"23","author":"Niesen","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cheng, H., Li, C., Xiong, H., and Frossard, P. (September, January 28). Optimal decentralized coded caching for heterogeneous files. Proceedings of the 2017 25th European Signal Processing Conference (EUSIPCO), Kos, Greece.","DOI":"10.23919\/EUSIPCO.2017.8081667"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TVT.2019.2949979","article-title":"Decentralized Coded Caching Scheme With Heterogeneous File Sizes","volume":"69","author":"Zheng","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1109\/TIT.2015.2504556","article-title":"Fundamental Limits of Caching in Wireless D2D Networks","volume":"62","author":"Ji","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"8179","DOI":"10.1109\/TCOMM.2019.2940671","article-title":"On the Optimality of D2D Coded Caching With Uncoded Cache Placement and One-Shot Delivery","volume":"67","author":"Yapar","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"6967","DOI":"10.1109\/TCOMM.2023.3310506","article-title":"Three-User D2D Coded Caching With Two Random Requesters and One Sender","volume":"71","author":"Wang","year":"2023","journal-title":"IEEE Trans. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1109\/TIT.2017.2785237","article-title":"The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching","volume":"64","author":"Yu","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"5701","DOI":"10.1109\/TIT.2022.3173581","article-title":"On the Fundamental Limits of Device-to-Device Private Caching under Uncoded Cache Placement and User Collusion","volume":"68","author":"Wan","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Wan, K., Sun, H., Ji, M., Tuninetti, D., and Caire, G. (2020, January 7\u201311). Device-to-Device Private Caching with Trusted Server. Proceedings of the ICC 2020\u20132020 IEEE International Conference on Communications (ICC), Dublin, Ireland.","DOI":"10.1109\/ICC40277.2020.9149038"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Wan, K., Sun, H., Ji, M., Tuninetti, D., and Caire, G. (2020, January 21\u201326). Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174279"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1109\/TCOMM.2020.2970950","article-title":"Device-to-Device Coded-Caching With Distinct Cache Sizes","volume":"68","author":"Ibrahim","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5283","DOI":"10.1109\/TCOMM.2020.3006897","article-title":"Towards Finite File Packetizations in Wireless Device-to-Device Caching Networks","volume":"68","author":"Woolsey","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Zhang, X., and Ji, M. (2022, January 4\u20136). Finite-length Analysis of D2D Coded Caching via Exploiting Asymmetry in Delivery. Proceedings of the 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC), Oulu, Finland.","DOI":"10.1109\/SPAWC51304.2022.9834012"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.1109\/TIFS.2019.2940885","article-title":"Device-to-Device Secure Coded Caching","volume":"15","author":"Zewail","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Awan, Z.H., and Sezgin, A. (2015, January 8\u201312). Fundamental limits of caching in D2D networks with secure delivery. Proceedings of the 2015 IEEE International Conference on Communication Workshop (ICCW), London, UK.","DOI":"10.1109\/ICCW.2015.7247223"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ji, M., Chen, R.R., Caire, G., and Molisch, A.F. (2017, January 25\u201330). Fundamental limits of distributed caching in multihop D2D wireless networks. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8007070"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2489","DOI":"10.1109\/TCOMM.2020.3045787","article-title":"Optimal Throughput-Outage Analysis of Cache-Aided Wireless Multi-Hop D2D Networks","volume":"69","author":"Lee","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Tebbi, A., and Sung, C.W. (2017, January 6\u20138). Coded caching in partially cooperative D2D communication networks. Proceedings of the 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Munich, Germany.","DOI":"10.1109\/ICUMT.2017.8255121"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Phatak, A., and Varanasi, M.K. (July, January 26). An improved coded caching scheme for partially cooperative D2D networks. Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland.","DOI":"10.1109\/ISIT50566.2022.9834579"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/LCOMM.2022.3212679","article-title":"New Constructions of D2D Placement Delivery Arrays","volume":"27","author":"Li","year":"2023","journal-title":"IEEE Commun. Lett."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Wang, W., Liu, N., and Kang, W. (2023, January 23\u201326). Coded Caching in Request-robust D2D Communication Networks. Proceedings of the 2023 International Symposium on Networks, Computers and Communications (ISNCC), Doha, Qatar.","DOI":"10.1109\/ISNCC58260.2023.10323632"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Liao, J., and Tirkkonen, O. (2022, January 10\u201313). Coded Caching in Presence of User Inactivity. Proceedings of the 2022 IEEE Wireless Communications and Networking Conference (WCNC), Austin, TX, USA.","DOI":"10.1109\/WCNC51071.2022.9771827"},{"key":"ref_27","unstructured":"Wan, K., Tuninetti, D., and Piantanida, P. (2016, January 11\u201314). On the optimality of uncoded cache placement. Proceedings of the 2016 IEEE Information Theory Workshop (ITW), Cambridge, UK."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TIFS.2014.2375553","article-title":"Fundamental Limits of Caching With Secure Delivery","volume":"10","author":"Sengupta","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1109\/TIT.2018.2870566","article-title":"Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2","volume":"65","author":"Yu","year":"2019","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/250\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:12:26Z","timestamp":1760105546000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":29,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["e26030250"],"URL":"https:\/\/doi.org\/10.3390\/e26030250","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}