基于LEACH路由协议的多跳节能路由算法

Routing Algorithm of Multi-Hop And Energy-Saving Based on LEACH Routing Protocol[HS)]

摘要:

当无线传感器网络部设在不同环境中时,需要提出新的算法以适应特殊环境,减少节点能量消耗;算法针对LEACH路由算法的局限性,提出了一种适用网络覆盖范围较大,节点间距离较远,需要远距离传输的路由算法;本算法利用节点到基站的距离因素,修改簇头阈值信息;并利用簇头竞争重新设定簇头,使剩余能量较高的节点成为簇头;同时,运用多跳的方式传输数据,这样可以适应远距离传输;仿真结果表明,相对LEACH算法,算法将节点死亡时间推后了300~400轮,网络存活周期延长了400轮左右,很明显的减少了网络的能量消耗,延长了网络的生存周期和稳定性。

Abstract:

When the wireless sensor network is laid in different environments, a new algorithm should be proposed to adapt to the special environment and reduce the energy consumed by each node. In this paper, a new routing algorithm is proposed aim at the LEACH routing algorithm . The algorithm can be used in the situation of large-coverage, long distance between the nodes and the transmission of long distance. The algorithm makes full use of the distance between the node and the base station to modify the cluster threshold information. Then it can reset the cluster using the cluster competition and the node with high residual energy becomes the cluster head. At the same time, the use of multiple hops to transmit data can adapt to long distance transmission. The simulation shows that, relative to LEACH algorithm, the death time of nodes will be delayed for 300-400 rounds in this algorithm. The network live cycle extended survival period of about 400 rounds. Obviously, it reduces the network energy consumption and prolongs the network life cycle and stability. 