首页> 外文期刊>Physical Communication >A two-timescale graph-based resource allocation scheme combing dynamic eICIC in Heterogeneous Networks
【24h】

A two-timescale graph-based resource allocation scheme combing dynamic eICIC in Heterogeneous Networks

机译:异构网络中结合动态eICIC的基于两尺度图的资源分配方案

获取原文
获取原文并翻译 | 示例
           

摘要

Heterogeneous Network (HetNet) has been viewed as an effective way to meet the tremendous growth of mobile traffic, in which the cross-tier and co-tier interference are the key limitations. Most of the traditional interference management strategies only focus on addressing either cross-tier interference or co-tier interference. We in this paper propose a resource allocation scheme to systematically cope with both of them in Orthogonal Frequency Division Multiple Access (OFDMA)-based HetNets. Specifically, the proposed scheme combines the dynamic enhanced inter-cell interference coordination (eICIC) and orthogonal resource allocation (ORA), to eliminate the cross-tier and co-tier interference respectively. Furthermore, with tracking the real-time variations of the user information (e.g., locations or service requirements), the proposed scheme is separated into two timescales. At the large timescale, a centralized strategy is performed to roughly allocate resource blocks (RBs) to cells; at the small timescale, a distributed strategy is performed to further schedule RBs among users. Also, we formulate two optimization problems to maximize the minimum of users’ throughput satisfaction rate (TSR) for our proposed scheme, followed by two graph-based algorithms to solve them with low complexity. Simulation results manifest the superiority of our proposed scheme in guaranteeing the fairness of users’ TSR.
机译:异构网络(HetNet)被视为满足移动流量巨大增长的一种有效方法,其中跨层和同层干扰是关键限制。大多数传统的干扰管理策略仅专注于解决跨层干扰或同层干扰。我们在本文中提出了一种资源分配方案,以在基于正交频分多址(OFDMA)的HetNets中系统地应对它们。具体而言,该方案结合了动态增强的小区间干扰协调(eICIC)和正交资源分配(ORA),分别消除了跨层干扰和同层干扰。此外,通过跟踪用户信息(例如,位置或服务要求)的实时变化,将所提出的方案分为两个时间尺度。在较大的时间尺度上,执行集中化策略以将资源块(RB)粗略分配给小区。在较小的时间尺度上,执行分布式策略以在用户之间进一步调度RB。此外,我们针对提出的方案制定了两个优化问题以最大程度地降低用户的吞吐量满意率(TSR),然后提出了两种基于图的算法以较低的复杂度解决它们。仿真结果证明了我们提出的方案在保证用户TSR公平性方面的优越性。

著录项

  • 来源
    《Physical Communication》 |2018年第8期|191-202|共12页
  • 作者单位

    State Key Laboratory of Integrated Service Networks (ISN), School of Telecommunications Engineering, Xidian University;

    State Key Laboratory of Integrated Service Networks (ISN), School of Telecommunications Engineering, Xidian University;

    State Key Laboratory of Integrated Service Networks (ISN), School of Telecommunications Engineering, Xidian University;

    State Key Laboratory of Integrated Service Networks (ISN), School of Telecommunications Engineering, Xidian University;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Heterogeneous Network (HetNet); Resource allocation; Timescale; Throughput satisfaction rate (TSR); Graph-based;

    机译:异构网络(HetNet);资源分配;时间尺度;吞吐量满足率(TSR);基于图;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号