{'fraction_non_alphanumeric': 0.026018099547511313, 'fraction_numerical': 0.005656108597285068, 'mean_word_length': 5.061643835616438, '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}}
The Novel Stick Clustering Algorithm and its Applications for Ad-hoc Networks

Clustering is considered a critical process to make a fast and reliable connection establishment of ad-hoc networks. In this paper, a new clustering algorithm is proposed, namely Stick Clustering Algorithm (SCA). The proposed SCA is used to overcome the low connectivity, low energy and delay to enhance the performance of largescale ad-hoc networks. The simulation results showed the efficiency and the reliability of the proposed clustering algorithm against many greatest challenges such as high intensity of nodes under small network area. Also, the results demonstrated that the proposed SCA is very competitive algorithm compared with RCA, CDS, Z-Degree and ZID. The proposed SCA obtained 3.4306 approximation ratio. Also, the efficiency of the SCA is of O(n) for both message complexities and time.