Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems

  • Swan Dubois
  • Mohamed-Hamza Kaaouachi
  • Franck Petit
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9212)


We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make only weak assumptions on the communication: every process is infinitely often able to communicate with other processes (not necessarily directly).

Our contribution is threefold. First, we propose a new definition of minimal dominating set suitable for the context of time-varying graphs that seems more relevant than existing ones. Next, we provide a necessary and sufficient topological condition for the existence of a deterministic algorithm for minimal dominating set construction in our settings. Finally, we propose a new measure of time complexity in time-varying graph in order to allow fair comparison between algorithms. Indeed, this measure takes account of communication delays attributable to dynamicity of the graph and not to the algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anagnostopoulos, A., Kumar, R., Mahdian, M., Upfal, E., Vandin, F.: Algorithms on evolving graphs. In: ITCS, pp. 149–160 (2012)Google Scholar
  2. 2.
    Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: PODC, pp. 278–281 (1984)Google Scholar
  3. 3.
    Ferreira, A.: Building a reference combinatorial model for manets. Network 18(5), 24–29 (2004)Google Scholar
  4. 4.
    Schneider, J., Wattenhofer, R.: Coloring unstructured wireless multi-hop networks. In: PODC, pp. 210–219 (2009)Google Scholar
  5. 5.
    Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. IJFCS 14(02), 267–285 (2003)MathSciNetMATHGoogle Scholar
  6. 6.
    Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS 27(5), 387–408 (2012)Google Scholar
  7. 7.
    Whitbeck, J., Dias de Amorim, M., Conan, V., Guillaume, J.L.: Temporal reachability graphs. In: MobiCom, pp. 377–388 (2012)Google Scholar
  8. 8.
    Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distributed Computing 22(5–6), 349–361 (2010)CrossRefMATHGoogle Scholar
  9. 9.
    Casteigts, A., Mans, B., Mathieson, L.: On the feasibility of maintenance algorithms in dynamic graphs. Technical report, arXiv - abs/1107.2722 (2011)Google Scholar
  10. 10.
    Casteigts, A., Flocchini, P.: Deterministic algorithms in dynamic networks: Problems, analysis, and algorithmic tools. Technical report, DRDC 2013-020 (2013)Google Scholar
  11. 11.
    Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: PODC, pp. 1–10 (2011)Google Scholar
  12. 12.
    Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513–522 (2010)Google Scholar
  13. 13.
    Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Deterministic computations in time-varying graphs: Broadcasting under unstructured mobility. In: ICTCS, pp. 111–124 (2010)Google Scholar
  14. 14.
    Ilcinkas, D., Klasing, R., Wade, A.M.: Exploration of constantly connected dynamic graphs based on cactuses. In: Halldórsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 250–262. Springer, Heidelberg (2014) Google Scholar
  15. 15.
    Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. John Wiley Interscience (2004)Google Scholar
  16. 16.
    Braud-Santoni, N., Dubois, S., Kaaouachi, M.H., Petit, F.: A generic framework for impossibility results in time-varying graphs. In: APDCM (to appear, 2015)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Swan Dubois
    • 1
  • Mohamed-Hamza Kaaouachi
    • 1
  • Franck Petit
    • 1
  1. 1.Sorbonne Universités, UPMC Univ Paris 06, CNRS, INRIA, LIP6 UMR 7606Paris Cedex 5France

Personalised recommendations