{'fraction_non_alphanumeric': 0.010869565217391304, 'fraction_numerical': 0.0, 'mean_word_length': 5.084905660377358, '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}}
Subnets based distributed data-centric hierarchical ant routing for sensor networks

In this paper, a novel routing algorithm is proposed in which the nodes are clustered into different subnets by their geographical location, and a node with maximum surplus energy is selected as the core node in every subnet. The core node set routes for sensor data by using ant algorithm, which needs only local information to find the optimal path to the sink node distributedly. Analysis and simulation results demonstrate that this new algorithm is of better routing performance for sensor networks compared with previous algorithms such as AC and GITDC.