Joint Distributed Link Scheduling and Power Allocation for Content Delivery in Wireless Caching Networks

Abstract

In wireless caching networks, the design of the content delivery method must consider random user requests, caching states, network topology, and interference management. In this article, we establish a general framework for content delivery in wireless caching networks without stringent assumptions that restrict the network structure and interference model. Based on the framework, we propose a dynamic and distributed link scheduling and power allocation scheme for content delivery that is assisted by belief-propagation (BP) algorithms. The proposed scheme achieves three critical purposes of wireless caching networks: 1) limiting the delay of user request satisfactions, 2) maintaining the power efficiency of caching nodes, and 3) managing interference among users. In addition, we address the intrinsic problem of the BP algorithm in our network model, proposing a matching algorithm for one-to-one link scheduling. Simulation results show that the proposed scheme provides almost the same delay performance as the optimal scheme found through an exhaustive search at the expense of a little additional power consumption and does not require a clustering method and orthogonal resources in a large-scale D2D network.