论文标题
多用户多用户多端网格的随机缓存设计,干扰
Random Caching Design for Multi-User Multi-Antenna HetNets with Interference Nulling
论文作者
论文摘要
由于以内容为中心的用户关联机制,用户遭受的强大干扰可能是启用缓存网络(CEN)的严重问题。为了解决这个问题,可以使用多端技术进行干扰管理。在本文中,我们考虑了两层多用户多用户多Antenna CEN中以用户为中心的干扰(IN)方案,在宏基站(MBSS)和小型基站(SBS)中具有最受欢迎和随机的缓存策略(SBSS),以提供文件多样性。要求用户范围内的所有干扰SBSS使用零效率的光束形成来抑制此用户的干扰。使用随机几何分析技术,我们得出了面积光谱效率(ASE)的可拖动表达。还获得了ASE上的下限,然后通过优化缓存策略和系数来考虑ASE最大化。为了解决所得的混合整数编程问题,我们设计了一种交替的优化算法,以最大程度地减少ASE的下限。我们的数值结果表明,所提出的缓存策略产生的性能接近最佳,并且优于现有的几个基线。
The strong interference suffered by users can be a severe problem in cache-enabled networks (CENs) due to the content-centric user association mechanism. To tackle this issue, multi-antenna technology may be employed for interference management. In this paper, we consider a user-centric interference nulling (IN) scheme in two-tier multi-user multi-antenna CEN, with a hybrid most-popular and random caching policy at macro base stations (MBSs) and small base stations (SBSs) to provide file diversity. All the interfering SBSs within the IN range of a user are requested to suppress the interference at this user using zero-forcing beamforming. Using stochastic geometry analysis techniques, we derive a tractable expression for the area spectral efficiency (ASE). A lower bound on the ASE is also obtained, with which we then consider ASE maximization, by optimizing the caching policy and IN coefficient. To solve the resultant mixed integer programming problem, we design an alternating optimization algorithm to minimize the lower bound of the ASE. Our numerical results demonstrate that the proposed caching policy yields performance that is close to the optimum, and it outperforms several existing baselines.