Research and Improvement about LEACH Algorithm for Wireless Sensor Networks

Abstract

In Wireless Sensor Network (WSN), unreasonable node clustering algorithm will inevitably lead to premature death, unawareness of regional information.To address problems of traditional LEACH algorithm, An improved LEACH multi-hop routing algorithm based on Energy Distance Threshold (EDT) is presented. It mainly improves from aspects of cluster number, cluster head selection and inter-cluster communication. The improved clustering hierarchy algorithm considers the nodes Energy Distance Threshold as an important factor in selection then chooses the best cluster head within the area. The selection of cluster head is based on re-select manner, which dynamically and effectively select cluster heads by control cluster number and combing with EDT. After cluster head completes local data fusion and processing, it look for adjacent cluster head as next hop closer to base station with larger EDT if the head is far away from station. The next hop repeats above process till the base station is arrived. Such manner of multi-hop among clusters enables communication among clusters and base stations so as to avoid direct communication between head and station. The method reduces energy consumption and also balances energy. Simulation results show the improved LEACH algorithm has higher energy utilizing rate, and it helps prolong network’s lifetime.