Document Type
Conference Proceeding
Publication Date
1-1-2018
Abstract
In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)- enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. In order to enhance the throughput of spectrum-sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links (CDLs) and non- cooperative D2D links (NDLs), which is NP-hard. To solve the problem, we decompose it into two sub- problems, which maximize the sum rates of the CDLs and the NDLs, respectively. For CDL optimization, we propose a semi-orthogonal-based algorithm for joint user scheduling and power allocation. For NDL optimization, we propose a novel low-complexity algorithm to perform link scheduling and develop a Difference of Convex functions (D.C.) programming method to solve the non-convex power allocation problem. Simulation results show that cooperative transmission can significantly improve both the number of served users and the overall system throughput.
Publication Source (Journal or Book title)
Proceedings - IEEE Global Communications Conference, GLOBECOM
Recommended Citation
Liu, J., Guo, S., Xiao, S., Pan, M., Zhou, X., Li, G., Wu, G., & Li, S. (2018). Resource Allocation for Cooperative D2D-Enabled Wireless Caching Networks. Proceedings - IEEE Global Communications Conference, GLOBECOM https://doi.org/10.1109/GLOCOM.2018.8647286