检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国家数字交换系统工程技术研究中心,郑州450002
出 处:《计算机应用》2012年第7期1827-1830,共4页journal of Computer Applications
基 金:国家自然科学基金资助项目(61171108)
摘 要:在获取的信道状态信息(CSI)失真且信道快变的情况下,现有分簇方案需要获取全部基站的CSI且不能快速得到簇结构。针对以上问题,提出了一种基于近邻传播(AP)聚类思想的基站群快速分簇方案。该方案只需获取近邻基站间(部分)的CSI,通过近邻基站间协同的平均信干比(SIR)增益来构成稀疏化的相似度矩阵;然后,在近邻基站间进行协同信息的交互、更新,快速生成多个协同簇;最后,以簇合并带来的平均信干比增益大小为依据合并较小规模的簇,从而达到簇规模均匀的目的。仿真结果表明,与完全CSI下的现有分簇方案相比,所提方案不但收敛速度快,而且簇规模较均匀。In the case of Channel State Information(CSI) distortion and channel fast changing,the existing clustering scheme needs to get CSI of all the base stations and generates cluster structure slowly.Concerning the problem,a fast clustering scheme based on Affinity Propagation(AP) algorithm was proposed in this paper.The scheme just needs CSI of neighboring base stations.Firstly,sparse similarity matrix was formed by the average Signal to Interfere Ratio(SIR) of cooperation between neighboring base stations.Then,among neighboring base stations,the interaction and update of collaborative information was done to quickly generate multiple clusters.Finally,the average SIR of cooperation between clusters was normal when the smaller clusters were combined to achieve the purpose of uniform cluster size.The simulation results show that the performance of the proposed scheme is better than the existing scheme in terms of convergence and cluster size uniformity.
分 类 号:TN929.5[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.140.247.39