Problem
Research questions and friction points this paper is trying to address.
subpacketization
device-to-device coded caching
heterogeneous file splitting
packet type framework
Reducing Subpacketization in Device-to-Device Coded Caching via Heterogeneous File Splitting
🤖 AI Summary
This work addresses the limitation of existing device-to-device (D2D) coded caching schemes, which, under certain parameter regimes, struggle to further reduce subpacketization due to their reliance on homogeneous packet partitioning. To overcome this, we introduce a heterogeneous subpacketization mechanism that allows different packet types to have varying sizes, and jointly optimize it with user grouping and multicast transmitter selection. The proposed approach achieves a constant-factor reduction in subpacketization within the parameter region $(K, KM/N) = (2q+1, 2r)$ while preserving optimal communication rates. This fills a critical gap left by existing packet-type-based schemes in this regime and significantly reduces subpacketization overhead compared to the Ji–Caire–Molisch scheme.
📝 Abstract
The packet type (PT)-based framework~\cite{zhang2026taming} provides a systematic and principled approach to designing device-to-device (D2D) coded caching schemes that achieve reduced \sbp while preserving the optimal communication rate. However, existing PT designs rely exclusively on homogeneous \sbp, where all packets have an identical size regardless of their types. This restriction limits the achievable \sbp reduction in certain parameter regimes. In this paper, we extend the PT framework to \emph{heterogeneous} \sbp, allowing packet sizes to vary across types under a refined type classification. The packet sizes, in conjunction with user grouping and multicast transmitter selection, are jointly optimized to minimize the overall \sbp level while preserving the optimal rate. Based on the heterogeneous PT framework, we construct a new class of D2D coded caching schemes for $(K, KM/N)=(2q+1, 2r)$ with $q,r \in \mathbb{N}_+$, where $K,N$ and $M$ denote the number of users, files and cache memory size, respectively. The proposed construction achieves a constant-factor reduction in \sbp compared to the Ji-Caire-Molisch (JCM) caching scheme~\cite{ji2016fundamental} and complements existing PT designs that are not applicable in this parameter regime.
Innovation
Methods, ideas, or system contributions that make the work stand out.
heterogeneous subpacketization
device-to-device coded caching
packet type framework
communication rate optimization
cache placement
🔎 Similar Papers
No similar papers found.
