Skip to Main content Skip to Navigation
Conference papers

Time-Varying Graphs and Dynamic Networks

Abstract : 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.
Complete list of metadata
Contributor : Arnaud Casteigts Connect in order to contact the contributor
Submitted on : Monday, August 26, 2013 - 5:08:57 PM
Last modification on : Saturday, June 25, 2022 - 10:33:46 AM
Long-term archiving on: : Thursday, April 6, 2017 - 9:13:28 AM


Files produced by the author(s)


  • HAL Id : hal-00854287, version 1



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⟩



Record views


Files downloads