A stochastic geometry approach to distributed caching in large wireless networks

Abstract

This paper introduces a stochastic geometry model of a cellular network in which users exchange videos through out-of-band device-to-device (D2D) communications. Users are grouped into clusters, in which a user-based distributed cache is formed to satisfy in-cluster video requests through D2D, avoiding the base station. This paper studies how many of these requests could be served, considering two service metrics: the global relative density of served requests, and the mean ratio of served requests per cluster. The model considers random user placement, content request statistics, and transmission scheduling and impairments, like fading and path loss. A simple communications strategy to be used in the clusters, involving time-division multiple access and one-hop transmissions, is introduced and the metrics are evaluated in this setup, drawing conclusions on the performance of distributed-caching in large wireless networks.