作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2013, Vol. 39 ›› Issue (7): 133-136,141. doi: 10.3969/j.issn.1000-3428.2013.07.030

• 移动互联与通信技术 • 上一篇    下一篇

基于LEACH协议的能耗均衡路由算法

唐甲东,蔡 明   

  1. (江南大学物联网工程学院,江苏 无锡 214122)
  • 收稿日期:2012-06-18 出版日期:2013-07-15 发布日期:2013-07-12
  • 作者简介:唐甲东(1987-),男,硕士,主研方向:无线传感器网络;蔡 明,副教授

Energy-balancing Routing Algorithm Based on LEACH Protocol

TANG Jia-dong, CAI Ming   

  1. (College of Internet of Things Engineering, Jiangnan University, Wuxi 214122, China)
  • Received:2012-06-18 Online:2013-07-15 Published:2013-07-12

摘要: 分析经典的无线传感器网络LEACH协议,针对如何延长其网络生命周期的问题,提出一种改进的LEACH算法。当簇头剩余能量的最小值小于某个阈值时,进行全网簇头选举,设计基于节点相对密度的成簇算法,即采用合理阈值选取簇头。反之进行簇内选举,依据剩余能量、距簇内质心的距离、节点覆盖度等约束条件来选择新的簇内簇头。实验结果表明,改进的LEACH算法能有效降低和均衡各个节点的能耗,推迟第1个死亡节点出现的时间,延长网络的生命周期。

关键词: 无线传感器网络, 低功耗自适应集簇分层型协议, 相对密度, 簇内选举, 剩余能量, 网络生存时间

Abstract: Classical clustering communication protocol of Low Energy Adaptive Clustering Hierarchy(LEACH) in Wireless Sensor Network(WSN) is analyzed. In order to extend the lifetime of network in LEACH, this paper proposes an improved cluster-head election algorithm. If the residual energy of each cluster-head is lower than the given threshold, cluster-head election is done in the whole network. This paper introduces a new strategy based on the relative density of nodes, the selection method of the threshold for electing cluster-head is optimized. If not, the election is done in the cluster, the protocol chooses new cluster-head nodes based on the node’s residual energy, position and dense grade. Experimental results indicate that the improved LEACH algorithm can save and balance the node energy consumption effectively, delay the first node’s death time, and extend the lifetime of network.

Key words: Wireless Sensor Network(WSN), Low Energy Adaptive Clustering Hierarchy(LEACH) protocol, density ratio, election in the cluster, residual energy, lifetime of network

中图分类号: