.png){kind=icon}
.png){kind=icon}
Return
Data-Supported Caching Policy Optimization for Wireless D2D Caching Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2021.3104634.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we study a data-supported caching policy design for wireless D2D caching networks, which is based on a dataset collected from a campus Wi-Fi network. After a well-designed preprocessing for the dataset, for the first time, we conduct a real dataset based performance evaluation for the caching policies designed based on the homogeneous Poisson Point Process (PPP) model and a clustered PPP model. We proceed to propose a novel approach for the design of the D2D caching policy. It directly models the number of D2D neighbours, instead of characterizing the locations of users as the PPP models. We show that the number of D2D neighbours can be well modeled by a discrete Gamma distribution. Given the model, we develop an iterative algorithm to optimize the D2D caching policy, and also provide a method to optimize the cache update time in order to balance the caching gain and overhead. Simulation results based on the dataset show that the proposed caching policy can achieve good performance with low cost of cache updating.
Keywords:
Device-to-device communication
Mathematical model
Wireless communication
Probabilistic logic
Optimization
Wireless fidelity
Instant messaging
Proactive caching
D2D communication
Wi-Fi dataset
neighbour distribution
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W