论文部分内容阅读
经典的LEACH算法使用概率选举簇头,该概率并未关联节点剩余能量和网络拓扑,使得选举产生的簇头并不合理.指出了LEACH所存在的几个问题,综合节点剩余能量和邻居数,提出一种确定性混合分簇算法(DHCA:Deterministic Hybrid Clustering algorithm).在NS2下的仿真结果表明,新提出的算法产生的拓扑更加合理,达到了均衡节点能量消耗的目的,提高了节能效率,延长了网络生存时间.
The classical LEACH algorithm uses the probability to select the cluster head, which does not correlate the residual energy and network topology of the node, which makes the cluster head elected not to be reasonable. Several problems existing in the LEACH are pointed out. By combining the residual energy of neighbors and the number of neighbors, A deterministic hybrid clustering algorithm (DHCA) is proposed.The simulation results under NS2 show that the topology proposed by the new algorithm is more reasonable and achieves the purpose of balancing the energy consumption of the nodes and improves the energy efficiency, Extend network life time.