Content Placement and User Association for Delay Minimization in Small Cell Networks

Wei, Teng; Sheng, Min; Guo, Kun; Qiu, Zhiliang

doi:10.1109/tvt.2019.2936182

Cited by 15 publications

(13 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, designers in [22] jointly optimized the MD association and BS muting to maximize the number of served MDs. Besides these mechanisms, there still exist other association mechanisms that jointly executed the MD association and content caching to minimize distinct network delay [23], [24], and another delayaware association mechanism [25].…”

Section: A Related Workmentioning

confidence: 99%

Mobile Device Association and Resource Allocation in Small-Cell IoT Networks with Mobile Edge Computing and Caching

Zhou¹,

Yue²,

Dong³

et al. 2022

Preprint

View full text Add to dashboard Cite

To meet the need of computation-sensitive (CS) and high-rate (HR) communications, the framework of mobile edge computing and caching has been widely regarded as a promising solution. When such a framework is implemented in small-cell IoT (Internet of Tings) networks, it is a key and open topic how to assign mobile edge computing and caching servers to mobile devices (MDs) with CS and HR communications. Since these servers are integrated into small base stations (BSs), the assignment of them refers to not only the BS selection (i.e., MD association), but also the selection of computing and caching modes. To mitigate the network interference and thus enhance the system performance, some highly-effective resource partitioning mechanisms are introduced for access and backhaul links firstly. After that a problem with minimizing the sum of MDs' weighted delays is formulated to attain a goal of joint MD association and resource allocation under limited resources. Considering that the MD association and resource allocation parameters are coupling in such a formulated problem, we develop an alternating optimization algorithm according to the coalitional game and convex optimization theorems. To ensure that the designed algorithm begins from a feasible initial solution, we develop an initiation algorithm according to the conventional best channel association, which is used for comparison and the input of coalition game in the simulation. Simulation results show that the algorithm designed for minimizing the sum of MDs' weighted delays may achieve a better performance than the initiation (best channel association) algorithm in general.

show abstract

Section: A Related Workmentioning

confidence: 99%

Mobile Device Association and Resource Allocation in Small-Cell IoT Networks with Mobile Edge Computing and Caching

Zhou¹,

Yue²,

Dong³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In [27], the authors elaborated on cell selection policies and proposed a new cell selection algorithm considering the backhaul constraints and end-to-end performance requirements for 5G networks. In [28], the joint user association and content placement problem in UDN is investigated, where the delay and capacity at backhaul links are taken into consideration. In [29], the authors maximized energy efficiency in smallcell networks by jointly adjusting cell association and radio resource allocation under the constraints of quality of service and backhaul link capacity.…”

Section: Related Workmentioning

confidence: 99%

“…is is because the cell association adjustment has a coupled relationship with the serving cell decision of the users. erefore, like references [27,28], in this paper, we do not consider the small-scale fading case when we calculate the average channel gain. e SINR of user u is calculated by…”

Section: System Modelmentioning

confidence: 99%

IMPSO and Linear Programming-Based Energy-Efficient Cell Association Algorithm for Backhaul-Constrained Ultra-Dense Small-Cell Networks

Jiang

Zhu

Song

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper studies the energy efficiency optimization problem for coordinated multipoint (CoMP)-enabled and backhaul-constrained ultra-dense small-cell networks (UDNs). Energy efficiency is an eternal topic for future wireless communication networks; however, taking actual bottleneck of the backhaul link and the coordinated network architecture into consideration, it is difficult to find an effective way to improve the energy efficiency of the network. Aiming at this problem, we propose to combine cell association, subchannel allocation, backhaul resource allocation, and sleep/on of the cells together to develop an optimization algorithm for energy efficiency in UDN and then solve the formulated energy efficiency optimization problem by means of improved modified particle swarm optimization (IMPSO) and linear programming in mathematics. Simulation results indicate that nearly 13 % energy cost saving and 21 % energy efficiency improvement can be obtained by combining IMPSO with linear programming, and the backhaul link data rate can be improved by 30 % as the number of small cells increases. From the results, it can be found that by combining IMPSO with linear programming, the proposed algorithm can improve the network energy efficiency effectively at the expense of limited complexity.

show abstract

“…Caching placement strategy is strongly coupled with user association strategy. While caching placement strategy directly affects the deployment of user association strategy, the result of user association can indirectly affect the design of caching placement strategy [21][22][23][24]. In [21], the authors formulated a joint optimization of the caching placement and user association policy to reduce the content delivery delay.…”

Section: Introductionmentioning

confidence: 99%

“…While caching placement strategy directly affects the deployment of user association strategy, the result of user association can indirectly affect the design of caching placement strategy [21][22][23][24]. In [21], the authors formulated a joint optimization of the caching placement and user association policy to reduce the content delivery delay. In [23], considering the conditions of the backhaul in terms of delay and wireless channel quality, a joint optimization of the caching placement and user association policy was studied in HCN.…”

Section: Introductionmentioning

confidence: 99%

Two Time-Scale Caching Placement and User Association in Dynamic Cellular Networks

Zhang

Wang

et al. 2022

IEEE Trans. Commun.

View full text Add to dashboard Cite

With the rapid growth of data traffic in cellular networks, edge caching has become an emerging technology for traffic offloading. We investigate the caching placement and content delivery in cacheenabling cellular networks. To cope with the time-varying content popularity and user location in practical scenarios, we formulate a long-term joint dynamic optimization problem of caching placement and user association for minimizing the content delivery delay which considers both content transmission delay and content update delay. To solve this challenging problem, we decompose the optimization problem into two sub-problems, the user association sub-problem in a short time scale and the caching placement in a long time scale. Specifically, we propose a low complexity user association algorithm for a given caching placement in the short time scale. Then we develop a deep deterministic policy gradient based caching placement algorithm which involves the short time-scale user association decisions in the long time scale. Finally, we propose a joint user association and caching placement algorithm to obtain a sub-optimal solution for the proposed problem. We illustrate the convergence and performance of the proposed algorithm by simulation results. Simulation results show that compared with the benchmark algorithms, the proposed algorithm reduces the long-term content delivery delay in dynamic networks effectively.

show abstract

Content Placement and User Association for Delay Minimization in Small Cell Networks

Cited by 15 publications

References 36 publications

Mobile Device Association and Resource Allocation in Small-Cell IoT Networks with Mobile Edge Computing and Caching

Mobile Device Association and Resource Allocation in Small-Cell IoT Networks with Mobile Edge Computing and Caching

IMPSO and Linear Programming-Based Energy-Efficient Cell Association Algorithm for Backhaul-Constrained Ultra-Dense Small-Cell Networks

Two Time-Scale Caching Placement and User Association in Dynamic Cellular Networks

Contact Info

Product

Resources

About