{'fraction_non_alphanumeric': 0.024475524475524476, 'fraction_numerical': 0.0, 'mean_word_length': 5.557251908396947, '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 data aggregation algorithms in wireless sensor networks

Resource-constrained is a critical issue in Wireless Sensor Networks (WSN) applications. Data aggregation (or data fusion) is one of the key techniques to solve the problem. Data aggregation can effectively reduce the data traffic, thereby reduce energy consumption, and extend the network's survival time. The research of data aggregation relates to many aspects of technology, so that the design of efficient data aggregation algorithm is a challenging task. In this paper, we investigate the effect of essential operations, scheduling algorithm and aggregation tree construction, has on data aggregation performance. The main performance such as end-to-end delay and energy-consumption of different aggregation schemes has been studied and measured by simulation experiment.