Casteigts, Arnaud and Flocchini, Paola and Quattrociocchi, Walter and Santoro, Nicola Time-Varying graphs and dynamic networks. In: Ad-hoc, mobile, and wireless networks. Lecture Notes in Computer Science (6811). Springer , pp. 346-359. ISBN 978-3-642-22450-8 (2011)Full text not available from this repository.
The past decade has seen intensive research efforts on highly dynamic wireless and mobile networks (variously called delay-tolerant, disruptive-tolerant, 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 time-varying 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.
|Item Type:||Book Section|
|Additional Information:||10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings|
|Uncontrolled Keywords:||Highly dynamic networks; delay-tolerant networks; challenged networks; time-varying graphs; evolving graphs; dynamic graphs|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Ms T. Iannizzi|
|Date Deposited:||20 Jan 2014 13:46|
|Last Modified:||20 Jan 2014 13:46|
Actions (login required)