Research Article
Service Delay Minimization-Based Joint Clustering and Content Placement Algorithm for Cellular D2D Communication Systems
@INPROCEEDINGS{10.1007/978-3-030-41117-6_15, author={Ahmad Zubair and Pengfei Ma and Tao Wei and Ling Wang and Rong Chai}, title={Service Delay Minimization-Based Joint Clustering and Content Placement Algorithm for Cellular D2D Communication Systems}, proceedings={Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 -- December 1, 2019, Proceedings, Part II}, proceedings_a={CHINACOM PART 2}, year={2020}, month={2}, keywords={Cellular network Device-to-device D2D communication User association Content placement Service delay}, doi={10.1007/978-3-030-41117-6_15} }- Ahmad Zubair
Pengfei Ma
Tao Wei
Ling Wang
Rong Chai
Year: 2020
Service Delay Minimization-Based Joint Clustering and Content Placement Algorithm for Cellular D2D Communication Systems
CHINACOM PART 2
Springer
DOI: 10.1007/978-3-030-41117-6_15
Abstract
The rapidly increasing content fetching requirements pose challenges to the transmission performance of traditional cellular system. Due to the limited transmission performance of cellular links and the caching capabilities of the base stations (BSs), it is highly difficult to achieve the quality of service (QoS) requirements of multi-user content requests. In this paper, a joint user association and content placement algorithm is proposed for cellular device-to-device (D2D) communication network. Assuming that multiple users located in a specific area may have content requests for the same content, a clustering and content placement mechanism is presented in order to achieve efficient content acquisition. A joint clustering and content placement optimization model is formulated to minimize total user service delay, which can be solved by Lagrange partial relaxation, iterative algorithm and Kuhn-Munkres algorithm, and the joint clustering and content placement strategies can be obtained. Finally, the effectiveness of the proposed algorithm is verified by MATLAB simulation.
