Abstract
This paper studies the optimal probabilistic caching placement in large-scale cache-enabled D2D networks to maximize the cache hit performance, which is defined as the probability that a random user request can be served by mobile helpers (MHs) in the vicinity. To avoid collisions of the concurrent transmissions, a contention based multimedia delivery protocol is proposed, under which a MH is allowed to transmit only if its back-off timer is the smallest among its associated contenders. By applying tools from stochastic geometry, the optimal caching probability is derived and analyzed. It is shown that the optimal solution of the probabilistic caching placement depends on the density of MHs, the D2D communication range, and the user request distribution. With the derived optimal caching probabilities, we further characterize the transmission probability of MHs and thereby the successful content delivery probability of the cache-enabled D2D network. Simulations are provided to validate our analysis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
