Part 3: D2D and Distributed Caching

Chapter 10: D2D Caching Fundamentals

Advanced~165 min

Learning Objectives

  • Define the D2D (device-to-device) caching network where users are both transmitters and receivers
  • State the Ji-Caire-Molisch scaling law: per-user throughput scales as Θ(M/N)\Theta(M/N) for random demands
  • Understand why D2D caching converts local traffic into a globally distributed library
  • Analyze the asymptotic throughput scaling as network size nn \to \infty
  • Compare D2D + caching with infrastructure-based (base station) delivery
  • Characterize the random-geometric-graph model assumptions underlying the scaling law

Sections

Prerequisites

💬 Discussion

Loading discussions...