Distributed Computation in Dynamic Networks

11 years 6 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current round are before they broadcast their messages. The model captures mobile networks and wireless networks, in which mobility and interference render communication unpredictable. In contrast to much of the existing work on dynamic networks, we do not assume that the network eventually stops changing; we require correctness and termination even in networks that change continually. We introduce a stability property called T-interval connectivity (for T ≥ 1), which stipulates that for every T consecutive rounds there exists a stable connected spanning subgraph. For T = 1 this means that the graph is connected in every round, but changes arbitrarily between rounds. We show that in 1-interval conne...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
Added 17 Jul 2010
Updated 17 Jul 2010
Type Conference
Year 2010
Where STOC
Authors Fabian Kuhn, Nancy Lynch and Rotem Oshman
Comments (0)