{'fraction_non_alphanumeric': 0.018018018018018018, 'fraction_numerical': 0.001001001001001001, 'mean_word_length': 5.622516556291391, '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}}
On the efficiency of local information-based sink deployment in heterogeneous environments

Deploying multiples sink nodes reduces communication distance, and thus energy consumption in wireless sensor networks. Determining exactly where to deploy those sinks so as to minimize the communication paths isn't however a trivial question. Solutions that use integer linear programming or iterative clustering techniques are usually not scalable, choose the sink positions only from a limited set of possibilities, and are based on global topology information. In this paper we present and analyze the 1_hop algorithm, an approach that uses only local, last-hop routing information to iteratively find an efficient solution to the deployment problem. We show that the algorithm performs well in any kind of heterogeneous environment (heterogeneous sensor density, areas of irregular shape, or with obstacles), cases in which solutions that build on global topology information are often not appropriate.