Cache-enabled heterogeneous cellular networks: Comparison and tradeoffs
Cache-enabled heterogeneous cellular networks: Comparison and tradeoffs
复制标题
DOI：
10.1109/icc.2016.7510749
复制
发表时间：
2016-02
期刊：
影响因子：
--
通讯作者：
Dong Liu;Chenyang Yang
中科院分区：
文献类型：
--
作者：
Dong Liu;Chenyang Yang
在基站（BS）处缓存流行内容是释放蜂窝异构网络（HetNet）潜力的有希望的方式，其中回程已成为瓶颈。在本文中，我们比较了高速缓存使能的HetNet，其中一层多天线宏BS被具有高速缓存但没有回程的一层帮助节点覆盖，与传统的HetNet，其中宏BS层被具有有限容量回程的一层皮科BS覆盖。我们利用随机几何理论推导了这两种HetNet的面积谱效率，并在一种特殊情况下得到了封闭形式的表达式。我们使用数值结果表明，助手密度只有1/4的皮科BS密度，以实现相同的目标ASE，和助手密度可以通过增加缓存容量进一步降低。在给定的总缓存容量的区域内，存在一个最佳的助手节点密度，最大化ASE。
Caching popular contents at base stations (BSs) is a promising way to unleash the potential of cellular heterogeneous networks (HetNets), where backhaul has become a bottleneck. In this paper, we compare a cache-enabled HetNet where a tier of multi-antenna macro BSs is overlaid by a tier of helper nodes having caches but no backhaul with a conventional HetNet where the macro BSs tier is overlaid by a tier of pico BSs with limited-capacity backhaul. We resort stochastic geometry theory to derive the area spectral efficiencies (ASEs) of these two kinds of HetNets and obtain the closed-form expressions under a special case. We use numerical results to show that the helper density is only 1/4 of the pico BS density to achieve the same target ASE, and the helper density can be further reduced by increasing cache capacity. With given total cache capacity within an area, there exists an optimal helper node density that maximizes the ASE.