{'fraction_non_alphanumeric': 0.01829924650161464, 'fraction_numerical': 0.002152852529601722, 'mean_word_length': 5.241610738255034, '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}}
Recognizing Moving Groups with Infrastructure Support

Detection of nearby nodes in wireless ad hoc networks requires periodic neighborhood scanning which is, in terms of energy, a rather expensive procedure: The nodes transmit the discovery packets and, furthermore, their reception circuits have to be active most of the time. Since distributed moving group detection algorithms rely on those nearby node-detection procedures, this kind of overhead seems unavoidable for them. However, in most of the scenarios some fixed infrastructure co-exist which may support the detection process. In this paper we propose a method that uses the infrastructure to gain hints about moving groups and triggers the distributed process only if there is some degree of confidence that such a group exists. This reduces the overhead of the neighborhood scans by approximately 90% translating e.g. to longer lifetime for the battery-driven nodes