{'fraction_non_alphanumeric': 0.015978695073235686, 'fraction_numerical': 0.0, 'mean_word_length': 5.482758620689655, '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 Clustering Protocol for Wireless Networks

We present a new protocol to cluster nodes of wireless networks. Our protocol ensures reliable message transmission in spite of collisions and transmission losses. We first present a geometric-probabilistic model to predict the optimal range for maximizing one-hop broadcast coverage in wireless networks as a function of range, sending rate and density. We use the above model to design a scalable clustering protocol, which functionality is independent of network topology. Then, we incorporate our analytical model to this protocol to adapts to network conditions. Through extensive analytical and experimental results, we show multifold advantages of adapting the protocol to network conditions.