{'fraction_non_alphanumeric': 0.017745302713987474, 'fraction_numerical': 0.0, 'mean_word_length': 5.3933333333333335, '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}}
Uneven clustering routing algorithm for Wireless Sensor Networks based on ant colony optimization

In order to make good use of the limited energy, ant colony optimization (ACO) was applied to inter-cluster routing mechanism. An uneven clustering routing algorithm for Wireless Sensor Networks (WSNs) based on ant colony optimization (ACO) was proposed. The algorithm utilized the dynamic adaptability and optimization capabilities of the ant colony to get the optimum route between the cluster head. Meanwhile, it organized different cluter in different size based on the distance between cluster heads and sink node, and cluters closter to sink had smaller sizes than those farther away from the sink, thus the closer cluster heads could preserve energy for the inter-cluster data forwarding. Simulation result indicates that the algorithm effectively balances the network energy comsuption and prolongs the network life cycle compared with LEACH and PARA.