{'fraction_non_alphanumeric': 0.013377926421404682, 'fraction_numerical': 0.0, 'mean_word_length': 5.112244897959184, '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}}
Randomized broadcast in dynamic network environments

We consider randomized broadcast or information dissemination in wireless networks with switching network topologies. We provide order upper bounds for the dissemination time. These bounds are functions of the sizes of the network topologies, the conductance of the networks, and the switching times. We establish these bounds for networks that change in terms of the number nodes. We do so for networks that go through a topology change at one switching time, and extend this to the case where the system goes through multiple switching times.