基于聚类分解的WCDMA基站布局规划算法  

Planning Algorithm for WCDMA Base Station Location Problem Based on Cluster Decomposition

作　　者：张宏远[1] 谷寒雨[1] 席裕庚[1] 

机构地区：[1]上海交通大学自动化研究所,上海200030

出　　处：《控制与决策》2006年第2期213-216,共4页Control and Decision

摘　　要：针对大规模W CDM A无线网络基站布局规划问题,提出一种基于聚类分解的分层算法.在聚类分解中,以测试点信号增益矩阵构造聚类分解数据,并给出了收敛判定函数和相似度计算方法.在分层算法中,首先用K均值聚类将原问题分解为K个子规划问题,然后对各子问题求解整数规划问题,最后对各子问题的基站布局结果进行全局调整.仿真计算验证了该算法的有效性.An algorithm based on cluster decomposition is presented for large scale WCDMA base station positioning problem. A data matrix based on the signal gain of cellular networks and some criterion functions are designed for K means clustering, In the algorithm, the original problem is firstly decomposed into K sub-problems by K means clustering. Each sub-problem is then solved by integer programming, Finally, the solutions of K sub-problems are coordinated to form an approximate solution of the global problem. Simulation result shows the validity of this algorithm.

关 键 词：WCDMA K均值聚类 无线网络规划 启发武算法 

分 类 号：TN929.5[电子电信—通信与信息系统]