基于连通可靠度约束的分簇算法研究  

The research of connectivity-credibility restricted clustering algorithm in wireless sensor networks

作　　者：于继明[1,2] 孙亚民[2] 雷艳静[1] 杨余旺[2] 

机构地区：[1]浙江工业大学计算机科学与技术学院,杭州310023 [2]南京理工大学计算机科学与技术学院,南京210094

出　　处：《中国工程科学》2010年第9期73-77,共5页Strategic Study of CAE

摘　　要：在研究了一些分簇算法基础上,提出基于连通可靠度约束的、适合大规模随机部署的快速成簇算法。仿真表明基于连通可靠度约束的快速成簇算法得到的分簇覆盖面广、簇头分布合理、稳定性强,与最小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.

关 键 词：无线自组传感器网 连通可靠度 分簇算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]