基于能量效率的无线传感网络分簇算法  

Energy-efficient Clustering Algorithm for Wireless Sensor Networks

作　　者：樊志平[1,2] 金政哲[2] 谢冬青[1] 

机构地区：[1]广州大学计算机科学与教育软件学院,广州510006 [2]广州大学华软软件学院计算机系,广州510990

出　　处：《小型微型计算机系统》2013年第3期535-539,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(6100322)资助;广东省自然科学基金项目(10451009101004574)资助

摘　　要：由于无线传感网络中传感器节点能量受限,提出基于能量效率的无线传感网络快速分簇算法(EECA),在系统初始化阶段把部署区域快速分成多个簇,随后以权衡节点自身能量消耗比和度作为选择簇头节点的依据,这时候的重新选举簇头节点变成了一种局部触发的行为,由于重新选举簇头节点只在簇内进行,这大大减少了重新选举簇头节点的复杂性和计算负载.理论分析表明EECA簇形成算法的消息和时间复杂度均为O(1),说明算法的开销较小,与网络的规模n无关.仿真实验结果表明EECA具有良好的负载平衡性能和较小的协议开销,与LEACH协议相比,能够减少能量消耗,延长网络生存期.To solve the energy-limited problem of node in the wireless sensor networks(WSN),A fast clustering algorithm Based on the energy efficiency(EECA)has been proposed.When initializing the system,the deployment region is rapidly into multiple clusters.the node energy consumption ratio and degree are chosen as the criterion for cluster head selection,consequently the re-election becomes a cluster head acts locally triggered.Due to range of the re-election is within the cluster,complexity and computation load has been greatly reduced.Theoretical analysis indicates that timing complexity of EECA cluster formation algorithm are O(1),which means the algorithm has nothing to do with the network size n.Simulation results indicate that EECA can provide better load-balancing of cluster heads and less protocol overhead.Comparing with LEACH protocol,RDCA improves the uniformity of energy consumption so that the network lifetime was prolonged.

关 键 词：无线传感网络 分簇 LEACH 簇头节点 

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