Skip to main content
SpringerLink
Log in

Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem

  • Conference paper
  • First Online:
Book cover Stabilization, Safety, and Security of Distributed Systems (SSS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10616))

Abstract

A dominating set in a distributed system is a set of nodes such that each node is contained in the set or has at least one neighbor in the set.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Herman, T., Ghosh, S.: Stabilizing phase-clocks. Inf. Proc. Lett. 5(6), 259–265 (1995)

    Article  Google Scholar 

  2. Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K.: A synchronous selfstabilizing minimal domination protocol in an arbitrary network graph. In: Proceedings of the Fifth International Workshop on Distributed Computing, pp. 26–32 (2003)

    Chapter  Google Scholar 

  3. Chiu, W.Y., Chen, C., Tsai, S.Y.: A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon. Inf. Proc. Lett. 114(5), 515–518 (2014)

    Article  MathSciNet  Google Scholar 

  4. Kamei, S., Kakugawa, H.: A self-stabilizing algorithm for the distributed minimal \(k\)-redundant dominating set problem in tree network. In: Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 720–724 (2003)

    Google Scholar 

  5. Kamei, S., Kakugawa, H.: A self-stabilizing approximation algorithm for the distributed minimum \(k\)-domination. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88–A(5), 1109–1116 (2005)

    Article  Google Scholar 

  6. Wang, G., Wang, H., Tao, X., Zhang, J.: A self-stabilizing algorithm for finding a minimal k-dominating set in general networks. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds.) ICDKE 2012. LNCS, vol. 7696, pp. 74–85. Springer, Heidelberg (2012). doi:10.1007/978-3-642-34679-8_8

    Chapter  Google Scholar 

  7. Wang, G., Wang, H., Tao, X., Zhang, J., Zhang, J.: Minimising k-dominating set in arbitrary network graphs. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013. LNCS, vol. 8347, pp. 120–132. Springer, Heidelberg (2013). doi:10.1007/978-3-642-53917-6_11

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Osaka, Suita, 565-0871, Japan

    Hisaki Kobayashi, Hirotsugu Kakugawa & Toshimitsu Masuzawa

Authors
  1. Hisaki Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hirotsugu Kakugawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshimitsu Masuzawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hisaki Kobayashi .

Editor information

Editors and Affiliations

  1. University of Liverpool, Liverpool, United Kingdom

    Paul Spirakis

  2. Chalmers University of Technology, Gothenburg, Sweden

    Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kobayashi, H., Kakugawa, H., Masuzawa, T. (2017). Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem. In: Spirakis, P., Tsigas, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2017. Lecture Notes in Computer Science(), vol 10616. Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69084-1_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69083-4

  • Online ISBN: 978-3-319-69084-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation