首页> 中文期刊> 《电子学报》 >一种基于LEACH协议的改进算法

一种基于LEACH协议的改进算法

         

摘要

作为能量有效、基于层次结构的路由协议的典型代表,LEACH协议存在的不足表现为网络中会出现极大簇和极小簇并存;当节点能量不同时簇头选择不合理;在簇头死亡后簇内节点仍会消耗能量.本文基于LEACH提出了一种改进算法,使用引入簇成员数门限和合并极小簇的方法避免极大簇和极小簇同时存在;通过对簇头能量消耗的估计,在簇头能量耗尽前使成员节点休眠来减少节点能量浪费.分析和仿真结果表明,改进后的算法在平衡节点能量和延长网络寿命方面具有更优越的性能.%As a representative of hierarchy-based protoco1 in wireless sensor network, LEACH is an elegant solution for energy efficiency. However,LEACH still has some deficiencies such as the great cluster and small cluster coexist; unreasonable cluster head selection while the nodes have different energy;the node still consumes energy after the death of the cluster head. We propose a new energy-efficient LEACH-based protocol that employed cluster member threshold and merged the tiny cluster to avoid the great cluster and small cluster existing at the same time; estimated cluster head's energy to reduce unnecessarv energy consumption. Analysis and simulation results show that our proposed algorithm provides more uniform energy consumption among nodes and can prolong network lifetime compared to LEACH.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号