论文部分内容阅读
由于无线传感器节点的能量是有限的,如何延长节点和网络的工作寿命成为一个很关键的问题。LEACH算法采用本地簇头随机轮转机制将能量负载分担给网络中的所有传感器节点,但是,簇头选举的随机性和簇内节点数目的不均衡可能导致某些节点过快耗尽能量而死亡。本文提出了一种基于负载均衡的簇头选举方案,采用粒子群优化(PSO)算法先行分簇,然后考虑能量和距离再推举出簇头。仿真结果表明,该算法比LEACH更有效地平衡了能量消耗,并显著延长了网络的存活时间。
As the energy of wireless sensor nodes is limited, how to prolong the working life of nodes and networks becomes a crucial issue. The LEACH algorithm uses a local cluster head random rotation mechanism to share the energy load with all the sensor nodes in the network. However, the randomness of the cluster head election and the imbalance of the number of nodes in the cluster may cause some nodes to die out of energy quickly. In this paper, a cluster head election scheme based on load balancing is proposed. Particle swarm optimization (PSO) algorithm is used to prioritize the cluster heads, and then the cluster heads are deduced considering the energy and distance. The simulation results show that the proposed algorithm balances the energy consumption more effectively than LEACH and significantly prolongs the survival time of the network.