Wireless Device-to-Device Caching Networks with Distributed MIMO and Hierarchical Cooperations

© 2017 IEEE. In this paper, we propose a new caching scheme for a random wireless device-to-device (D2D) network of n nodes with local caches, where each node intends to download files from a prefixed library via D2D links. Our proposed caching delivery includes two stages, employing distributed MIMO and hierarchical cooperations respectively. The distributed MIMO is applied to the first stage between source nodes and neighbours of the destination node. The induced multiplexing gain and diversity gain increase the number of simultaneous transmissions, improving the throughput of the network. The hierarchical cooperations are applied to the second stage to facilitate the transmissions between the destination node and its neighbours. The two stages together exploit spatial degrees of freedom as well as spatial reuse. We develop an uncoded random caching placement strategy to serve this cooperative caching delivery. Analytical results show that the average aggregate throughput of the network scales almost linearly with n, with a vanishing outage probability

Performance of Caching-Based D2D Video Distribution with Measured Popularity Distributions

On-demand video accounts for the majority of wireless data traffic. Video distribution schemes based on caching combined with device-to-device (D2D) communications promise order-of-magnitude greater spectral efficiency for video delivery, but hinge on the principle of `concentrated demand distributions.' This paper presents, for the first time, the analysis and evaluations of the throughput--outage tradeoff of such schemes based on measured cellular demand distributions. In particular, we use a dataset with more than 100 million requests from the BBC iPlayer, a popular video streaming service in the U.K., as the foundation of the analysis and evaluations. We present an achievable scaling law based on the practical popularity distribution, and show that such scaling law is identical to those reported in the literature. We find that also for the numerical evaluations based on a realistic setup, order-of-magnitude improvements can be achieved. Our results indicate that the benefits promised by the caching-based D2D in the literature could be retained for cellular networks in practice.Comment: Submitted to IEEE Globecom 201

An Achievable Throughput Scaling Law of Wireless Device-to-Device Caching Networks with Distributed MIMO and Hierarchical Cooperations

© 2002-2012 IEEE. In this paper, we propose a new caching scheme for a random wireless device-to-device (D2D) network of n nodes with local caches, where each node intends to download files from a prefixed library via D2D links. Our proposed caching delivery includes two stages, employing distributed MIMO and hierarchical cooperations, respectively. The distributed MIMO is applied to the first stage between source nodes and neighbors of the destination node. The induced multiplexing gain and diversity gain increase the number of simultaneous transmissions, improving the throughput of the network. The hierarchical cooperations are applied to the second stage to facilitate the transmissions between the destination node and its neighbors. The two stages together exploit spatial degrees of freedom as well as spatial reuse. We develop an uncoded random caching placement strategy to serve this cooperative caching delivery. Analytical results show that the average aggregate throughput of the network scales almost linearly with n, with a vanishing outage probability. Furthermore, we derive an explicit expression of the optimal throughput as a function of system parameters, such as pathloss factor under a target outage probability. Analytical and numerical results demonstrate that our proposed scheme outperforms existing ones when the local cache size is limited