在研究了一些分簇算法基础上，提出基于连通可靠度约束的、适合大规模随机部署的快速成簇算法。仿真表明基于连通可靠度约束的快速成簇算法得到的分簇覆盖面广、簇头分布合理、稳定性强，与最小ID分簇及优化的最大连接数分簇算法相比，得到簇头数量少，分簇更合理，各成员节点与簇头的连通可靠度好，能保证网络的稳定性与健壮性，大大减少重构开销带来的通信代价，有利于均衡网络能量消耗，延长网络生命周期。

This paper proposed a speeding clustering algorithm of connectivity-credibility constrained random dispose which based on some other clustering algorithms. Simulation shows that this algorithm can get large cover of clustering, logical distributing and good stability. Comparing to the lowerst-ID clustering and highest-connectivity clustering algorithm, the algorithm can get less number of cluster-heads, more logical clustering, good communication between nodes and cluster-heads, steady networks, reduce communication cost of rebuilding, and can balance network's energy consume, prolong the networks life.

于继明（1976－），男，河南罗山县人，浙江工业大学讲师，博士，研究方向为计算机网络和通信技术、物联网技术及应用