Skip to main content
SpringerLink
Log in

A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence

  • Conference paper
Book cover Principles of Distributed Systems (OPODIS 2008)

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

Included in the following conference series:

Abstract

In wireless ad hoc or sensor networks, a connected dominating set is useful as the virtual backbone because there is no fixed infrastructure or centralized management. Additionally, in such networks, transient faults and topology changes occur frequently.

A self-stabilizing system tolerates any kind and any finite number of transient faults, and does not need any initialization. An ordinary self-stabilizing algorithm has no safety guarantee and requires that the network remains static during converging to the legitimate configuration. Safe converging self-stabilization is one of the extension of self-stabilization which is suitable for dynamic networks such that topology changes and transient faults occur frequently. The safe convergence property guarantees that the system quickly converges to a safe configuration, and then, it moves to an optimal configuration without breaking safety.

In this paper, we propose a self-stabilizing 7.6-approximation algorithm with safe convergence for the minimum connected dominating set in the networks modeled by unit disk graphs.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gärtner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys 31(1), 1–26 (1999)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. Kakuagwa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: Proceedings IPDPS Workshop on Advances on Parallel and Distributed Computational Model (APDCM), p. 263 (2006)

    Google Scholar 

  6. Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 3(4), 1–40 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ghosh, S., Bejan, A.: A framework of safe stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 129–140. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Cobb, J.A., Gouda, M.G.: Stabilization of general loop-free routing. Journal of Parallel and Distributed Computing 62, 922–944 (2002)

    Article  MATH  Google Scholar 

  9. Johnen, C., Tixeuil, S.: Routing preserving stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 184–198. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Kamei, S., Kakugawa, H.: A self-stabilizing approximation algorithm for the minimum weakly connected dominating set with safe convergence. In: Proceedings of the 1st International Workshop on Reliability, Availability, and Security (WRAS), pp. 57–66 (2007)

    Google Scholar 

  11. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, pp. 329–369. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  12. Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Networks and Mobile Computing 3(2), 155–173 (2003)

    Article  Google Scholar 

  13. Gao, B., Yang, Y., Ma, H.: A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks. International Journal of Communication System 18, 743–762 (2005)

    Article  Google Scholar 

  14. Cheng, X., Du, D.Z.: Virtual backbone-based routing in multihop ad hoc wireless networks. Technical report, University of Minnesota (2002)

    Google Scholar 

  15. Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications 9(2), 141–149 (2004)

    Article  Google Scholar 

  16. Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C.H., Wu, W.: Improving construction for connected dominating set with Steiner tree in wireless sensor networks. Journal of Global Optimization 35, 111–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Li, Y., Thai, M.T., Wang, F., Yi, C.W., Wan, P.J., Du, D.X.: On greedy construction of connected dominating sets in wireless networks. Wireless Communications and Mobile Computing 5, 927–932 (2005)

    Article  Google Scholar 

  18. Jain, A., Gupta, A.: A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In: Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 615–619 (2005)

    Google Scholar 

  19. Drabkin, V., Friedman, R., Gradinariu, M.: Self-stabilizing wireless connected overlays. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 425–439. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Kamei, S., Kakugawa, H.: A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM), p. 224 (2007)

    Google Scholar 

  21. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59–68 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Herman, T., Ghosh, S.: Stabilizing phase-clocks. Information Processing Letters 54(5), 259–265 (1995)

    Article  MATH  Google Scholar 

  23. Berge, C.: Theory of Graphs and its Applications. Methuen (1962)

    Google Scholar 

  24. Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352(1), 1–7 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  25. Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers 43, 1026–1038 (1994)

    Article  MATH  Google Scholar 

  26. Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems 8(4), 424–440 (1997)

    Article  Google Scholar 

  27. Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile network. IEEE Transacctions on Parallel and Distributed Systems 19(7), 926–939 (2008)

    Article  MATH  Google Scholar 

  28. Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming the distributed demon. Computers and Mathematics with Applications 50(5-6), 671–681 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  29. Hedetniemi, S.M., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Computers and Mathematics with Applications 46(5-6), 805–811 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima, Hiroshima, 739-8527, Japan

    Sayaka Kamei

  2. Dept. of Computer Science, Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama-cyo, Toyonaka, Osaka, 560-8531, Japan

    Hirotsugu Kakugawa

Authors
  1. Sayaka Kamei
    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

Editor information

Editors and Affiliations

  1. Department of Computer Science, Florida State University, 207A Love Building, PO Box 4530, FL 32306-4530, Tallahassee, USA

    Theodore P. Baker

  2. Université de Versailles-St-Quentin-en-Yvelines, 45, avenue des Etats-Unis, 78035, Versailles Cedex, France

    Alain Bui

  3. LIP6 & INRIA Grand Large, Université Pierre et Marie Curie - Paris 6, 104 avenue du Président Kennedy, 75016, Paris, France

    Sébastien Tixeuil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamei, S., Kakugawa, H. (2008). A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence. In: Baker, T.P., Bui, A., Tixeuil, S. (eds) Principles of Distributed Systems. OPODIS 2008. Lecture Notes in Computer Science, vol 5401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92221-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92221-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92220-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation