{'fraction_non_alphanumeric': 0.013779527559055118, 'fraction_numerical': 0.0, 'mean_word_length': 4.947368421052632, '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}}
Adaptive spatial window aggregation query processing algorithm in wireless sensor networks

Users of wireless sensor networks (WSNs) often submit spatial window aggregation queries to obtain the summary information about a local area in the monitored region. We propose an adaptive spatial window aggregation query processing algorithm called ASWAP in this paper. It divides the query area into several disjoint sub-regions. A cluster head node is elected in each sub-region which collects the sensory data of sensor nodes in it, uses the data collected to calculate the partial query result and sends it to the cluster head node of the next sub-region. While a cluster head node fails during the above process, a recovery area can be found in its corresponding sub-region in which any node can substitute the cluster head node to resume the process of query processing. Experimental results show that in most cases ASWAP outperforms the existing IWQE algorithm in terms of energy consumption and query success rate.