{'fraction_non_alphanumeric': 0.013142174432497013, 'fraction_numerical': 0.0, 'mean_word_length': 5.161764705882353, '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}}
Stability-Guaranteed Clustering in Satellite Networks

Due to the nature of satellite networks, clustering for low earth orbit satellite networks is different from wireless ad hoc networks in which clustering is performed node by node. A stability-guaranteed clustering algorithm in satellite networks is proposed in this paper. Since two nodes with the furthest distance must be positioned in different clusters, a set of triplets consisting of the pair of nodes and the distance between them can be constructed, and clustering can be performed by searching for the pair of nodes with the furthest distance. Stability of the clusters is guaranteed by providing the redundant paths within and among clusters at an appropriate degree. The correctness of the algorithm is proved. Simulation results indicate it is efficient and convenient.