%0 Journal Article
%T Partial CSI based affinity propagation dynamic clustering algorithm<br>一种部分CSI下的近邻传播动态分簇算法
%A RAN Xiao-min
%A TONG Min
%A MO You-quan
%A <br>冉晓旻
%A 童　珉
%A 莫有权
%J 计算机应用研究
%D 2013
%I 
%X The precondition of whole channel state information (CSI) is impractical in realistic systems. To deal with this problem, this paper proposed a partial CSI based affinity propagation dynamic clustering algorithm. This algorithm used degree of wiliness to cooperate (DWC) to design the input matrix and introduced a cooperation fact to adjust the number of clusters in clustering results. Assuming every BS had the partial CSI information of whole system, during every iteration rounds, it propagated the messages of responsibility and availability to accumulate the coordination incidences among BSs. After that, it constructed several clusters of dynamic size. Simulation results show that the capability of this scheme is almost as same as the whole CSI based benefit-tree clustering algorithm. And the convergence iteration rounds increase slowly as the system size enlarging. This exhibits high convergence speed and is well suited for implementation in realistic system.
%K 协同度
%K 动态分簇
%K 信道状态信息
%K 近邻传播
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=DD8ECC43358E540D5DC9D438E3A9111C&yid=FF7AA908D58E97FA&vid=340AC2BF8E7AB4FD&iid=E158A972A605785F&sid=BE14F47B38DC36BB&eid=BAEC9CADFE1F0CCC&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=18