{'fraction_non_alphanumeric': 0.020569620253164556, 'fraction_numerical': 0.0, 'mean_word_length': 5.086538461538462, '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}}
An Uneven Probabilistic Flooding Algorithm for Small-World Wireless Multi-Hop Networks

Concept of small-world is applied in the context of wireless multi-hop networks in this paper. We build a network model by selecting a small part of nodes and magnifying their communication distance. It is proved that this model behaves small-world character, mainly in average path length and clustering coefficient. Based on this model we put forward an uneven probabilistic flooding algorithm. Simulation results show that small-world model outperforms general multi-hop wireless network model greatly in both network coverage and hop count.