Chapter Summary

Chapter Summary

Key Points

  • 1.

    Coded D2D combines MAN-style placement with D2D delivery. Users partitioned into clusters of size KgK_g; MAN delivery within each cluster; spatial reuse across clusters.

  • 2.

    Ji-Caire-Molisch 2015 result (CommIT): The scaling order of per-user throughput is Θ(ΞΌ)\Theta(\mu) for both uncoded and coded D2D. The two mechanisms β€” spatial reuse and coded multicasting β€” do not cumulate at the scaling-law level.

  • 3.

    Coded scheme wins on the constant. ccoded/cuncodedβ‰ˆ1+KgM/Nc_{\text{coded}}/ c_{\text{uncoded}} \approx 1 + K_g M/N. For KgM/N=2K_g M/N = 2-55 (typical), the coded scheme is 3-6Γ— better in practical throughput.

  • 4.

    Shared resource constraint. Both mechanisms compete for the same airtime. Spatial reuse gives concurrent links; coded multicast gives more content per link. They don't multiplicatively compound.

  • 5.

    Aggregate throughput scales linearly in nn for D2D (both coded and uncoded) β€” much better than cellular's log⁑n\log n. D2D is the right delivery paradigm for dense networks.

  • 6.

    Design lever: cluster size KgK_g. Larger KgK_g improves coded-gain constant but explodes subpacketization (KgKgM/N)\binom{K_g} {K_g M/N}. Practical sweet spot: Kg∈[5,20]K_g \in [5, 20].

  • 7.

    Deployment viability. 5G NR Sidelink supports the basic D2D primitives. Cache-aware protocols exist as 3GPP study items (Rel-19+). Coordinated MAN placement across devices is the main standardization gap.

Looking Ahead

Chapter 12 introduces demand privacy β€” the constraint that users' demands must remain hidden from other users (or the server). The CommIT results (Wan-Caire and Wan-Sun-Ji-Tuninetti-Caire) show remarkably that demand privacy can be achieved at zero rate cost in the shared-link setting, and with a clean characterization in the D2D setting. Privacy, contrary to intuition, is not expensive in coded caching.