{'fraction_non_alphanumeric': 0.018005540166204988, 'fraction_numerical': 0.0, 'mean_word_length': 5.17948717948718, '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 study of distributed routing path using dynamic density in mobile networks

Mobile ad hoc routing protocols allow frequently exchanging topology. For reducing overhead by topology, hierarchical network algorithms are researched. When load balancing the object node difficult to send message to cluster head node with over-traffic load. To solve these problems, we proposed Load Tolerance using Density-distribution algorithm. This proposed algorithm, the node measures dynamic density using flow in the coverage. Since then we convert the dynamic density to the sum of distance between the nodes in the cluster. As a simulation results, the packet delivery ratio of the proposed algorithm is higher than other algorithm.