{'fraction_non_alphanumeric': 0.013262599469496022, 'fraction_numerical': 0.0, 'mean_word_length': 5.1521739130434785, '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}}
Energy-Efficient Data Gathering in Heterogeneous Wireless Sensor Networks

This paper considers a heterogeneous wireless sensor network consisting in several resource-rich supernodes used for data relaying and a large number of energy constrained wireless sensor nodes. Sensor nodes are deployed randomly to monitor a number of targets. Since targets are redundantly covered by more sensors, in order to conserve energy resources, we organize the sensors in set covers that are activate successively. In this paper we introduce the heterogeneous connected set covers (HCSC) problem that has as objective finding a maximum number of set covers such that each set cover monitors all targets and is connected to at least one supernode. A sensor can participate in multiple set covers, but sum of the energy spent in all sets is constrained by the initial energy resources. This is the first paper to address the target coverage problem in heterogeneous wireless sensor networks. We show that HCSC is NP-complete and propose several distributed algorithms for the HCSC problem. Simulation results are presented to verify our approaches