{'fraction_non_alphanumeric': 0.03529411764705882, 'fraction_numerical': 0.013445378151260505, 'mean_word_length': 4.984924623115578, '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}}
Adaptive Technique for Tree-based Multicasting in Wireless Ad Hoc Networks

In this paper, we study the problem of constructing source-based energy-efficient multicast trees in Wireless Ad hoc NETwork (WANET). We propose a distributed algorithm S-REMiT which refines an existing multicast tree into a more energy-efficient multicast tree through local refinements. S-REMiT algorithm uses the forwarding cost (the power expend in forwarding multicast messages to the children) to locally refine a tree so as to improve the total power cost (TPC) of the tree. S-REMiT algorithm permits simultaneous refinements while ensuring deadlock free. Although S-REMiT can refine the energy-efficiency of any input tree, empirical results indicate that the use of minimum spanning tree (MST) as an initial solution leads to the most energy-efficient multicast trees (i.e. the lowest TPC) for Wireless LAN radio and Mica2 Mote radio, respectively. Our qualitative analysis and NS-2 simulations show that S-REMiT performs 10% to 50% better than other proposed algorithms such as BIP/MIP, MST and EWMA algorithms using different MAC protocols (802.11, 802.11MX and SMAC) with similar packet delivery ratio.