{'fraction_non_alphanumeric': 0.020157756354075372, 'fraction_numerical': 0.0, 'mean_word_length': 5.172972972972973, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A new energy-efficient clustering algorithm for Wireless Sensor Networks

In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network's life time. Each clustering algorithm is composed of two phases, the setup phase and steady state phase. The hot point in these algorithms is the cluster head selection. In this paper, we proposed EELTC (an energy-efficient level-based and time-based clustering algorithm for wireless sensor networks), which 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 simulation results demonstrate that our proposed clustering approach is more effective in prolonging the network lifetime compared with EEUC, LEACH.