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

arXiv: https://arxiv.org/abs/1611.03016 · HTML: https://mlsanity.com/paper/1611.03016/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Nov 2016.

## Built on by (most cited first, 1 of 1)

- [A Survey on Reinforcement Learning-Aided Caching in Mobile Edge Networks](https://mlsanity.com/paper/2105.05564/) (2021)

## Abstract (arXiv)

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.