A new energy-efficient level-based clustering algorithm for wireless sensor networks

Hierarchical clustering algorithms are very important in increasing the networkpsilas life time. In this paper, we developed the previous proposed algorithm EELTC (An Energy-Efficient Level-based and Time-based Clustering algorithm for Wireless Sensor Networks) that is called EELTC-M (modified EELTC). It is a new hierarchical clustering algorithm and has the ability of creating unequal clusters with very low controlling overhead. In our algorithm, all sensors determine their level by receiving a message from the base station. Based on its level and energy each node sets a time to start advertising itself in the network to form clusters. The lengths of levels are determined via mathematical equations based on the energy saved for each cluster. This energy is the difference of energy used by cluster head when using singlehop vs. multihop communication model. Based on this saved energy, the cluster in the next level expands its size to cover some extra nodes instead. The simulation results demonstrate that our proposed clustering approach improves traditional EELTC in network lifetime.