Research On Energy Saving Algorithm For Wireless Sensor Network Based On Clustering Routing Protocol

Energy saving is very important in many of the key technologies of wireless sensor networks. LEACH protocol as the first clustering routing algorithm, which with good energy saving features, has great value of research and application. This paper research and improvement the process of the formation of clusters, the mechanism of cluster head election and the way of data transmission in LEACH protocol. The main work is organized as follows:Routing algorithm which based on LEACH exists many drawbacks, such as the remaining energy of the cluster is not considered and the location of the cluster head is unreasonable. In this paper, the EB-LEACH protocol was proposed, it improved energy-balanced clustering routing algorithm based on LEACH, which optimized the condition of clustering, and considered the residual energy and the location of the cluster node, this reasonable clustering scheme can save and balance the whole energy consumption, thus prolong the network survival time. The simulation experiment results also display that the improved method effectively reduce energy consumption, improve the performance of the wireless sensor network.The traditional LEACH protocol needs to broadcast in the whole network in each cluster head election, In order to reduce the broadcast frequency and save energy consumption, the GC-LEACH protocol was proposed which based on the game inside the clusters. In this paper, the small range of broadcast within the clusters was used when electing cluster head instead of the whole network broadcast to improve the way of working of the network. By means of gaming inside the clusters to select the cluster head node, the location of the cluster head became more reasonable and even the energy consumption in data transmission was less. Finally, a contrast experiment was also given and the simulated results indicated that the GC-LEACH protocol is efficient.