Next Article in Journal
A New Algorithm for Medical Color Images Encryption Using Chaotic Systems
Previous Article in Journal
List-Decoding Capacity of the Gaussian Arbitrarily-Varying Channel
Previous Article in Special Issue
Robust Baseband Compression Against Congestion in Packet-Based Fronthaul Networks Using Multiple Description Coding
Open AccessArticle

Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks

1
Communication Engineering Research Centre, Harbin Institute of Technology (Shenzhen), HIT Campus of University Town of Shenzhen, Shenzhen 518055, China
2
Peng Cheng Laboratory, Shenzhen 518055, China
3
School of Electronic and Communication Engineering, Shenzhen Polytechnic, Shenzhen 518055, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Entropy 2019, 21(6), 576; https://doi.org/10.3390/e21060576
Received: 27 March 2019 / Revised: 31 May 2019 / Accepted: 1 June 2019 / Published: 8 June 2019
(This article belongs to the Special Issue Information Theory for Data Communications and Processing)
Due to the high splitting-gain of dense small cells, Ultra-Dense Network (UDN) is regarded as a promising networking technology to achieve high data rate and low latency in 5G mobile communications. In UDNs, each User Equipment (UE) may receive signals from multiple Base Stations (BSs), which impose severe interference in the networks and in turn motivates the possibility of using Coordinated Multi-Point (CoMP) transmissions to further enhance network capacity. In CoMP-based Ultra-Dense Networks, a great challenge is to tradeoff between the gain of network throughput and the worsening backhaul latency. Caching popular files on BSs has been identified as a promising method to reduce the backhaul traffic load. In this paper, we investigated content placement strategies and user association algorithms for the proactive caching ultra dense networks. The problem has been formulated to maximize network throughput of cell edge UEs under the consideration of backhaul load, which is a constrained non-convex combinatorial optimization problem. To decrease the complexity, the problem is decomposed into two suboptimal problems. We first solved the content placement algorithm based on the cross-entropy (CE) method to minimize the backhaul load of the network. Then, a user association algorithm based on the CE method was employed to pursue larger network throughput of cell edge UEs. Simulation were conducted to validate the performance of the proposed cross-entropy based schemes in terms of network throughput and backhaul load. The simulation results show that the proposed cross-entropy based content placement scheme significantly outperform the conventional random and Most Popular Content placement schemes, with with 50% and 20% backhaul load decrease respectively. Furthermore, the proposed cross-entropy based user association scheme can achieve 30% and 23% throughput gain, compared with the conventional N-best, No-CoMP, and Threshold based user association schemes. View Full-Text
Keywords: ultra dense network; cross-entropy; proactive caching; user association; CoMP ultra dense network; cross-entropy; proactive caching; user association; CoMP
Show Figures

Figure 1

MDPI and ACS Style

Yu, J.; Wang, Y.; Gu, S.; Zhang, Q.; Chen, S.; Zhang, Y. Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks. Entropy 2019, 21, 576.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop