Time-Varying Graphs and Dynamic Networks

Arnaud Casteigts (1) , Paola Flocchini (2) , Walter Quattrociocchi (2) , Nicola Santoro (3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 SITE - School of Information Technology and Engineering [Ottawa]
3 School of Computer Science [Ottawa]

The past decade has seen intensive research efforts on highly dy- namic wireless and mobile networks (variously called delay-tolerant, disruptive- tolerant, challenged, opportunistic, etc) whose essential feature is a possible ab- sence 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 time- varying graphs). Besides this definitional work, we connect the various assump- tions through a hierarchy of classes of TVGs defined with respect to properties with algorithmic significance in distributed computing. One of these classes co- incides 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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro. Time-Varying Graphs and Dynamic Networks. 10th International Conference on Adhoc, Mobile, and Wireless Networks (ADHOC-NOW),, Jul 2011, Germany. pp.346-359. ⟨hal-00854287⟩