A dynamic round-time based fixed low energy adaptive clustering hierarchy for wireless sensor networks

Extending the lifetime of energy constrained wireless sensor network is an immense demanding part of research. To attain this goal many research works including low energy adaptive clustering hierarchy (LEACH) and its variants use clustering techniques to reduce energy consumption by dividing the network coverage area into clusters and sending the accumulated information through a representative of each region, known as cluster head. All of these schemes, except fixed LEACH, suffer from the problem of accomplishing huge energy of sensor nodes due to forming repeated cluster at each fixed time interval. Fixed LEACH surmounts the repeated clustering formation problem by forming fixed clusters only once. This scheme, however, still wastes huge energy and incurs loss of information due to premature dead of cluster heads before expiring the fixed round time. The research work in this paper presents a novel dynamic round time based fixed LEACH where round time is determined based on the remaining energy, at the same time special care is taken to avoid the increase of complexity in round time measurement. The proposed scheme, therefore, provides better quality of services by circumventing packet loss periods and lengthens the network life time significantly. Simulation results proved the superior performances of proposed dynamic round time based fixed LEACH compared with the traditional fixed one.