Research Of The Energy Efficient-based Clustered Routing Protocol In Wireless Sensor Networks

With the introduction of the concept of the internet of things,ubiquitous network and smarter planet, Wireless Sensor Networks(WSN) which is an eventful research area of computer science and technology is playing an importment role in their research and development. The development of WSN gradually gets the focus from the industries and academia and has a great application future in the military and civil area. Nowadays, the one of the most popular topic of WSN is routing protocol. The main characteristic of WSN is that the sensor nodes have limited energy, so the first issue we must consider is the effective utilization of energy in order to extend the survival time of the network.This paper first analyses the research of routing protocols in WSN. Then strengths and weaknesses of a variety of routing protocols will be analysed from the present most popular clustered routing protocol. We can conclude that the protocol bases on uneven clustering, uses a mixed cluster head election method, applies the intra-cluster one-hop routing mode and inter-cluster multi-hop dynamic routing can improve the energy effectiveness. In this paper, the classical even clustered routing protocol named LEACH and the typical uneven clustered routing protocols named UCS, EEUC and USCR have been researched and contrasted. The defects of algorithm are identified and the advanced programes are putted forward. On the basis of this research, a novel energy efficient routing algorithm (EERA) is proposed.The EERA focuses on the design of the following five-point:First, the division of the sensing region: the entire region is divided into unequal radial level with the base station at the center to conserve energy in clustering stage.Second, the election standard of cluster head: The node ability to become the cluster head is determined with the consideration of the residual energy and the relative position in order to optimize the choice of the cluster head.Third, routing construction: Multi-hop data routing is formed in inter-cluster. We not only consider the energy consumption of nodes sending datas but also take care of the energy consumption of relay nodes receiving datas for the purpose of inter-cluter routing. The sending distance of the data is limited to the threshold, at the same time, the number of data transmission should be minimized.Fourth, cluster reconstruction strategy: Clustering will be triggered when the data volume of sink node received and the energy of cluster head node exceeds the threshold.Fifth, dynamic routing: At the stage of stable transmission each cluster head using dynamic routing to avoid the relay node rapid death due to excessive energy consumption.In this paper, simulated test of LEACH, EEUC, UCSR and EERA are supplied in three aspects-energy balance of the network, the network lifetime, energy consumption of the whole network by OMNET++. Through the comparative analysis of experimental results, the validity of EERA is verified.