{'fraction_non_alphanumeric': 0.017356475300400534, 'fraction_numerical': 0.0013351134846461949, 'mean_word_length': 5.14344262295082, '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}}
Minimum-Energy Broadcasting in Wireless Networks Using a Single Broadcast Tree

We address the minimum-energy broadcast problem in wireless networks, so that all broadcast requests initiated by different source nodes take place on the same broadcast tree. Our approach differs from the most commonly used one, where the determination of the broadcast tree depends on the source node, thus resulting in different tree construction processes for different source nodes. Using a single broadcast tree, simplifies considerably the tree maintenance problem and allows scaling to larger networks. We first show that, using the same broadcast tree, the total power consumed for broadcasting from a given source node is at most twice the total power consumed for broadcasting from any other source node. We next develop a polynomial-time approximation algorithm for the construction of a single broadcast tree. The performance analysis of the algorithm indicates that the total power consumed for broadcasting from any source node is within 2H(n− 1) from the optimal, where n is the number of nodes in the network and H(n) is the harmonic function. This approximation ratio is close to the best achievable bound in polynomial time. We also provide a useful relation between the minimum-energy broadcast problem and the minimum spanning tree, which shows that the latter may be a good candidate in sparsely connected networks. The performance of our algorithm is also evaluated numerically with simulations.