An Efficient Clustering Routing Protocol Based On LEACH-EE-PRIM-LEACH

With the rapid development of semiconductor technology, micro system technology, communications technology and computer technology, the applications of wireless sensor networks has become more and more widespread, its research has become an important topic. Wireless sensor network has its own characteristics:First, Energy of the network is limited. So it is the essence problem to realize energy saving. Second, it is based on data centric routing. And it is always necessary to aggregate data locally.For wireless sensor network has so many differences from traditional wireless network, it is necessary to study special communication protocol for it. Based on LEACH-EE and PRIM algorithm, this paper proposes the minimum spanning tree routing protocol. The protocol selects the cluster heads with several factors, including the residual energy of nodes and the distance between nodes and the base station, and it optimizes cluster-heads data transmission path, thereby reducing the consumption of energy, optimizing energy load in WSN, and prolonging the network lifetime.The paper first introduces the concept, characteristics and application scope of the wireless sensor networks, etc. followed by the introduction and analysis of the current popular routing protocol. And then the paper placed upon the introduction of a new proposed routing protocol, used MATLAB to compare PRIM-LEACH with LEACH and LEACH-EE protocol, described the experimental process and analyzed the experimental result and verified the effectiveness of the protocol on balancing the node energy consumption and extending the network life time.