Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Computing

IWDC 2003: Distributed Computing - IWDC 2003 pp 26–32Cite as

A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2918))

Abstract

In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abu-Amara, H., Coan, B., Dolev, S., Kanevsky, A., Welch, J.L.: Self stabilizing topology maintenance protocols for high-speed networks. IEEE/ACM Transactions on Networking 4(6), 902–912 (1996)

    Article  Google Scholar 

  2. Afek, Y., Dolev, S.: Local stabilizer. In: Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pp. 74–84 (1997)

    Google Scholar 

  3. Attiya, H., Welch, J.: Distributed Computing: Fundamentals. Simulations and Advanced Topics. McGraw-Hill, New York (1998)

    Google Scholar 

  4. Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-stabilizing local mutual exclusion and daemon refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 223–237. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  6. Dijkstra, E.W.: A belated proof of self-stabilization. Distributed Computing 1(1), 5–6 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  8. Dolev, S., Pradhan, D.K., Welch, J.L.: Modified tree structure for location management in mobile environments. Computer Communications 19, 335–345 (1996)

    Article  Google Scholar 

  9. Dolev, S., Welch, J.L.: Crash resilient communication in dynamic networks. IEEE Transactions on Computers 14, 14–26 (1997)

    Article  Google Scholar 

  10. Fujita, S., Kameda, T., Yamashita, M.: A resource assignment problem on graphs. In: Proceedings of the 6th International Symposium on Algorithms and Computation, Cairns, Australia, December 1995, pp. 418–427 (1995)

    Google Scholar 

  11. Gupta, S.K.S., Bouabdallah, A., Srimani, P.K.: Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 600–604. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Gupta, S.K.S., Srimani, P.K.: Using self-stabilization to design adaptive multicast protocol for mobile ad hoc networks. In: Proceedings of the DIMACS Workshop on Mobile Networks and Computing, Rutgers University, NJ, pp. 67–84 (1999)

    Google Scholar 

  13. Hsu, S., Huang, S.T.: A self-stabilizing algorithm for maximal matching. Information Processing, Letters 43, 77–81 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)

    MATH  Google Scholar 

  15. Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Fault tolerant distributed coloring algorithms that stabilize in linear time. In: Proceedings of the IPDPS-2002 Workshop on Advances in Parallel and Distributed Computational Models, pp. 1–5 (2002)

    Google Scholar 

  16. Shukla, S., Rosenkrantz, D., Ravi, S.: Developing self-stabilizing coloring algorithms via systematic randomization. In: Proceedings of International, Workshop on Parallel Processing, pp. 668–673 (1994)

    Google Scholar 

  17. Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self- Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. In: Proceedings of the Fifth IPDPS Workshop on Advances in Parallel and Distributed Computational Models, Nice, France (April 22-26, 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Clemson University, Clemson, South Carolina, 29634, USA

    Z. Xu, S. T. Hedetniemi, W. Goddard & P. K. Srimani

Authors
  1. Z. Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. T. Hedetniemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. Goddard
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. K. Srimani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department SUNY at Stony Brook, NY 11794-4400, Stony Brook, USA

    Samir R. Das

  2. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, TX 76019, Arlington, USA

    Sajal K. Das

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K. (2003). A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. In: Das, S.R., Das, S.K. (eds) Distributed Computing - IWDC 2003. IWDC 2003. Lecture Notes in Computer Science, vol 2918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24604-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24604-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20745-0

  • Online ISBN: 978-3-540-24604-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation