基于LEACH协议的簇头选举改进算法  

Improved Cluster-head Election Algorithm Based on LEACH Protocol

作　　者：廖明华[1,2] 张华[2] 王东[1] 

机构地区：[1]湖南大学计算机与通信学院,长沙410082 [2]湖南财政经济学院信息管理系,长沙410205

出　　处：《计算机工程》2011年第7期112-114,共3页Computer Engineering

基　　金：湖南省自然科学基金资助项目(10JJ5069)

摘　　要：以减小LEACH协议簇形成过程中的能量消耗为目的,提出一种改进的簇头选举算法LEACH-ECHC。当所有簇头的剩余能量最小值小于某个阈值时,进行全网选举;当簇头能量小于该簇剩余能量的平均值时,进行簇内选举,并对簇头产生的阈值进行优化。仿真结果显示,LEACH-ECHC算法有更高的能量有效性,可以延长网络寿命,使节点能耗更均衡。In order to reduce the energy of clustering in Low Energy Adaptive Clustering Hierarchy（LEACH）,this paper proposes an improved cluster-head election algorithm namely Election of Cluster Heads in the Cluster（LEACH-ECHC）.If the residual energy of each cluster-head is lower than the given threshold,cluster-head election is done in the whole network.If the cluster-head＇s residual energy is lower than the average residual energy,the election is done in the cluster.And the selection method of the threshold for electing cluster-head is optimized.Simulation results demonstrate that LEACH-ECHC has better energy efficiency,prolongs network lifetime,and makes node energy consumption more balanced.

关 键 词：无线传感器网络 LEACH协议 簇内选举 剩余能量 距离因子 

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