{'fraction_non_alphanumeric': 0.01220865704772475, 'fraction_numerical': 0.0, 'mean_word_length': 5.352112676056338, '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}}
Distributed Graph Reduction Algorithm with Parallel Rigidity Maintenance

Precise localization in wireless sensor networks depends on distributed algorithms running on a large number of wireless nodes with reduced energy, processing and memory resources. Prerequisite for the estimation of unique nodes locations is rigid network graph. To satisfy this prerequisite network graph needs to be well connected. On the other hand, execution of distributed algorithm in the graphs with large number of edges can present significant impact on scarce resources of wireless nodes. In order to reduce number of edges in the network graph, novel distributed algorithm for network reduction is proposed. Main objective of the proposed algorithm is to remove as many edges as possible maintaining graph rigidity property. In this paper a special case of graph rigidity is considered, namely the parallel rigidity.