首页> 外文会议>International Congress on Signal and Information Processing, Networking and Computers >A graph coloring based resource allocation in Heterogeneous Networks
【24h】

A graph coloring based resource allocation in Heterogeneous Networks

机译:基于图形的异构网络资源分配

获取原文

摘要

This paper proposes a novel resource allocation scheme applying improved graph coloring algorithm in LTE-A Heterogeneous Networks (HetNets). Based on our interference graph, a dynamic orthogonal spectrum sharing between macrocells and femtocells is designed to reduce the cross-tier interference. In proposed scheme, a cost function to quantize resource reuse condition and a resource estimation method are utilized to construct disjoint clusters for all Base Stations (BSs). The cluster-based resource allocation algorithm not only achieve the mitigation of interference to a large extent, but also strike a balance between spectrum reusability and resource requirements. It is demonstrated by simulation that significant performance can be achieved under our proposed scheme.
机译:本文提出了一种在LTE-A异构网络(Hetnets)中应用改进的图形着色算法的新资源分配方案。基于我们的干扰图,宏小区和毫微微小区之间的动态正交频谱共享旨在降低交叉层干扰。在所提出的方案中,利用以量化资源再利用条件的成本函数和资源估计方法来构建所有基站(BSS)的脱编簇。基于群集的资源分配算法不仅在很大程度上实现了干扰的缓解,而且还在频谱可重用性和资源要求之间取得平衡。通过模拟证明,在我们提出的计划下可以实现显着性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号