A Time-based Cluster-Head Selection Algorithm for LEACH

A wireless sensor network consists of hundreds or thousands of small energy-limited sensors that are densely deployed in a large geographical region. It has been demonstrated that low-energy adaptive clustering hierarchy (LEACH) is an energy-efficient routing algorithm for wireless sensor networks (WSN). In this paper, we present a Time-based cluster-head selection algorithm for LEACH. We call this new protocol TB-LEACH. We state the principle of TB-LEACH and give the main flowchart and pseudo codes realizing TB-LEACH. We provide a comparison between our protocol and LEACH protocol. 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.