On the Analysis of Content Dissemination with Reactive Content Pushing in Cache-Enabled D2D Networks

Device-to-device (D2D) communication has huge potential to offload ever increasing cellular traffic. As a premise, devices should store as many popular contents as possible. For augmenting the number of cached contents, in this paper, we propose a reactive content pushing (RCP) mechanism in cache-enabled D2D networks, in which some devices overhear the transmitted contents utilizing the broadcast nature of wireless medium. Since no proactive content pushing is involved, it doesn’t generate interference to the D2D links for normal content requests and its implementation is quite simple. By modeling the D2D network by Poisson point process (PPP), we derive the probabilities that users are in the defined states and the law of evolution of content caching distribution. Moreover, based on the PPP model, we derive the expressions of the successful offloading probability, the average delay and the upper bound of average energy consumption of a request. Simulation results demonstrate the accuracy of the theoretical results and the superiority of the RCP mechanism compared with general content dissemination process.