论文部分内容阅读
针对LEACH算法不适应节点初始能量不同的WSN和簇头完全随机选择的缺点,提出一种能量分布无关的WSN自适应分簇路由算法。算法思想是:1)节点根据自身剩余能量与网络平均能量比值确定是否竞争簇头;2)控制簇头在网络内平均分布;3)簇内节点与簇头1跳通信,簇头与基站采用最小能量路由协议。仿真结果表明,改进后的算法能使节点的剩余能量趋向相等,从而有效地延长整个网络的生命时间。
Aiming at the fact that the LEACH algorithm is not suitable for the random selection of WSNs and cluster heads with different initial energy, a WSN adaptive clustering routing algorithm with no energy distribution is proposed. The idea of the algorithm is as follows: 1) The node determines whether or not to compete for cluster heads based on the ratio of its own residual energy to the average energy of the network; 2) the average number of control cluster heads distributed within the network; 3) Minimum energy routing protocol The simulation results show that the improved algorithm can make the remaining energy of nodes tend to be equal, so as to effectively extend the life of the entire network.