{'fraction_non_alphanumeric': 0.017355371900826446, 'fraction_numerical': 0.0008264462809917355, 'mean_word_length': 5.441489361702128, '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}}
Regular Tiling Based Flooding Scheme for Energy Efficiency in Wireless Ad Hoc Networks

Flooding is a fundamental operation in wireless ad hoc networks to propagate control messages in the entire network. The traditional flooding scheme generates excessive packet retransmissions, resource contention, and collisions since every node forwards the packet at least once. Several flooding schemes have been proposed to avoid these problems. However, these unnecessary forwarding nodes remain in these flooding schemes. In this paper, we propose a novel flooding scheme termed Regular Tiling (RT) Based Flooding to efficiently minimize the number of forwarding nodes. It employs a regular tiling method. RT Based Flooding, selects nodes that are located closest to vertices of regular polygon, using location information of 1-hop neighbor nodes, as forwarding nodes. We also provide ideal forwarding models to minimize the number of forwarding nodes and prove that our scheme approaches the ideal model through detailed analysis. Simulation shows that the performance of our scheme outperforms recent noteworthy flooding schemes in terms of the number of forwarding nodes, number of collisions, and delivery ratio.