{'fraction_non_alphanumeric': 0.021044427123928292, 'fraction_numerical': 0.0, 'mean_word_length': 5.356435643564357, '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}}
Energy-efficient multicasting in wireless networks with fixed node transmission power

In this work, we propose an energy-efficient multicasting algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is based on the multicost approach and selects an optimal energy-efficient set of nodes for multicasting, taking into account: i) the node residual energies, ii) the transmission powers used by the nodes, and iii) the set of nodes covered. Our algorithm is optimal, in the sense that it can optimize any desired function of the total power consumed by the multicasting task and the minimum of the current residual energies of the nodes, provided that the optimization function is monotonic in each of these parameters. Our optimal algorithm has non-polynomial complexity, thus, we propose a relaxation producing a near-optimal solution in polynomial time. The performance results obtained show that the proposed algorithms outperform established solutions for energy-aware multicasting, with respect to both energy consumption and network lifetime. Moreover, it is shown that the near-optimal multicost algorithm obtains most of the performance benefits of the optimal multicost algorithm at a smaller computational overhead.