STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
ZRP: a hybrid framework for routing in Ad Hoc networks
Ad hoc networking
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual 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
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
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
Theoretical Computer Science
Dynamic networks: models and algorithms
ACM SIGACT News
Coordinated consensus in dynamic networks
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
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
On the exploration of time-varying networks
Theoretical Computer Science
Bounded-contention coding for wireless networks in the high SNR regime
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
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary so that a node may correctly flood or route a message in a network whose links may change arbitrarily at any given point, subject to the condition that the underlying graph is connected. We look at algorithmic constraints such as limited storage, no knowledge of an upper bound on the number of nodes, and no usage of identifiers. We look at flooding as well as routing to some existing specified destination and give algorithms.