严斌亨, 刘军. 一种基于正六边形网格的LEACH协议改进[J]. 微电子学与计算机, 2016, 33(8): 97-101.
引用本文: 严斌亨, 刘军. 一种基于正六边形网格的LEACH协议改进[J]. 微电子学与计算机, 2016, 33(8): 97-101.
YAN Bin-heng, LIU Jun. An Improved LEACH Protocol Based on Hexagonal Grid[J]. Microelectronics & Computer, 2016, 33(8): 97-101.
Citation: YAN Bin-heng, LIU Jun. An Improved LEACH Protocol Based on Hexagonal Grid[J]. Microelectronics & Computer, 2016, 33(8): 97-101.

一种基于正六边形网格的LEACH协议改进

An Improved LEACH Protocol Based on Hexagonal Grid

  • 摘要: 针对LEACH协议中存在的节点簇头选举不合理、能量消耗不均衡以及监测得到的数据冗余现象较为严重的问题, 结合虚拟单元格的思想, 提出一种基于正六边形网格的新型路由协议LEACH-HG.该协议采用虚拟单元格来划分整个监测区域, 并在各个网格中选取活跃工作节点作为候选簇头节点, 同时考虑节点能量和单元格存活节点的数量, 使得簇头选举更为合理.仿真实验结果表明, 改进后的LEACH-HG协议较之于LEACH协议, 能够有效均衡整个网络节点能耗, 提高网络生存周期.

     

    Abstract: Combined with the virtual cell ideology, a new energy efficient routing protocol of LEACH is proposed in the paper, which is based on the question of numerous redundancies with data collecting in nodes, unreasonable of the cluster head election and imbalance of energy consumption in LEACH protocol. The protocol adopts the virtual cell to divide the whole monitoring area, and select active work node as the candidate cluster head nodes in each grid. It gives full consideration of surplus energy and survival number of nodes in the cell to elect the cluster. Simulation results show that this improved routing protocol better than LEACH protocol on the cluster-head nodes selection, and it can extend the survival time of the network, and makes the energy consumption more balanced.

     

/

返回文章
返回