Probabilistic Caching in Wireless D2D Networks: Cache Hit Optimal Versus Throughput Optimal

Abstract

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.

Analysis and Optimization of Random Cache in Multi-Antenna HetNets with Interference Nulling

“…and z ∈ {1, 2, 3}. First, using the PGFL of PPP with densities (7) in different regions, we calculate the Laplace transforms of three types of interferences as follows:…”

“…Recent contributions have considered the analysis and optimization of various performance metrics in random cache based small cell networks, e.g. the throughput [7], the hit probability [8], and the successful transmission probability (STP) [9]. Note that [7]- [9] focus on the scenarios without interference management.…”

“…the throughput [7], the hit probability [8], and the successful transmission probability (STP) [9]. Note that [7]- [9] focus on the scenarios without interference management. Interference management is critical in random cache based networks.…”

Individual Preference Aware Caching Policy Design for Energy-Efficient Wireless D2D Communications

“…Cache-aided D2D has demonstrated the ability to significantly improve network performance without the need for newly installed infrastructure and complicated coding. 1 Thus, numerous papers have been published on this topic, aiming to understand and improve the hit-rate (file outage) [9], [16], throughput [9], [17], [18], energy efficiency (EE) [18], [19], and latency of the networks [7], [34]. For example, the theoretical throughput-outage tradeoff was investigated in [9], [10].…”

Cooperative Transmission and Probabilistic Caching for Clustered D2D Networks

“…This triggers the optimal content placement strategy to be frequently updated, which makes the content placement quite complex. To cope with this problem, probabilistic content placement is proposed whereby each device randomly caches a subset of the content with a certain caching probability in stochastic networks [4]. In this paper, we focus on the probabilistic content placement problem.…”