Table of Contents
Fetching ...

D2D Coded Caching Schemes for Multiaccess Networks with Combinatorial Access Topology

Rashid Ummer N. T., B. Sundar Rajan

TL;DR

The paper develops combinatorial-design-based multiaccess D2D coded caching (MADCC) schemes that extend prior cyclic topologies by leveraging $t$-designs and $t$-GDDs to define access topologies. It constructs placement and delivery arrays (DPDA-like) and derives achievable memory-load tradeoffs, achieving lower subpacketization or favorable load under fixed cache budgets. The work also shows how MADCC schemes yield new D2D schemes for the original network and compares their performance to existing WCCWC and derived CWEC schemes, highlighting design-topology-driven gains and scalability. Practical directions include decentralization, flexible topologies, and handling nonuniform popularities and selfish nodes.

Abstract

This paper considers wireless device-to-device (D2D) coded caching in a multiaccess network, where the users communicate with each other and each user can access multiple cache nodes. Access topologies derived from two combinatorial designs known as the $t$-design and $t$-group divisible design ($t$-GDD), referred to as the $t$-design and $t$-GDD topologies respectively, which subsume a few other known topologies, have been studied for the multiaccess coded caching (MACC) network by Cheng \textit{et al.} in \cite{MACC_des}. These access topologies are extended to a multiaccess D2D coded caching (MADCC) network and novel MADCC schemes are proposed. MADCC network has been studied so far only for the cyclic wrap-around topology. Apart from the proposed novel MADCC schemes, MADCC schemes are also derived from the existing MACC schemes in \cite{MACC_des}. To compare the performance of different MADCC schemes, the metrics of load per user and subpacketization level are used while keeping the number of caches and cache memory size same. The proposed MADCC scheme with $t$-design topology performs better in terms of subpacketization level while achieving the same load per user compared to the MADCC scheme derived from the MACC scheme with $t$-design topology in \cite{MACC_des}. The proposed MADCC scheme with $t$-GDD topology performs better in terms of load per user while achieving the same subpacketization level compared to the MADCC scheme derived from the MACC scheme with $t$-GDD topology in \cite{MACC_des} in some cases. Compared to the existing MADCC scheme with cyclic wrap-around topology, the proposed MADCC scheme with $t$-design topology performs better in terms of load per user, and the proposed MADCC scheme with $t$-GDD topology performs better in terms of subpacketization level at the expense of an increase in load per user.

D2D Coded Caching Schemes for Multiaccess Networks with Combinatorial Access Topology

TL;DR

The paper develops combinatorial-design-based multiaccess D2D coded caching (MADCC) schemes that extend prior cyclic topologies by leveraging -designs and -GDDs to define access topologies. It constructs placement and delivery arrays (DPDA-like) and derives achievable memory-load tradeoffs, achieving lower subpacketization or favorable load under fixed cache budgets. The work also shows how MADCC schemes yield new D2D schemes for the original network and compares their performance to existing WCCWC and derived CWEC schemes, highlighting design-topology-driven gains and scalability. Practical directions include decentralization, flexible topologies, and handling nonuniform popularities and selfish nodes.

Abstract

This paper considers wireless device-to-device (D2D) coded caching in a multiaccess network, where the users communicate with each other and each user can access multiple cache nodes. Access topologies derived from two combinatorial designs known as the -design and -group divisible design (-GDD), referred to as the -design and -GDD topologies respectively, which subsume a few other known topologies, have been studied for the multiaccess coded caching (MACC) network by Cheng \textit{et al.} in \cite{MACC_des}. These access topologies are extended to a multiaccess D2D coded caching (MADCC) network and novel MADCC schemes are proposed. MADCC network has been studied so far only for the cyclic wrap-around topology. Apart from the proposed novel MADCC schemes, MADCC schemes are also derived from the existing MACC schemes in \cite{MACC_des}. To compare the performance of different MADCC schemes, the metrics of load per user and subpacketization level are used while keeping the number of caches and cache memory size same. The proposed MADCC scheme with -design topology performs better in terms of subpacketization level while achieving the same load per user compared to the MADCC scheme derived from the MACC scheme with -design topology in \cite{MACC_des}. The proposed MADCC scheme with -GDD topology performs better in terms of load per user while achieving the same subpacketization level compared to the MADCC scheme derived from the MACC scheme with -GDD topology in \cite{MACC_des} in some cases. Compared to the existing MADCC scheme with cyclic wrap-around topology, the proposed MADCC scheme with -design topology performs better in terms of load per user, and the proposed MADCC scheme with -GDD topology performs better in terms of subpacketization level at the expense of an increase in load per user.
Paper Structure (22 sections, 19 theorems, 15 equations, 7 figures, 5 tables, 1 algorithm)

This paper contains 22 sections, 19 theorems, 15 equations, 7 figures, 5 tables, 1 algorithm.

Key Result

Theorem 1

JMQX For a given $(K, F, Z, S)$ DPDA $\mathbf{P}=(p_{j,k})_{F \times K}$, a $(K,M,N)$ D2D coded caching scheme can be obtained with subpacketization $F$ and $\frac{M}{N}=\frac{Z}{F}$ using Algorithm d2d_alg. For any demand vector $\vec{d}$, the demands of all the users are met with a transmission lo

Figures (7)

  • Figure 1: Multiaccess D2D coded caching network model.
  • Figure 2: Placement array and delivery array in Example \ref{['ex:madcc_tdes']}.
  • Figure 3: Placement array and delivery array in Example \ref{['ex:madcc_tdes_cor1']}.
  • Figure 4: Load per user and subpacketization level as a function of memory of schemes in Theorem \ref{['thm:MADCC_tdes']} and Corollary \ref{['cor:MADCC_tdes']} for a $(6,1001,14,M,N)$ multiaccess D2D network.
  • Figure 5: Placement array in Example \ref{['ex:madcc_tgdd']}.
  • ...and 2 more figures

Theorems & Definitions (43)

  • Definition 1: PDA
  • Definition 2: DPDA
  • Theorem 1
  • Example 1
  • Definition 3
  • Definition 4: Design $(\mathcal{X}, \mathcal{A})$
  • Definition 5: $t-(v, k, \lambda)$ design
  • Example 2
  • Theorem 2
  • Theorem 3
  • ...and 33 more