Research And Design Of The Uneven Cluster-based Routing Protocol In Wireless Sensor Networks

Wireless Sensor Networks(WSNs) is a new research area of computer science and technology.With the development in recent years,it gradually gets the focus from the industries and academia and has a great application future in the military and civil area. Nowadays,the most popular topic of WSNs is routing protocol.The biggest characteristic of WSNs 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.In this paper,analyses the research of routing protocols in WSNs at home and abroad.From the present most popular clustering based routing protocol start,detailed comparative analysis strengths and weaknesses of a variety of clustering based routing protocols,concluding that:base on uneven clustering,use a mixed cluster head election method,the intra-cluster one-hop routing mode,dynamic use of inter-cluster multi-hop routing protocol routing the effectiveness of better energy.In this paper,the classical clustering based routing protocol named LEACH and the three different periods of time, the typical uneven clustering based routing protocols named UCS,EEUC and USCR have been researched,identify the defects of algorithm,targeted to improve the program, and on the basis of this research,a novel energy efficient routing algorithm on uneven clustering for sensor networks(EERPUC) was proposed.The EERPUC focused on the design of the following four-point:First,the division of the sensing region:using arithmetic progression the entire region is divided into unequal radial level with the base station at the center,low power to achieve uneven clustering.Second,the election standard of cluster head:improve the previous election methods that only to consider the location of the cluster head such as UCS,or only consider the remaining energy of nodes such as EEUC and USCR.Considering the residual energy of node and their distance from the circle centerline,determine their ability to compete to become cluster head for each node,optimize the choice of the cluster head.Third,routing construction:improved routing algorithm of EEUC,under the premise that routing algorithm than EEUC has no additional cost,for cluster head to build back-up rout so that next hop node that cluster head can choose is a collection, avoid the excessive energy consumption of relay nodes caused by the cluster head use fixed-path data transmission path,balance the network energy consumption.Fourth,algorithm robustness:base station set up reconstruction timer to deal with the accidental death of cluster head,ensure network normally collect and transport data.EERPUC import energy forecasting mechanism,according to the residual energy of node to determine when to re-cluster,in the division of the sensing region,first propose that control the size of cluster to achieve uneven cluster using arithmetic progression.Optimize the choice of the cluster head based on the residual energy and location of nodes.In inter-cluster communications dynamic choose a different back-up rout to balance the network energy consumption.In this paper,simulate LEACH,EEUC,UCSR,EERPUC using tools OMNET ++, from energy balance of the network,the network lifetime,energy consumption of the whole network,collected data of the network four aspects simulation.Comparative analysis of experimental results verify the validity of EERPUC.