A novel coded caching scheme for partially cooperative device-to-device networks

This paper studies coded caching in a partially cooperative D2D network, where only a subset of users transmit, while all request files. We propose a novel coded caching scheme that operates at all feasible memory regimes, regardless of the number of non-transmitting users. Compared to all known schemes, the proposed scheme requires the least amount of information about non-transmitting users, and its delivery phase is independent of the identities of non-transmitting users, thereby reducing coordination overhead. We also derive a lower bound on the transmission load. Using this, the proposed scheme is shown to be optimal in the high-memory regime.