首页> 外文期刊>IEEE communications letters >Joint User Association and eICIC for Max–Min Fairness in HetNets
【24h】

Joint User Association and eICIC for Max–Min Fairness in HetNets

机译:联合用户协会和eICIC在HetNets中实现最大最小公平

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

摘要

In heterogeneous networks, an enhanced intercell interference coordination (eICIC) via almost blank subframes (ABS) is introduced to reduce the interference from macrocells to the users locating at the edge of small cells. In this letter, we formulate the user association and ABS ratio issues jointly as a network-wide max–min fairness optimization problem which turns out to be NP-hard. To overcome this difficulty, the problem is decomposed into two subproblems. First, we solve the optimal ABS ratio problem for given user association and second, maximize network utility through user association. Further, a low-complexity greedy algorithm is proposed based on the marginal utility. The effectiveness of our algorithm is corroborated by the results from numerical evaluation.
机译:在异构网络中,通过几乎空白的子帧(ABS)引入了增强的小区间干扰协调(eICIC),以减少宏小区对位于小小区边缘的用户的干扰。在这封信中,我们将用户关联和ABS比率问题共同表述为网络范围内的最大-最小公平性优化问题,事实证明这是NP难题。为了克服这个困难,该问题被分解为两个子问题。首先,我们解决了给定用户关联的最佳ABS比率问题,其次,通过用户关联最大化网络实用性。此外,提出了一种基于边际效用的低复杂度贪婪算法。数值评估的结果证实了我们算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号