Skip to main content
SpringerLink
Log in

On Verifying and Maintaining Connectivity of Interval Temporal Networks

  • Conference paper
  • First Online:
Algorithms for Sensor Systems (ALGOSENSORS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 9536))

Abstract

An interval temporal network is, informally speaking, a network whose links change with time. The term interval means that a link may exist for one or more time intervals, called availability intervals of the link, after which it does not exist (until, maybe, a further moment in time when it starts being available again). In this model, we consider continuous time and high-speed (instantaneous) information dissemination. An interval temporal network is connected during a period of time [x, y], if it is connected for all time instances \(t \in [x,y]\) (instantaneous connectivity). In this work, we study instantaneous connectivity issues of interval temporal networks. We provide a polynomial-time algorithm that answers if a given interval temporal network is connected during a time period. If the network is not connected throughout the given time period, then we also give a polynomial-time algorithm that returns large components of the network that remain connected and remain large during [x, y]; the algorithm also considers the components of the network that start as large at time \(t=x\) but dis-connect into small components within the time interval [x, y], and answers how long after time \(t=x\) these components stay connected and large. Finally, we examine a case of interval temporal networks on tree graphs where the lifetimes of links and, thus, the failures in the connectivity of the network are not controlled by us; however, we can “feed” the network with extra edges that may re-connect it into a tree when a failure happens, so that its connectivity is maintained during a time period. We show that we can with high probability maintain the connectivity of the network for a long time period by making these extra edges available for re-connection using a randomised approach. Our approach also saves some cost in the design of availabilities of the edges; here, the cost is the sum, over all extra edges, of the length of their availability-to-reconnect interval.

Supported in part by (i) the School of EEE and CS and the NeST initiative of the Univeristy of Liverpool, and (ii) the FET EU IP Project MULTIPLEX under contract No. 317532.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We can assume this, because if an edge \(e \in E\) has overlapping availability intervals, then we can consider their union as an availability interval of e.

  2. 2.

    E(t) are the edges that are available at t and do not stop being available (immediately) after time t.

  3. 3.

    Notice, here, the distinction between the availability of an edge and the lifetime of an edge: availability refers to the interval that we assign to a reserved edge with the purpose to re-connect the tree when it breaks, and lifetime refers to the interval that the operator assigns to an edge after it is inserted in the tree structure and is the time interval after which the respective link in the tree structure will fail.

  4. 4.

    An event occurs with high probability if, for any \(\gamma \ge 1\), the event occurs with probability at least \(1-{\frac{c_{\gamma }}{n^{\gamma }}}\), where \(c_{\gamma }\) depends only on \(\gamma \).

  5. 5.

    The last box is not necessarily of size exactly \(\beta \log {n}\) but this does not affect the analysis.

  6. 6.

    The size of a component is the number of its vertices.

  7. 7.

    Note that increasing the size of the boxes by a constant factor, i.e., increasing the lower bound for \(\beta \) and \(\alpha \), can enforce the re-connection probability to also increase.

References

  1. Akrida, E.C., Gąsieniec, L., Mertzios, G.B., Spirakis, P.G.: Ephemeral networks with random availability of links: diameter and connectivity. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2014)

    Google Scholar 

  2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  MATH  Google Scholar 

  3. Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). 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)

    Chapter  Google Scholar 

  4. Bui-Xuan, B.-M., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267–285 (2003)

    Article  MathSciNet  Google Scholar 

  5. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. (IJPEDS) 27(5), 387–408 (2012)

    Article  Google Scholar 

  6. Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time of edge-markovian evolving graphs. SIAM J. Discrete Math. (SIDMA) 24(4), 1694–1712 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cooper, C., Klasing, R., Radzik, T.: A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci. 406(3), 248–262 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Duchon, P., Duvignau, R.: Local update algorithms for random graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 367–378. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  9. Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 717–736 (2013)

    Google Scholar 

  10. Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput. 36(6), 1600–1630 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fleischer, L., Tardos, É.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3–5), 71–80 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gavoille, C., Peleg, D., Perennes, S., Raz, R.: Distance labeling in graphs. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 210–219 (2001)

    Google Scholar 

  13. Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34(1), 23–40 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 504–513 (2000)

    Google Scholar 

  15. Koch, R., Nasrabadi, E., Skutella, M.: Continuous and discrete flows over time - a general model based on measure theory. Math. Methods OR 73(3), 301–337 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 513–522 (2010)

    Google Scholar 

  17. Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657–668. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  18. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 269–283. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol. 23. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  20. O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 104–110 (2005)

    Google Scholar 

  21. Scheideler, C.: Models and techniques for communication in dynamic networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 27–49. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, UK

    Eleni C. Akrida & Paul G. Spirakis

  2. Computer Technology Institute and Press “Diophantus” (CTI), Patras, Greece

    Paul G. Spirakis

Authors
  1. Eleni C. Akrida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul G. Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eleni C. Akrida .

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Ontario, Canada

    Prosenjit Bose

  2. University of Liverpool, Liverpool, United Kingdom

    Leszek Antoni Gąsieniec

  3. Graz University of Technology, Graz, Austria

    Kay Römer

  4. ETH Zurich, Zürich, Switzerland

    Roger Wattenhofer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Akrida, E.C., Spirakis, P.G. (2015). On Verifying and Maintaining Connectivity of Interval Temporal Networks. In: Bose, P., Gąsieniec, L., Römer, K., Wattenhofer, R. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2015. Lecture Notes in Computer Science(), vol 9536. Springer, Cham. https://doi.org/10.1007/978-3-319-28472-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28472-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28471-2

  • Online ISBN: 978-3-319-28472-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation