Joint User Association and Caching in Wireless Heterogeneous Networks with Backhaul

IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021)(2021)

引用 2|浏览4
暂无评分
摘要
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.
更多
查看译文
关键词
wireless user association,cache-independent user association methods,user association,wireless heterogeneous networks,mobile network,wireless access network,backhaul network,content requests,wireless channels,content caching strategy,convex approximation,NP-hard problem,aggregate routing cost,polynomial-time algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要