Fundamentals of Cluster-Centric Content Placement in Cache-Enabled Device-to-Device Networks

摘要

This paper develops a comprehensive analytical framework with foundations in stochastic geometry to characterize the performance of cluster-centric content placement in a cache-enabled device-to-device (D2D) network. Different from device-centric content placement, cluster-centric placement focuses on placing content in each cluster, such that the collective performance of all the devices in each cluster is optimized. Modeling the locations of the devices by a Poisson cluster process, we define and analyze the performance for three general cases: 1) k-Tx case: the receiver of interest is chosen uniformly at random in a cluster and its content of interest is available at the kth closest device to the cluster center; 2) 1-Rx case: the receiver of interest is the Ith closest device to the cluster center and its content of interest is available at a device chosen uniformly at random from the same cluster; and 3) baseline case: the receiver of interest is chosen uniformly at random in a cluster and its content of interest is available at a device chosen independently and uniformly at random from the same cluster. Easy-to-use expressions for the key performance metrics, such as coverage probability and area spectral efficiency of the whole network, are derived for all three cases. Our analysis concretely demonstrates significant improvement in the network performance when the device on which content is cached or device requesting content from cache is biased to lie closer to the cluster center compared with the baseline case. Based on this insight, we develop and analyze a new generative model for cluster-centric D2D networks that allows to study the effect of intra-cluster interfering devices that are more likely to lie closer to the cluster center.