Data dissemination is a fundamental task in distributed computing. This talk will explore broadcast problems in various innovative models where the communication network connecting n processes is dynamic (e.g., due to mobility or failures) and controlled by an adversary. In the main model, the processes transitively communicate their ids in synchronous rounds along a rooted tree given in each round by the adversary, whose goal is to maximize the number of rounds until at least one id is known by all processes. Previous research has shown a ⌈(3n−1)/2⌉−2 lower bound and an O(n log log n) upper bound. The talk will cover the first linear upper bound for this problem, namely ⌈(1+√2)n−1⌉≈2.4n. We will then discuss generalisations of this problem, in a more connected, less connected, and randomised setting.
