{'fraction_non_alphanumeric': 0.008952551477170993, 'fraction_numerical': 0.0, 'mean_word_length': 5.9875, '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}}
Performance Analysis of Average Consensus Algorithm without Reconfiguration of Edge Weights in Hybrid Wireless Sensor Networks

The integration of mobile sensor nodes with existing static nodes poses a significant technological shift to overcome the well-studied limitations of wireless sensor technologies. Over the recent years, it has been identified by many scientists that the application of data aggregation mechanisms can effectively compensate for negative factors affecting the operation of wireless sensor nodes. In this paper, we address the average consensus algorithm with a weight matrix guaranteeing the convergence without any reconfiguration of the edge weights in dynamically changing topologies whereby the data aggregation in mobile wireless sensor networks is significantly optimized in many aspects. Specifically, we examine the performance of the mentioned algorithm with bounded execution for distributed averaging over hybrid wireless sensor networks under various scenarios. Besides, we compare the performance of the algorithm over hybrid networks with its performance over mobile networks.