JOURNAL ARTICLE

A Cooperative Coded Caching Strategy for D2D-Enabled Cellular Networks

Abstract

With the explosive increase of data traffic in wireless networks, caching video contents by device-to-device (D2D) communication has emerged as an effective solution for alleviating the burden of backhaul links. How to improve cooperative caching between mobile users in D2D-enabled cellular networks is crucial. In this paper, we propose a cooperative coded caching (CCC) strategy for D2D-enabled cellular networks to minimize the delivery delay. In our method, users are divided into different social clusters through an interest-dependent Chinese restaurant process (ICRP) since users request different content based on their interests. Moreover, we exploit the maximum distance separable (MDS) code to encode the contents into distinct segments. We propose a caching algorithm based on a greedy approach to obtain the optimal content placement. Numerical results demonstrate the effectiveness of our proposed caching strategy in terms of average delivery delay.

Keywords:
Computer science Backhaul (telecommunications) Exploit Computer network Cellular network Wireless Greedy algorithm Cellular traffic Computer security Algorithm Base station Telecommunications

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
25
Refs
0.18
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Caching and Content Delivery
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Opportunistic and Delay-Tolerant Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.