首页> 外文会议>IET International Conference on Communication Technology and Application >A graph-based dynamic coordinated clustering scheme for base station cooperation
【24h】

A graph-based dynamic coordinated clustering scheme for base station cooperation

机译:基于图的基站合作动态协调群集方案

获取原文

摘要

In this paper, a graph-based dynamic coordinated clustering scheme is proposed for base station cooperation (BSC) wireless systems. An interference weighted graph is constructed to assist dynamic coordinated clustering for inter-cell interference mitigating and improving the cell-user performance. The assist graph is constructed with weighted interference value among users, considering the overhead exchange constraint, only 2 bits (1 bit for diversity set judgment, 1 bit for user status) signalling exchange between base stations are needed during the graph constructing. Based on the interference weighted graph, a modified Hungarian algorithm is used for the coordinated clustering. Simulation results show that the proposed scheme can improve the performance of cell-edge users.
机译:在本文中,提出了一种基于图形的动态协调聚类方案,用于基站协作(BSC)无线系统。 构建干扰加权图以帮助用于间小区间干扰的动态协调聚类,并改善小区用户性能。 在图表构造期间,考虑到架空交换约束,在用户之间的加权干扰值构造有加权干扰值,仅考虑开销限制,仅需要2位(用于用于分集的分集判断,1位用户状态)基站之间的信令交换。 基于干扰加权图,修改的匈牙利算法用于协调群集。 仿真结果表明,该方案可以提高细胞边缘用户的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号