摘要
以系统和速率最大化为目标,将协同基站群的分簇问题建模为带权连通图的最大利益树生成问题,提出了一种基于协同度的最大利益树分簇算法。定义了利益树的协同度,并选择了协同度最大的两棵利益树进行合并的方式来并行生成多个规模动态的协同分簇,从而解决了传统顺序分簇导致的系统性能受限的问题,提高了系统的分簇性能。仿真结果表明,本算法的系统频谱效率优于现有的动态分簇算法,并且算法为线性复杂度。
Aiming at the objective of maximizing system sum-rate,a benefit-tree clustering algorithm based on maximizing Cooperative Degree（CD） was proposed,where the clustering problem in base station（BS） cooperation system is modeled as constructing benefit-trees of a connected graph with edge costs.The concept of CD between every two benefit-trees was defined,and based on this,the algorithm simultaneously generates some clusters of dynamic size by combining two trees with the maximum CD,which could solve the capacity-limited problem caused by conventional clustering scheme and enhance the system capacity.Results show this algorithm performs better than other existing clustering scheme in the system spectrum efficiency,and the computational complexity is linear.
出处
《计算机科学》
CSCD
北大核心
2012年第1期85-88,91,共5页
Computer Science
基金
国家科技重大项目(2008ZX03003-004)
中国国家基础研究发展计划(2007CB310608)资助
关键词
协同
分簇
小区间干扰
多基站联合处理
Cooperation
Cluster
Inter-cell interference（ICI）
Multi-BS joint processing
