Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient Distributed Selection with Bounded Messages
IEEE Transactions on Parallel and Distributed Systems
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Distributed Algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Information dissemination in highly dynamic graphs
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A note on efficient aggregate queries in sensor networks
Theoretical Computer Science
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hi-index | 0.00 |
Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and efficiency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a fixed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics. In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We first observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.