English

Probabilistic Caching in Wireless D2D Networks: Cache Hit Optimal vs. Throughput Optimal

Networking and Internet Architecture 2016-11-10 v1 Information Theory math.IT

Abstract

Departing from the conventional cache hit optimization in cache-enabled wireless networks, we consider an alternative optimization approach for the probabilistic caching placement in stochastic wireless D2D caching networks taking into account the reliability of D2D transmissions. Using tools from stochastic geometry, we provide a closed-form approximation of cache-aided throughput, which measures the density of successfully served requests by local device caches, and we obtain the optimal caching probabilities with numerical optimization. Compared to the cache-hit-optimal case, the optimal caching probabilities obtained by cache-aided throughput optimization show notable gain in terms of the density of successfully served user requests, particularly in dense user environments.

Keywords

Cite

@article{arxiv.1611.03016,
  title  = {Probabilistic Caching in Wireless D2D Networks: Cache Hit Optimal vs. Throughput Optimal},
  author = {Zheng Chen and Nikolaos Pappas and Marios Kountouris},
  journal= {arXiv preprint arXiv:1611.03016},
  year   = {2016}
}

Comments

IEEE Communications Letters

R2 v1 2026-06-22T16:47:21.867Z