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 rou...
Main Authors: | , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2011-04-28T21:03:34Z.
|
Subjects: | |
Online Access: | Get fulltext |