{'fraction_non_alphanumeric': 0.015544041450777202, 'fraction_numerical': 0.0, 'mean_word_length': 5.284552845528455, '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}}
Efficient construction of connected dominating set in wireless ad hoc networks

Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.