基于能量和距离的非均匀分簇路由算法

Research on non-uniform clustering routing algorithm based on energy and distance

为了提高无线传感器网络的能量效率,提出一种非均匀分簇ONCH-LEACH节能算法。算法引入最优簇头数思想,改进簇头选举概率公式。在综合考虑节点能量、距离、覆盖率的基础上,改进簇头选举阈值公式。根据不同场景的需求,动态引入加权因子。数据传输阶段,提出新的数据分发机制,综合考虑数据量和节点与基站间的距离以及节点的剩余能量,根据路由代价函数选出最优中继节点进行多跳数据传输,从而降低能量消耗。仿真实验表明,所提出的算法能够有效节省网络能耗,延长网络生命周期。

In order to improve the energy efficiency of wireless sensor networks,a non-uniform clustering ONCH-LEACH algorithm is proposed.The idea of optimal cluster head number is introduced,and the probability formula of cluster head election is improved.Based on the comprehensive consideration of node energy,distance and coverage,the clustering head election threshold formula is improved.According to the requirements of different scenarios,dynamic weighting factors are introduced.In the data transmission stage,a new data distribution mechanism is proposed,and the optimal relay node is selected for multi-hop data transmission according to the routing cost function based on the comprehensive consideration of the data volume,the distance between the node and the base station,and the residual energy of the node,thus reducing the energy consumption.The experimental results show that the proposed algorithm can effectively save the energy consumption of the network and prolong the life cycle of the network.