Research On Energy-saving Algorithms For Wireless Sensor Networks Based On Cluster Routing

The energy of wireless sensor is not continuously supplied,but it is limited.Therefore,it is necessary to study the energy saving of the network.For the moment,under the same conditions of equipment,in order to achieve the goal of reducing network energy consumption and extending the overall life span of the network,mainstream solutions at home and abroad are using network protocols to optimize the energy consumption of the network.In many network protocols,the clustering routing protocol is a very effective method at present,whether it is to reduce power consumption or balance load.This article is based on the LEACH protocol,a classical clustering routing protocol.(1)For the LEACH algorithm,the cluster heads have large randomness and non-uniformity.This paper proposes an improved LEACH-N algorithm based on LEACH protocol.In this algorithm,we consider the factors that influence the generation and distribution of cluster heads.At the same time,we introduce the multi choice data transmission mechanism to prolong the network lifetime.Finally,the LEACH-N algorithm is simulated by Matlab.The results show that,compared with the LEACH protocol,it improves the network life to a certain extent.(2)For LEACH-N algorithm,in the network model with a large number of redundant nodes,there is no consideration of the energy waste of redundant nodes.This paper proposes a clustering routing algorithm based on sleep scheduling.Based on the LEACH-N algorithm,a dormancy mechanism is introduced.At the same time,the cluster head competition mechanism is introduced to construct non-uniform clusters to balance the energy consumption between clusters.Finally,simulations are done through Matlab.The results show that in the same experimental scene,the network lifespan is greatly improved compared with the LEACH-N algorithm.(3)For each round of the CRABDS algorithm,it is necessary to waste part of the energy in the planning cluster,set up clustering problems,and the problem of unbalanced energy consumption between clusters caused by fixed rounds of time.A clustering routing algorithm based on adaptive round time is proposed.The algorithm introduces a clustering mechanism and adaptive time,reducing unnecessary energy consumption.Finally,simulations are done through Matlab.The results show that,compared with the LEACH-N algorithm and the CRABDS algorithm,it is further optimized on the network life.