29-01-2013, 09:55 AM
A Time-based Cluster-Head Selection Algorithm for LEACH
ABSTRACT
In this paper, the author presents a Time-based Cluster-Head Selection Algorithm for LEACH and calls the new protocol TB-LEACH. The implementation of this protocol is figured out by NS2. Simulation results show that our algorithm outperforms original LEACH by about 20% to 30% in terms of system lifetime.
TB-LEACH only modifies the cluster-head selection algorithm of LEACH to improve the partition of cluster. The protocol is designed to ensure that the partition of cluster is balance and uniform. In TB-LEACH, competition for cluster-heads (CHs) no longer depends on a random number as in LEACH, and a random time interval instead. Nodes which have the shortest time interval will win the competition and become cluster heads.
In order to obtain a constant number of cluster-heads, we set a counter. When the number of the counter has reached specified value, nodes no longer continue competition for cluster-heads. Our simulation results show that the TB-LEACH provides the better energy efficiency and the longer network lifetime than the LEACH.