论文部分内容阅读
在低功耗自适应分簇(LEACH,Low Energy Adaptive Clustering Hierarch)算法中,由于每一轮循环都要重新构造簇,距离较远的簇头节点可能会因长距离发送数据而过早耗尽自身能量,能量较低的节点当选为簇头节点时将会加速该节点的死亡,影响整个网络的生命周期。针对LEACH算法分簇机制中存在的不足,提出了一种改进的路由算法。仿真结果表明,改进算法通过考虑节点的剩余能量与固定分簇的方法,有效的改善了网络能量均衡,提高了网络生存时间。
In the Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm, since the cluster is reconstructed in each round of cycle, the cluster head node with a long distance may be prematurely exhausted due to sending data over a long distance Elected nodes with lower energy and lower energy will accelerate the death of the node and affect the life cycle of the entire network. Aiming at the deficiencies in LEACH clustering, an improved routing algorithm is proposed. The simulation results show that the improved algorithm effectively improves the network energy balance and improves the network lifetime by considering the remaining energy of the nodes and the fixed clustering method.