无线传感器网络簇头优化分簇算法及其性能仿真

Cluster heads optimized clustering algorithm for wireless sensor networks and its performance simulations

基于对LEACH等算法的研究,提出一种传感器网络分簇算法———簇头优化分簇算法。它将节点周期性划分为数个在地理位置上分布均匀的“临时簇”,然后分别在每个临时簇内选择簇头;簇头选择时,遵循保护最低能量节点的原则,即要求所选簇头尽量靠近剩余能量最低的节点。仿真结果表明,与LEACH相比较,该算法能保证簇头较均匀分布在网络中,推迟第一个死亡节点出现的时间,同时也提高了基站接收的数据量。

Based on the study of LEACH, a clustering hierarchy algorithm named cluster heads optimized algorithm was proposed. The algorithm periodically put all nodes into several temporary clusters distributed evenly in geographical position, and then selected a cluster head in every temporary cluster. While selecting the cluster head, the principle of protecting the lowest energy node should be followed, the selected cluster head should be as close as the lowest energy node. Simulation results show that, compared with LEACH, the algorithm can enable the cluster heads to distribute more evenly in the network, postpone the emergency of the first dead node, and increase the number of data received at the base station.