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

Publication Type:
Journal Article
Citation:
IEEE Transactions on Wireless Communications, 2018, 17 (1), pp. 492 - 505
Issue Date:
2018-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
08094948.pdfPublished Version1.4 MB
Adobe PDF
© 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.
Please use this identifier to cite or link to this item: