{'fraction_non_alphanumeric': 0.01881188118811881, 'fraction_numerical': 0.0039603960396039604, 'mean_word_length': 5.39873417721519, '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 Density and Distance based Cluster Head Selection algorithm in Sensor Networks

Sensor Networks consist of massively distributed, small devices that have some limited sensing, processing, and communication capabilities. Due to the design of the topology of Sensor Networks, supporting energy-efficient routing protocol in the sensor networks is a challenging task. In this paper, we propose a Density and Distance based Cluster Head Selection (DDCHS) algorithm. The proposed algorithm divides cluster area into several perpendicular diameters, and then selects cluster head by the density of member nodes and the distance from cluster head. The simulation experiments shows that DDCHS algorithm has improves the network lifetime about 50% better than LEACH and about 10% better than HEED. From the results, considering node density and the distance from cluster head in sensor networks can be more energy-efficient than considering only the distance between nodes in energy usage of Wireless Sensor Networks.