{'fraction_non_alphanumeric': 0.017985611510791366, 'fraction_numerical': 0.0, 'mean_word_length': 5.4728682170542635, '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}}
Hierarchical on-demand routing for self-organized networks

Self-organized network is a multi-hop temporary autonomous system of mobile nodes equipped with wireless transmitters and receivers without the aid of any current network infrastructure. In such an environment, it may be necessary for one mobile node, in order to communicate with another node, to have a chain of intermediate nodes to forward packets due to the limited propagation range of each mobile node's wireless transmission. The conventional routing protocols can not adapt well to such an environment. This paper analyzes the characteristics of the routing protocol of self-organized network, proposes a hierarchical on-demand routing protocol and summarizes the comparison results from the simulation between the protocol and other conventional routing protocols.