{'fraction_non_alphanumeric': 0.024, 'fraction_numerical': 0.0016, 'mean_word_length': 5.3232323232323235, '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}}
A Novel Energy Efficient Broadcast Leader Election

We introduce a new algorithm to achieve a distributed leader election in a broadcast channel that is more efficient than the classic Part-and-Try algorithm. The algorithm has the advantage of having a reduced overhead log logN rather than log N. More importantly, the algorithm has a greatly reduced energy consumption since it requires O(N1=k) burst transmissions instead of O(N=k), per election, k being a parameter depending on the physical properties of the medium of communication. The algorithm has interesting potential applications in cognitive wireless networking.