{'fraction_non_alphanumeric': 0.015494636471990465, 'fraction_numerical': 0.0, 'mean_word_length': 5.268656716417911, '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}}
An efficient transmission scheme for data aggregation in wireless sensor networks

In this paper, we introduce a novel algorithm aiming at maximizing the transmission capacity in wireless sensor networks (WSNs). Based on the Dijkstra algorithm and the max-flow theorem, the proposed algorithm solves the contradiction between the path length and forwarding capacity of various nodes, and thus scales up the relay capacity in terms of the number of transmitted packets from the source node to the sink node. Specifically, our algorithm first transforms the network from an undirected graph to a directed one, and then trims the excess paths in order to achieve the optimal capacity. We evaluate the proposed algorithm atop a testbed, and the experimental results show the significant performance enhancement by using the proposed algorithm.