The Research On Energy Efficient Uneven Clustering Routing Algorithm For WSN

With the rapid development of communication technology and embedded computer technology,miniature sensors have been widely appeared in the world.The wireless sensor networks(WSN)are composed of a large number of sensor nodes.Through mutual cooperation the sensor nodes collect the valid data that is needed by the users in the monitoring area.Wireless sensor networks is widely used in civil and military fields.It changes the way how people interact with physical world in their everyday life.However,the sensor nodes have limited computational capability,energy supply and storage information capacity,which limit the development of WSN in a certain extent.Energy-efficient routing protocols are necessary to achieve existing or potential applications of sensor networks.In the design of routing protocols for wireless sensor networks,many factors should be considered.Thereby,this paper researches on how to reduce energy consumption and prolong the network lifetime in the routing protocol.This paper is organized as follows:(1)We present the research background and research status of wireless sensor networks,and also,analyzes its main features and its application prospects.(2)We introduce the communication protocol stack,analyze the classical routing protocol and then,summarize the factors influencing the design of wireless sensor network routing protocol.(3)In terms of cluster-head election optimization,considering the problem of "hot zone" and the residual energy of nodes,a new uneven clustering routing algorithm with the optimal cluster heads(LEACH-TOCH)has been proposed.Infer the number of the optimal cluster heads and bring the network convergence in our algorithm.The number of cluster heads change with the number of network nodes which ensures the number of cluster heads optimal.In addition,considering the residual energy of the nodes,the formula of threshold in LEACH algorithm has been optimized.The algorithm selects the cluster heads or transfer nodes according to their own characteristics.In order to effectively solve load imbalance problem,we select the transfer nodes in the "hot zone".In the remaining area,our proposed algorithm selects the cluster heads based on the residual energy of node and threshold.,and the other nodes that cannot be cluster heads join the nearest cluster to complete the process of clustering.Thus,the network is divided into clusters with different size.Finally,in the data transfer stage,the ordinary nodes send data through the single-hop routing,and the cluster heads send data through the multi-hop routing.The simulation results show that the algorithm is effective to reduce the energy consumption and improve the lifetime of wireless sensor network.(4)For high-efficiency energy in wireless sensor network,this paper proposed an energyefficient uneven clustering routing algorithm(HEEUC).Considering the optimal cluster radius,the algorithm improves the campaign rules in EEUC algorithm to solve the load imbalance problem.In the high density network,the low energy nodes are determined for the redundant nodes which change into the dormant period.After the cluster formation stage,based on spatial correlation and time correlation,sensor nodes with the same information will be in the same cluster.So we select the representative nodes from them to report their information.Decreasing the frequency of clustering reduce energy consumption in the improved algorithm.Simulation results show that the algorithm improve the performance of the sensor network and prolong the life cycle of the network.