{'fraction_non_alphanumeric': 0.016511867905056758, 'fraction_numerical': 0.0, 'mean_word_length': 5.298701298701299, '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}}
Detecting the presence of nodes in MANETs

While mobility in the sense of node movement has been an intensively studied aspect of mobile ad-hoc networks (MANETs), another aspect of mobility has not yet been subjected to systematic research: nodes may not only move around but also enter and leave the network. In fact, many proposed protocols for MANETs exhibit worst-case behavior when an intended communication partner is currently not present. Therefore, knowing whether a given node is currently present in the network can often help to avoid unnecessary overhead. In this paper, we present a solution to the presence detection problem. Our method uses a Bloom filter-based beaconing mechanism to aggregate and distribute information about the presence of network nodes. Analytical and simulation results show interesting properties of presence detection in wireless multihop environments and underline the effectiveness and practical applicability of our approach.