启用缓存的CRAN中的绿色OFDMA资源分配
Green OFDMA Resource Allocation in Cache-Enabled CRAN
摘要：
云无线接入网（CRAN）是下一代无线通信系统的一个很有前途的候选方案，其中远程无线头端（RRH）被部署为服务目标区域中的用户，并且经由称为前传的有限容量链路连接到中央处理器（CP）。由于未来无线通信的以内容为中心的性质，期望在RRH处预先缓存流行内容，以减少前传的负担并通过协作传输实现节能。这促使我们在本文中的能量有效传输的正交频分多址（OFDMA）为基础的CRAN与多个RRH和用户，其中RRH可以预取流行的内容的研究。我们考虑联合优化的用户SC分配，RRH选择和发送功率分配在所有的SC，以最小化的RRH的总发送功率，受到RRH的个人前传容量约束和用户的最小速率约束，同时考虑到在RRH的缓存状态。虽然问题是非凸的，我们提出了一个拉格朗日对偶的解决方案，可以有效地计算具有良好的精度。我们比较了所提出的算法所需的最小发射功率与不同的缓存策略的情况下，没有缓存的模拟，这表明显着的节能与缓存。
英文摘要：
Cloud radio access network (CRAN), in which remote radio heads (RRHs) are deployed to serve users in a target area, and connected to a central processor (CP) via limited-capacity links termed the fronthaul, is a promising candidate for the next-generation wireless communication systems. Due to the content-centric nature of future wireless communications, it is desirable to cache popular contents beforehand at the RRHs, to reduce the burden on the fronthaul and achieve energy saving through cooperative transmission. This motivates our study in this paper on the energy efficient transmission in an orthogonal frequency division multiple access (OFDMA)-based CRAN with multiple RRHs and users, where the RRHs can prefetch popular contents. We consider a joint optimization of the user-SC assignment, RRH selection and transmit power allocation over all the SCs to minimize the total transmit power of the RRHs, subject to the RRHs' individual fronthaul capacity constraints and the users' minimum rate constraints, while taking into account the caching status at the RRHs. Although the problem is non-convex, we propose a Lagrange duality based solution, which can be efficiently computed with good accuracy. We compare the minimum transmit power required by the proposed algorithm with different caching strategies against the case without caching by simulations, which show the significant energy saving with caching.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
