Prerequisites & Notation

Before You Begin

This chapter combines coded multicasting (Chapter 2) with D2D caching (Chapter 10). Prerequisites: the MAN scheme, D2D scaling law, and asymptotic analysis.

MAN coded multicasting (Ch 2)(Review ch02)
Self-check: Can you state the MAN placement and delivery?
D2D caching and $\Theta(M/N)$ scaling (Ch 10)(Review ch10)
Self-check: Can you state the Ji-Caire-Molisch scaling law?
Gupta-Kumar-style scaling analysis(Review ch22)
Self-check: Do you know the $1/\sqrt{n \log n}$ result for ad-hoc?
Index coding basics(Review ch04)
Self-check: Can you describe the connection between MAN and index coding?
Spatial reuse in ad-hoc networks
Self-check: Why can multiple short-range links coexist without mutual interference?
Asymptotic analysis
Self-check: What does 'scaling law' mean, and what's the difference from a 'rate'?

Notation for This Chapter

Symbols for coded D2D. Inherits from Chapter 10.

Symbol	Meaning	Introduced
$n$	Number of users in the D2D network	s01
$M, N$	Per-user cache size, library size	s01
$\mu = M/N$	Memory ratio (figure of merit)	s01
$t$	Local caching gain $t = K_g M/N$ within a local cluster of size $K_g$	s01
$K_g$	Local cluster size (users within D2D range of each other)	s02
$T_{\text{uncoded}}, T_{\text{coded}}$	Per-user throughput under uncoded vs coded D2D delivery	s02
$c_{\text{coded}}, c_{\text{uncoded}}$	Constant multipliers in the $\Theta(M/N)$ scaling	s03

← Ch 10 Combining Coded Multicasting with D2D