Cargando…

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

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Yu, Jia, Wang, Ye, Gu, Shushi, Zhang, Qinyu, Chen, Siyun, Zhang, Yalin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515065/
https://www.ncbi.nlm.nih.gov/pubmed/33267290
http://dx.doi.org/10.3390/e21060576
_version_ 1783586732661276672
author Yu, Jia
Wang, Ye
Gu, Shushi
Zhang, Qinyu
Chen, Siyun
Zhang, Yalin
author_facet Yu, Jia
Wang, Ye
Gu, Shushi
Zhang, Qinyu
Chen, Siyun
Zhang, Yalin
author_sort Yu, Jia
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7515065
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-75150652020-11-09 Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks Yu, Jia Wang, Ye Gu, Shushi Zhang, Qinyu Chen, Siyun Zhang, Yalin Entropy (Basel) Article 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. MDPI 2019-06-08 /pmc/articles/PMC7515065/ /pubmed/33267290 http://dx.doi.org/10.3390/e21060576 Text en © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Yu, Jia
Wang, Ye
Gu, Shushi
Zhang, Qinyu
Chen, Siyun
Zhang, Yalin
Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
title Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
title_full Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
title_fullStr Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
title_full_unstemmed Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
title_short Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
title_sort cross-entropy method for content placement and user association in cache-enabled coordinated ultra-dense networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515065/
https://www.ncbi.nlm.nih.gov/pubmed/33267290
http://dx.doi.org/10.3390/e21060576
work_keys_str_mv AT yujia crossentropymethodforcontentplacementanduserassociationincacheenabledcoordinatedultradensenetworks
AT wangye crossentropymethodforcontentplacementanduserassociationincacheenabledcoordinatedultradensenetworks
AT gushushi crossentropymethodforcontentplacementanduserassociationincacheenabledcoordinatedultradensenetworks
AT zhangqinyu crossentropymethodforcontentplacementanduserassociationincacheenabledcoordinatedultradensenetworks
AT chensiyun crossentropymethodforcontentplacementanduserassociationincacheenabledcoordinatedultradensenetworks
AT zhangyalin crossentropymethodforcontentplacementanduserassociationincacheenabledcoordinatedultradensenetworks