{'fraction_non_alphanumeric': 0.021181716833890748, 'fraction_numerical': 0.0, 'mean_word_length': 5.414285714285715, '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}}
Synchronized reconfiguration of a group of mobile nodes in ad-hoc networks

We consider the problem to reconfigure synchronously a group of mobile nodes in ad-hoc networks without central control. The reconfiguration can enhance or update software on all communication layers, which means that communication during reconfigurations may not be possible. Furthermore, we consider the dynamic nature of ad-hoc networks, where nodes can join or leave at any time. We propose a novel, time-out based algorithm for synchronous reconfigurations for a group of terminals for these requirements. The algorithm achieves some basic consistency properties, where connected groups have the same configuration afterwards (old or new). We discuss the correctness of the algorithm and present variations depending on failure assumptions. Several applications for reconfigurations in ad-hoc networks are discussed.