{'fraction_non_alphanumeric': 0.02976190476190476, 'fraction_numerical': 0.0, 'mean_word_length': 5.73, '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 New Clustering Algorithm and Relevant Theoretical Analysis for Ad-Hoc Networks

In ad-hoc networks, MSWCA is a typical algorithm in clustering algorithms with consideration on motion-correlativity. Aiming at MSWCA’s problem that “it only considers on intra-cluster stability, and neglects the inter-cluster stability”, a new clustering algorithm (NCA) was proposed. Firstly, NCA clustering algorithm and its cluster maintenance scheme were designed. Secondly, the theoretical quantitative analyses on average variation frequency of clusters and clustering overheads were conducted. The results show that NCA can improve cluster stability and reduce clustering overheads.