RELISH: Green Multicell Clustering in Heterogeneous Networks with Shareable Caching
RELISH: Green Multicell Clustering in Heterogeneous Networks with Shareable Caching
复制标题
DOI：
10.1109/glocom.2018.8647258
复制
发表时间：
2018-12
期刊：
影响因子：
--
通讯作者：
Yi-Han Chiang;W. Liao;Yusheng Ji
中科院分区：
文献类型：
--
作者：
Yi-Han Chiang;W. Liao;Yusheng Ji
由于全球变暖的不断恶化，蜂窝系统中的节能变得越来越重要。异构网络（HetNet）可以实现节能，这要归功于小型基站（BS）的较低操作和发射功率消耗。为了解决小区间干扰问题，同时实现网络节能，促进BS休眠和协作多点（CoMP）集群的绿色多小区集群为未来的绿色HetNet铺平了道路。为了进一步减轻由来自用户的内容请求引起的回程功率消耗，以可共享的方式在BS处缓存流行内容被认为是可行的解决方案。在本文中，我们研究了绿色多细胞集群的HetNets与共享缓存（RELISH）的问题，并显示其NP-困难。通过观察基站休眠在RELISH问题中的枢纽作用，提出了先分簇后缓存的策略来分解RELISH问题，并设计了求解子问题的双升簇算法和零副本缓存算法.仿真结果表明，我们提出的解决方案是有效的，在降低总功耗，我们还显示了如何节省功率随系统参数。
Energy saving in cellular systems is increasingly important due to the ever- deteriorating global warming. Heterogeneous networks (HetNets) can attain energy savings thanks to the lower operational and transmit power consumption of small base stations (BSs). To address inter-cell interference problem yet achieving network energy conservation, green multicell clustering facilitating BS sleeping and coordinated multipoint (CoMP) clustering paves a way toward future green HetNets. To further alleviate the backhaul power consumption induced by content requests from users, caching popular contents at BSs in a shareable manner is regarded as a viable solution. In this paper, we investigate the problem of green multicell clustering in HetNets with shareable caching (RELISH), and show its NP-hardness. By observing that BS sleeping plays a pivoting role in the RELISH problem, we propose the clustering- then-caching strategy to decompose the RELISH problem, and then design the dual- ascending clustering algorithm followed by the zero-replica caching algorithm for solving the sub-problems. The simulation results demonstrate that our proposed solution is effective in reducing total power consumption, and we also show how the power savings vary with system parameters.