基于三步簇头竞争机制的分簇算法研究  

Clustering Algorithm Based on Cluster Heads Election by Three Steps

作　　者：王燕[1,2] 张锐[3] 王以忠[3] 

机构地区：[1]天津城市建设学院计算机与信息工程学院,天津300384 [2]天津大学电子信息工程学院,天津300072 [3]天津科技大学电子信息与自动化学院,天津300222

出　　处：《仪表技术与传感器》2013年第4期90-93,共4页Instrument Technique and Sensor

基　　金：国家级星火计划项目(2011GA610008);天津市高等学校科技发展基金计划项目(20110706)

摘　　要：针对无线传感网络分簇算法中可能出现的簇头分布不均匀、节点能量消耗不均衡等问题,提出了一种基于三步簇头竞争机制的分簇算法CHETS(cluster heads election by three steps)。在该算法中,采用LEACH、节点剩余能量、节点密度三步竞争最终簇头。仿真结果表明:该算法增加了网络的稳定工作时间和生命周期,减少了网络节点能量消耗,在有效通信范围内,Sink节点与节点工作区域距离越远,效果更加明显。According to the uneven distribution of cluster heads and energy consumption of network nodes in cluster-based WSN protocols,this paper introduced a clustering algorithm based on cluster heads election by three steps（CHETS）.In this algorithm,the LEACH,the residual energy of node and the density of the nodes are considered in election of final cluster-heads.The simulation shows that with LEACH,the CHETS can improve the stable working time and lifetime of network,and reduce energy consuming of network nodes.The longer the distance between Sink and the nodes workplace is,the more obvious the influence is in the effective communication range.

关 键 词：无线传感器网络 三步簇头竞争 分簇算法 

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