论文部分内容阅读
传统的低功耗自适应集簇分层型协议(LEACH)算法在选择簇首时未能考虑到节点剩余能量对网络寿命的影响,使得簇首分布不够合理。为了克服该问题,在完全分布式成簇算法(HEED)协议的基础上,设计了一种根据节点剩余能量选择簇首的算法。在该算法中,剩余能量越大的节点越有可能成为簇首,进而承担更多数据传输责任,能量消耗更加平均,增强了算法的健壮性。仿真结果证实,提出的算法可以有效提高网络能量的使用效率,减少功耗,延长网络生存时间。
The traditional Low Power Adaptive Clustering Hierarchical Protocol (LEACH) algorithm fails to consider the influence of node residual energy on the network lifetime when the cluster head is selected, which makes the cluster head distribution not reasonable. In order to overcome this problem, based on the fully distributed clustering algorithm (HEED) protocol, an algorithm is proposed to select the cluster heads based on the remaining energy of nodes. In this algorithm, the node with larger residual energy is more likely to become cluster head, which in turn takes more responsibility of data transmission and more energy consumption, which enhances the robustness of the algorithm. The simulation results show that the proposed algorithm can effectively improve the network energy efficiency, reduce power consumption and prolong network lifetime.