{'fraction_non_alphanumeric': 0.023183925811437404, 'fraction_numerical': 0.0, 'mean_word_length': 4.944954128440367, '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}}
Order-Optimal Data Aggregation in Regular Wireless Sensor Networks

The predominate traffic patterns in a wireless sensor network are many-to-one and one-to-many communication. Hence, the performance of wireless sensor networks is characterized by the rate at which data can be disseminated from or aggregated to a data sink. In this paper, the problem of data aggregation at a single sink is considered. It is shown that a data aggregation rate of Θ(logn/n) per node is optimal and that this rate can be achieved in regular wireless sensor networks using a generalization of cooperative beamforming called cooperative time-reversal communication.