基于协同度的基站群利益树动态分簇算法.pdfVIP

第 34 卷第 6 期 电 子 与 信 息 学 报 Vol.34No.6 2012 年 6 月 Journal of Electronics Information Technology Jun. 2012 基于协同度的基站群利益树动态分簇算法 黄开枝* 郑丽清 李 坤 吉 江 (国家数字交换系统工程技术研究中心 郑州 450002) 摘 要：该文针对协同基站群分簇算法缺乏通用模型的问题，提出了一种协同度分簇模型，将系统和容量最大化简 化为协同度最大化。在该模型的指导下，将分簇问题建模为有向带权连通图的利益树生成问题，设计了一种利益树 动态分簇算法。该算法能够并行生成多个规模动态变化的协同簇，克服了传统顺序分簇导致的系统性能受限的问题； 且分簇结果的协同度之和最大，可获得近似最优的分簇性能。仿真结果表明，该算法与传统贪婪搜索算法相比，系 统频谱利用率提高了约 0.4 bit/Hz，且算法复杂度只与基站个数呈线性关系。 关键词：无线通信；分簇；多基站协同；小区间干扰；信道状态信息 中图分类号：TN929.5 文献标识码： A 文章编号：1009-5896(2012)06-1469-07 DOI: 10.3724/SP.J.1146.2011.00674 Benefit-tree Dynamic Clustering Algorithm Based on Degree of Wiliness to Cooperate for Base Station Cooperation Huang Kai-zhi Zheng Li-qing Li Kun Ji Jiang (National Digital Switching System Engineering Technological Research Center, Zhengzhou 450002, China) Abstract: As the existing clustering algorithms are lack of effective guidable clustering model, an Degree of Wiliness to Cooperate (DWC) based clustering model is proposed, in which the clustering objective of maximizing the system sum rate is approximately to maximizing the sum of DWC between every two Base Stations (BS) in system. Based on this, the clustering issue is modeled as constructing benefit-trees of a connected graph with edge costs. Then a benefit-tree dynamic clustering algorithm is proposed. This algorithm simultaneously generates several clusters of dynamic size which could solve the limited-capacity problem caused by conventional orderly clustering scheme. Besides, the maximum sum of DWC in clustering results offers the approximately best system clustering capacity. Simulation res