{'fraction_non_alphanumeric': 0.014691478942213516, 'fraction_numerical': 0.0, 'mean_word_length': 6.146853146853147, '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}}
One-Step Asynchronous Data Fusion DLMS Algorithm

In recent years distributed estimation has attracted much attention. In traditional distributed algorithms, each node performs data fusion over synchronous data, which causes lots of time consumptions in the actual situations and estimation performance degradation. To deal with this problem, we propose a new one-step asynchronous data fusion strategy in distributed estimation algorithms. Moreover, the proposed algorithms with or without measurement data sharing are studied to provide different asynchronous cooperation strategies. In particular, the convergence behavior of the proposed asynchronous fusion algorithms is analyzed, and why asynchronous fusion can improve estimation performance and reduce time consumptions are also analyzed. The effectiveness of the proposed algorithms is demonstrated through some illustrative examples. Simulation results show that the proposed algorithms considerably outperform the traditional DLMS algorithms and LMS algorithm.