Joint User Association and Caching in Wireless Heterogeneous Networks with Backhaul
Joint User Association and Caching in Wireless Heterogeneous Networks with Backhaul
复制标题
DOI：
10.1109/icc42927.2021.9500762
复制
发表时间：
2021-06
期刊：
影响因子：
--
通讯作者：
Yuezhou Liu;A. Alizadeh;M. Vu;E. Yeh
中科院分区：
文献类型：
--
作者：
Yuezhou Liu;A. Alizadeh;M. Vu;E. Yeh
我们考虑由无线接入网络和回程网络组成的移动的网络。接入网络中的所有基站和回程网络中的网关都配备有高速缓存，从而可以通过将所请求的内容项高速缓存到更靠近用户的位置来降低用于服务内容请求的路由成本。在这种情况下，无线接入网络中的用户关联必须知道无线信道的质量和内容缓存策略。在本文中，我们提出了一个框架，共同优化无线用户关联和内容缓存在接入和回程网络。由此产生的问题是NP难的。我们提出了一个基于凸近似和管道舍入的多项式时间算法，该算法可以在1 − 1/e的常数因子内产生最优解。仿真结果表明，该联合算法在最小化总路由开销和回程业务量的同时，在接入网中获得了较高的数据总速率，优于将联合收割机与缓存无关的用户关联方法与传统缓存策略（如LRU）相结合的方案.
We consider a mobile network consisting of both the wireless access network and the backhaul network. All base stations in the access network and gateways in the backhaul network are equipped with caches, so that routing costs for serving content requests can be reduced by caching the requested content items closer to the users. In this case, user association in the wireless access network must be aware of both the quality of wireless channels and the content caching strategy. In this paper, we propose a framework that jointly optimizes wireless user association and content caching in both access and backhaul networks. The resulting problem is NP-hard. We propose a polynomial-time algorithm based on convex approximation and pipage rounding that produces a solution within a constant factor of 1 − 1/e from the optimal. Simulation results show that the proposed joint algorithm outperforms schemes that combine cache-independent user association methods with traditional caching strategies (e.g. LRU) in terms of minimizing the aggregate routing cost and backhaul traffic while achieving a high data sum rate in the access network.