Coded Caching for Broadcast Networks with User Cooperation

TL;DR

This paper introduces new coded caching schemes for broadcast networks with user cooperation, achieving near-optimal transmission delay by exploiting parallel data delivery and cooperation gains in both centralized and decentralized settings.

Contribution

Proposes novel coded caching schemes that are order-optimal and leverage user cooperation and parallel transmission to reduce delay in broadcast networks.

Findings

Centralized scheme is order-optimal within a constant factor.

Decentralized scheme is order-optimal when cache size exceeds a threshold.

User cooperation and parallel transmission significantly reduce transmission delay.

Abstract

In this paper, we investigate the transmission delay of cache-aided broadcast networks with user cooperation. Novel coded caching schemes are proposed for both centralized and decentralized caching settings, by efficiently exploiting time and cache resources and creating parallel data delivery at the server and users. We derive a lower bound on the transmission delay and show that the proposed centralized coded caching scheme is \emph{order-optimal} in the sense that it achieves a constant multiplicative gap within the lower bound. Our decentralized coded caching scheme is also order-optimal when each user's cache size is larger than the threshold $N(1-\sqrt[{K-1}]{ {1}/{(K+1)}})$ (approaching 0 as $K\to \infty$), where $K$ is the total number of users and $N$ is the size of file library. Moreover, for both the centralized and decentralized caching settings, our schemes obtain an additional \emph{cooperation gain} offered by user cooperation and an additional \emph{parallel gain} offered by the parallel transmission among the server and users. It is shown that in order to reduce the transmission delay, the number of users parallelly sending signals should be appropriately chosen according to user's cache size, and alway letting more users parallelly send information could cause high transmission delay.