Concurrent Broadcast for Information Dissemination
IEEE Transactions on Software Engineering
Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Self-stabilization
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
Distributed Algorithms
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
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
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Dynamic networks are as fast as static networks
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Polynomial end-to-end communication
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th ACM symposium on Principles of distributed computing
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Keeping mobile robot swarms connected
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Prioritized gossip in vehicular networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Accessing probabilistic quorums in dynamic networks
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Dynamic networks: models and algorithms
ACM SIGACT News
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Faster information dissemination in dynamic networks via network coding
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the power of waiting when exploring public transportation systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Aggregation in dynamic networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Prioritized gossip in vehicular networks
Ad Hoc Networks
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Fast distributed computation in dynamic networks via random walks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Brief announcement: naming and counting in anonymous unknown dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
The cost of radio network broadcast for different models of unreliable links
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Temporal network optimization subject to connectivity constraints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Expressivity of time-varying graphs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Efficient routing in carrier-based mobile networks
Theoretical Computer Science
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Reprint of "Prioritized gossip in vehicular networks"
Ad Hoc Networks
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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 connected graphs it is possible for nodes to determine the size of the network and compute any com- putable function of their initial inputs in O(n2) rounds using messages of size O(log n + d), where d is the size of the input to a single node. Further, if the graph is T-interval connected for T 1, the computation can be sped up by a factor of T, and any function can be computed in O(n + n2/T) rounds using messages of size O(log n + d). We also give two lower bounds on the token dissemination problem, which requires the nodes to disseminate k pieces of information to all the nodes in the network. The T-interval connected dynamic graph model is a novel model, which we believe opens new avenues for research in the theory of distributed computing in wireless, mobile and dynamic networks.