{'fraction_non_alphanumeric': 0.011986301369863013, 'fraction_numerical': 0.0, 'mean_word_length': 4.969387755102041, '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}}
Bounds for Lifetime Maximization with Multiple Sinks in Wireless Sensor Networks

In wireless sensor networks, the reliability can be increased when data is sent to multiple sinks. Data information transmitted to each sink can be considered as a commodity. The objective is to determine the route between each source and sink such that the lifetime of the commodity is maximized. In this paper, we derive the upper and lower bounds for the lifetime maximization problem with multiple sinks. Simulation results show that these bounds are tight for large scale wireless sensor networks.