论文标题
动态GNODEB睡眠控制5G无线电访问网络
Dynamic gNodeB Sleep Control for Energy-Conserving 5G Radio Access Network
论文作者
论文摘要
5G无线电访问网络(RAN)由于GNODEBS(GNBS)的密度部署和更高的单人GNB功耗而消耗的能量要比Legacy运行更多。为了实现能源持续的运行,本文开发了动态的开关开关范式,可以根据相关用户的发展来动态配置GNB的ON/OFF状态。我们为Markov决策过程(MDP)制定动态睡眠控制,并分析各种切换策略以减少能量消耗。最小化能源支出的MDP的最佳政策可以从动态编程中得出,但计算很昂贵。为了解决这个问题,本文提出了GNB睡眠控制的贪婪政策和指数政策。如果对可以关闭的GNB的数量没有限制,我们就会证明贪婪政策的双阈值结构,并通过最佳政策分析其联系。受双重阈值结构和小指数的启发,我们通过将原始MDP解耦为多个一维MDP来制定指数政策 - 已证明了脱钩的MDP的索引性,并提出了计算索引的算法。广泛的仿真结果验证了指数策略在GNB群集的能源消耗方面表现出几乎最佳的性能。另一方面,就计算复杂性而言,索引策略比最佳策略效率要高得多,最佳策略在GNB的数量较大时在计算方面非常刺激。
5G radio access network (RAN) is consuming much more energy than legacy RAN due to the denser deployments of gNodeBs (gNBs) and higher single-gNB power consumption. In an effort to achieve an energy-conserving RAN, this paper develops a dynamic on-off switching paradigm, where the ON/OFF states of gNBs can be dynamically configured according to the evolvements of the associated users. We formulate the dynamic sleep control for a cluster of gNBs as a Markov decision process (MDP) and analyze various switching policies to reduce the energy expenditure. The optimal policy of the MDP that minimizes the energy expenditure can be derived from dynamic programming, but the computation is expensive. To circumvent this issue, this paper puts forth a greedy policy and an index policy for gNB sleep control. When there is no constraint on the number of gNBs that can be turned off, we prove the dual-threshold structure of the greedy policy and analyze its connections with the optimal policy. Inspired by the dual-threshold structure and Whittle index, we develop an index policy by decoupling the original MDP into multiple one-dimensional MDPs -- the indexability of the decoupled MDP is proven and an algorithm to compute the index is proposed. Extensive simulation results verify that the index policy exhibits close-to-optimal performance in terms of the energy expenditure of the gNB cluster. As far as the computational complexity is concerned, on the other hand, the index policy is much more efficient than the optimal policy, which is computationally prohibitive when the number of gNBs is large.