scholarly journals Joint Cache Partitioning, Content Placement, and User Association for D2D-Enabled Heterogeneous Cellular Networks

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 56642-56655 ◽  
Author(s):  
Rong Chai ◽  
Yingying Li ◽  
Qianbin Chen
Keyword(s):  
Cellular Networks ◽  
User Association ◽  
Heterogeneous Cellular Networks ◽  
Cache Partitioning ◽  
Content Placement

scholarly journals Joint Optimization of Content Placement and User Association in Cache-Enabled Heterogeneous Cellular Networks Based on Flow-Level Models

2018 ◽  
Vol 2018 ◽  
pp. 1-20
Author(s):  
Hua Qu ◽  
Gongye Ren ◽  
Jihong Zhao ◽  
Zhenjie Tan ◽  
Shuyuan Zhao
Keyword(s):  
Cellular Networks ◽  
Content Delivery ◽  
Mixed Integer ◽  
Joint Optimization ◽  
User Association ◽  
Heterogeneous Cellular Networks ◽  
Coupled Models ◽  
Average Delay ◽  
Delivery Delay ◽  
Content Placement

Cache-enabled heterogeneous cellular networks (HCNs) have been investigated extensively to alleviate backhaul congestion and reduce content delivery delay. In this paper, we jointly optimize content placement and user association to minimize the average content delivery delay in cache-enabled HCNs based on flow-level models. This formulation considers (1) different timescales of content placement and content delivery, (2) locality of content popularity, and (3) the heterogeneity of spatial traffic distribution, which are often neglected in existing researches. The joint optimization problem is formulated as a mixed integer nonlinear programming problem in load-non-coupled and load-coupled models, respectively. We decouple this problem into two interrelated subproblems and resolve them individually. For the user association problem under a given content placement situation, we propose a content-level selective association algorithm, which allows the requests for different contents at the same location to connect to different base stations (BSs). In addition, we propose a greedy content caching algorithm to add contents to the caches of BSs in an iterative manner. These two algorithms are alternately executed until the caches of all the BSs are filled to capacity. Simulation results show that the proposed algorithm achieves better performance in terms of average delay and backhaul usage compared with traditional content placement and user association approaches.

Energy-efficient user association in downlink heterogeneous cellular networks

2016 ◽  
Vol 10 (13) ◽  
pp. 1553-1561 ◽  
Author(s):  
Tianqing Zhou ◽  
Yongming Huang ◽  
Luxi Yang
Keyword(s):  
Cellular Networks ◽  
Energy Efficient ◽  
User Association ◽  
Heterogeneous Cellular Networks
Sign in / Sign up

Export Citation Format

Share Document