{'fraction_non_alphanumeric': 0.0199468085106383, 'fraction_numerical': 0.0, 'mean_word_length': 5.435897435897436, '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}}
Highly stable and adaptive clustering with efficient routing in wireless ad hoc networks

The association and disassociation of mobile nodes to and from the clusters in wireless ad hoc networks disturb the stability of the network and, therefore, the reconfiguration of clusterheads is unavoidable. This paper proposes a Weight Based Adaptive Clustering Algorithm (WBACA) that leads to a high degree of stability in the network. Through simulations we have compared the performance of WBACA with that of the Lowest-ID algorithm and the Weighted Clustering Algorithm (WCA) in terms of the number of clusters formed, number of clusterhead changes, number of reaffiliations, control overheads, throughput, and average packet transfer delay in the network.