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.
An extended version of this paper can be found in arXiv:1012.0009.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279–304 (2007)
Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121–132. Springer, Heidelberg (2008)
Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proc. 28th ACM Symp. on Principles of Distributed Computing (PODC), pp. 260–269 (2009)
Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger’s Theorem. Networks 28(3), 125–134 (1996)
Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Proc. 2nd Intl. Conf. on Ad Hoc Networks and Wireless (AdHoc-Now), pp. 259–270 (2003)
Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Intl. J. of Foundations of Comp. Science 14(2), 267–285 (2003)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: Maxprop: Routing for vehicle-based disruption-tolerant networks. In: Proc. 25th IEEE Conference on Computer Communications (INFOCOM), pp. 1–11 (2006)
Casteigts, A., Chaumette, S., Ferreira, A.: On the assumptions about network dynamics in distributed computing. Arxiv preprint arXiv:1102.5529 (2011); A preliminary version appeared in SIROCCO (2009)
Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Deterministic computations in time-varying graphs: Broadcasting under unstructured mobility. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 111–124. Springer, Heidelberg (2010)
Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Measuring temporal lags in delay-tolerant networks. In: Proc. 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS (2011)
Chaintreau, A., Mtibaa, A., Massoulie, L., Diot, C.: The diameter of opportunistic mobile networks. Communications Surveys & Tutorials 10(3), 74–88 (2008)
Clementi, A., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC), pp. 213–222 (2008)
Clementi, A., Pasquale, F.: Information Spreading in Dynamic Networks: An Analytical Approach. In: Nikoletseas, S., Rolim, J. (eds.) Theoretical Aspects of Distributed Computing in Sensor Networks. Springer, Heidelberg (2010)
Ferreira, A.: Building a reference combinatorial model for MANETs. IEEE Network 18(5), 24–29 (2004)
Flocchini, P., Kellett, M., Mason, P., Santoro, N.: Mapping an unfriendly subway system. In: Proc. 5th Intl. Conf. on Fun with Algorithms, pp. 190–201 (2010)
Flocchini, P., Mans, B., Santoro, N.: Exploration of periodically varying graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 534–543. Springer, Heidelberg (2009)
Harary, F., Gupta, G.: Dynamic graph models. Mathematical and Computer Modelling 25(7), 79–88 (1997)
Holme, P.: Network reachability of real-world contact sequences. Physical Review EÂ 71(4), 46119 (2005)
Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proc. Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), pp. 145–158 (2004)
Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proc. 32nd ACM Symp. on Theory of Computing (STOC), page 513 (2000)
Kossinets, G., Kleinberg, J., Watts, D.: The structure of information pathways in a social communication network. In: Proc. 14th Intl. Conf. on Knowledge Discovery and Data Mining (KDD), pp. 435–443 (2008)
Kostakos, V.: Temporal graphs. Physica A 388(6), 1007–1023 (2009)
Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proc. 42nd ACM Symp. on Theory of Computing, pp. 513–522 (2010)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. on Knowledge Discovery from Data 1(1) (2007)
Liu, C., Wu, J.: Scalable routing in cyclic mobile networks. IEEE Trans. Parallel Distrib. Syst. 20(9), 1325–1338 (2009)
O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proc. Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 104–110 (2005)
Ramanathan, R., Basu, P., Krishnan, R.: Towards a formalism for routing in challenged networks. In: Proc. 2nd ACM Workshop on Challenged Networks (CHANTS), pp. 3–10 (2007)
Tang, J., Musolesi, M., Mascolo, C., Latora, V.: Characterising temporal distance and reachability in mobile and online social networks. ACM Computer Communication Review 40(1), 118–124 (2010)
Zhang, X., Kurose, J., Levine, B.N., Towsley, D., Zhang, H.: Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing. In: Proc. 13th ACM Int. Conf. on Mobile Computing and Networking, pp. 195–206 (2007)
Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Comm. Surveys & Tutorials 8(1), 24–37 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N. (2011). Time-Varying Graphs and Dynamic Networks. In: Frey, H., Li, X., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2011. Lecture Notes in Computer Science, vol 6811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22450-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-22450-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22449-2
Online ISBN: 978-3-642-22450-8
eBook Packages: Computer ScienceComputer Science (R0)