A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912567135305728 |
|---|---|
| author | T., Rashid Ummer N. Namboodiri, K. K. Krishnan Rajan, B. Sundar |
| author_facet | T., Rashid Ummer N. Namboodiri, K. K. Krishnan Rajan, B. Sundar |
| contents | Device-to-device (D2D) communication is one of the most promising techniques for future wireless cellular communication systems. This paper considers coded caching in a partially cooperative wireless D2D network, where only a subset of users transmit during delivery, while all users request files. The non-transmitting users are referred to as selfish users. All existing schemes that do not require knowledge of the identity of selfish users before content placement are limited to the high-memory regime, particularly when the number of selfish users is large. We propose a novel coded caching scheme for a partially cooperative D2D network that operates in all feasible memory regimes, regardless of the number of selfish users. We also derive a lower bound on the transmission load of a partially cooperative D2D coded caching scheme. Using this bound, the proposed scheme is shown to be optimal in the high-memory regime. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_02532 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks T., Rashid Ummer N. Namboodiri, K. K. Krishnan Rajan, B. Sundar Information Theory Device-to-device (D2D) communication is one of the most promising techniques for future wireless cellular communication systems. This paper considers coded caching in a partially cooperative wireless D2D network, where only a subset of users transmit during delivery, while all users request files. The non-transmitting users are referred to as selfish users. All existing schemes that do not require knowledge of the identity of selfish users before content placement are limited to the high-memory regime, particularly when the number of selfish users is large. We propose a novel coded caching scheme for a partially cooperative D2D network that operates in all feasible memory regimes, regardless of the number of selfish users. We also derive a lower bound on the transmission load of a partially cooperative D2D coded caching scheme. Using this bound, the proposed scheme is shown to be optimal in the high-memory regime. |
| title | A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks |
| topic | Information Theory |
| url | https://arxiv.org/abs/2509.02532 |