Research Article
Joint User Association and Content Placement for D2D-Enabled Heterogeneous Cellular Networks
@INPROCEEDINGS{10.1007/978-3-030-06161-6_27, author={Yingying Li and Rong Chai and Qianbin Chen and Chun Jin}, title={Joint User Association and Content Placement for D2D-Enabled Heterogeneous Cellular Networks}, proceedings={Communications and Networking. 13th EAI International Conference, ChinaCom 2018, Chengdu, China, October 23-25, 2018, Proceedings}, proceedings_a={CHINACOM}, year={2019}, month={1}, keywords={Heterogeneous cellular networks User association Content placement D2D communication}, doi={10.1007/978-3-030-06161-6_27} }- Yingying Li
Rong Chai
Qianbin Chen
Chun Jin
Year: 2019
Joint User Association and Content Placement for D2D-Enabled Heterogeneous Cellular Networks
CHINACOM
Springer
DOI: 10.1007/978-3-030-06161-6_27
Abstract
The explosive increase of the multimedia traffic poses challenges on mobile communication systems. To stress this problem, caching technology can be exploited to reduce backhaul transmissions latency and improve content fetching efficiency. In this paper, we study the user association and content placement problem of device-to-device-enabled (D2D-enabled) heterogeneous cellular networks (HCNs). To stress the importance of the service delay of all the users, we formulate the joint user association and content placement problem as an integer-nonlinear programming problem. As the formulated NP-hardness of the problem, we apply the McCormick envelopes and the Lagrangian partial relaxation method to decompose the optimization problem into three subproblems and solved it by using Hungarian method and unidimensional knapsack algorithm. Simulation results validate the effectiveness of the proposed algorithm.