Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Information dissemination in highly dynamic graphs
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
Towards a formalism for routing in challenged networks
Proceedings of the second ACM workshop on Challenged networks
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The structure of information pathways in a social communication network
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Scalable Routing in Cyclic Mobile Networks
IEEE Transactions on Parallel and Distributed Systems
Characterising temporal distance and reachability in mobile and online social networks
ACM SIGCOMM Computer Communication Review
Exploration of Periodically Varying Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Measuring Temporal Lags in Delay-Tolerant Networks
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
IEEE Communications Surveys & Tutorials
Mathematical and Computer Modelling: An International Journal
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
On the impact of users availability in OSNs
Proceedings of the Fifth Workshop on Social Network Systems
Brief announcement: waiting in dynamic networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Proceedings of the 18th annual international conference on Mobile computing and networking
Proceedings of the 18th annual international conference on Mobile computing and networking
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Fast distributed computation in dynamic networks via random walks
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
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
A Comparison of Opportunistic Connection Datasets
International Journal of Distributed Systems and Technologies
Efficient routing in carrier-based mobile networks
Theoretical Computer Science
Hi-index | 0.00 |
The past decade has seen intensive research efforts on highly dynamic wireless and mobile networks (variously called delay-tolerant, disruptivetolerant, challenged, opportunistic, etc) whose essential feature is a possible absence of end-to-end communication routes at any instant. As part of these efforts, a number of important concepts have been identified, based on new meanings of distance and connectivity. The main contribution of this paper is to review and integrate the collection of these concepts, formalisms, and related results found in the literature into a unified coherent framework, called TVG (for timevarying graphs). Besides this definitional work, we connect the various assumptions through a hierarchy of classes of TVGs defined with respect to properties with algorithmic significance in distributed computing. One of these classes coincides with the family of dynamic graphs over which population protocols are defined. We examine the (strict) inclusion hierarchy among the classes. The paper also provides a quick review of recent stochastic models for dynamic networks that aim to enable analytical investigation of the dynamics.