Research On Clustering Routing Algorithm For Wireless Sensor Networks Based On Energy Consumption Balance

The energy of sensor nodes is limited and nodes batteries are hard to charge,so the energy resources of the network is very precious and the network lifetime becomes an important index to measure the performance of the algorithm.The clustering routing algorithm is one of the hot topics in wireless sensor networks,which can effect ively balance the network energy consumption and prolong the network lifetime.Based on the mechanism of cluster head selection,the mode of cluster building and the selection of inter-cluster routingin the wireless sensor network,this thesis focuses on the energy balance problem of the network.The specific research contents are as follows:1.In this thesis,an uneven clustering algorithm based on dynamic cluster radius is proposed for the "hot spot" region problem in multi-hop transmission by caused the premature death of nodes near the base station.Firstly,the network is divided into hot and non hot regions,and followed by the stratification.Then,with the consideration of node energy balance,the algorithm combines the dynamic competition radius and uneven clustering organically,and considers the residual energy of the node and the position factor of the node in the cluster election,which makes the cluster election more reasonable.Finally,in the multi-hop transmission,the intersection nodes are considered as the relay,which makes the energy of the cluster head more balanced.Simulation results show that the proposed algorithm can effectively alleviate the "hot spot" problem,making the energy between nodes more balanced as well as increaseing the lifetime of the network.2.Aiming at the problem of heavy load of cluster heads in the current clustering routing algorithms,an uneven clustering algorithm for wireless sensor network based on dual cluster head is proposed.Firstly,the algorithm divides the election stage of cluster head into two processes: the master cluster head election and the vice cluster head election.Then,on the basis o f the LEACH algorithm,the algorithm introduces the factorof energy and density to select the master cluster head,and select the vice cluster head by comprehensively considering the distance from the node to the base station,the distance from the node to the cluster head and the remaining energy of the node.Besides,the transmission between clusters are carried out by means of alternate transmission of master and vice cluster heads.Simulation results show that the algorithm can effectively balance the energy consumption and prolong the network lifetime.