{'fraction_non_alphanumeric': 0.012560386473429951, 'fraction_numerical': 0.0, 'mean_word_length': 5.556962025316456, '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}}
Optimization of clustering probability of LEACH protocol for lifetime maximization of Wireless Sensor Networks

Wireless Sensor Networks are extremely power constrained due to limited battery backup of individual sensor node. Because energy is a scarce resource, it should be conserved as much as possible. For better lifetime of network various energy saving protocols have been proposed. An energy efficient clustering protocol called Low Energy Adaptive Clustering Hierarchy (LEACH) is in trend. Although LEACH Protocol ensures sufficient lifetime improvement as compared to old traditional schemes, still there are some areas of improvement remaining untouched like optimum number of cluster-heads should be determined prior to implementation and the residual energy of nodes must be considered while selecting next cluster-head. In the present paper both of these aspects have been considered. Simulation results produced at the end replicate the improvement in network lifetime and thus prove the superiority of proposed schemes.