eprintid: 2100
rev_number: 6
eprint_status: archive
userid: 6
dir: disk0/00/00/21/00
datestamp: 2014-01-20 13:46:26
lastmod: 2014-01-20 13:46:26
status_changed: 2014-01-20 13:46:26
type: book_section
metadata_visibility: show
creators_name: Casteigts, Arnaud
creators_name: Flocchini, Paola
creators_name: Quattrociocchi, Walter
creators_name: Santoro, Nicola
creators_id: 
creators_id: 
creators_id: walter.quattrociocchi@imtlucca.it
creators_id: 
title: Time-Varying graphs and dynamic networks
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Highly dynamic networks; delay-tolerant networks; challenged networks; time-varying graphs; evolving graphs; dynamic graphs
note: 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings
abstract: 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.
date: 2011
date_type: published
series: Lecture Notes in Computer Science
number: 6811
publisher: Springer 
pagerange: 346-359
id_number: 10.1007/978-3-642-22450-8_27
refereed: TRUE
isbn: 978-3-642-22450-8
book_title: Ad-hoc, mobile, and wireless networks
official_url: http://dx.doi.org/10.1007/978-3-642-22450-8_27
citation:   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)