Skip to main content
SpringerLink
Log in

Vertex Domination in Dynamic Networks

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2008)

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

Included in the following conference series:

Abstract

This paper studies a vertex domination problem in dynamic networks, which allows dynamic change of the set of vertices, the set of edges, and the set of weights. In particular, we will examine the following two theoretical issues arising in designing an adaptive vertex domination scheme for such networks: 1) How can we transfer a given configuration to a dominating configuration while keeping that any intermediate configuration is safe? 2) How can we reduce the computational complexity of the vertex domination problem by allowing defections in the domination?

This research was partially supported by the Grant-in-Aid for Scientific Research, Priority Areas (B)(2) 16092219.

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. Atallah, M.J., Manacher, G.K., Urrutia, J.: Finding a minimum independent dominating set in a permutation graph. Discrete Appl. Math. 21, 177–183 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bange, D.W., Barkauskas, A.E., Slater, P.T.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189–199. SIAM (1988)

    Google Scholar 

  3. Bertossi, A.A.: On the domatic number of interval graphs. Information Processing Letters 28(6), 275–280 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chang, G.J., Rangan, C.P., Coorg, S.R.: Weighted independent perfect domination on cocomparability graphs. Technical Report 93-24, DIMACS (April 1993)

    Google Scholar 

  5. Cockayne, E.J., Hedetniemi, S.T.: Optimal domination in graphs. IEEE Trans. Circuit and Systems  CAS-22, 855–857 (1975)

    Article  MathSciNet  Google Scholar 

  6. Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks 7, 247–261 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 53(10), 1343–1354 (2004)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Fujita, S., Yamashita, M., Kameda, T.: A Study on r-Configurations – A Resource Assignment Problem on Graphs. SIAM J. Discrete Math. 13(2), 227–254 (2000)

    Article  MathSciNet  Google Scholar 

  10. Fujita, S., Liang, Y.: How to Provide Continuous Services by Mobile Servers in Communication Networks. In: Liew, K.-M., Shen, H., See, S., Cai, W. (eds.) PDCAT 2004. LNCS, vol. 3320, pp. 326–329. Springer, Heidelberg (2004)

    Google Scholar 

  11. Fujita, S.: A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability among Dominating Configurations. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 563–572. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Fujita, S.: Loose Covering by Graphs. In: Proc. of 2006 Japan-Korea Joint Workshop on Algorithms and Computation, pp. 9–15 (2006)

    Google Scholar 

  13. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)

    MATH  Google Scholar 

  14. Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. In: Proc. European Symposium on Algorithms, pp. 179–193 (1996)

    Google Scholar 

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

    Google Scholar 

  16. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, Inc. (1998)

    Google Scholar 

  17. Irving, R.W.: On approximating the minimum independent dominating set. Information Processing Letters 37, 197–200 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  18. Livingston, M., Stout, Q.F.: Perfect dominating sets. Congressus Numerantium 79, 187–203 (1990)

    MATH  MathSciNet  Google Scholar 

  19. Lu, T.L., Ho, P.H., Chang, G.J.: The domatic number problem in interval graphs. SIAM J. Disc. Math. 3, 531–536 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Matheson, L.R., Tarjan, R.E.: Dominating sets in planar graphs. Technical Report TR-461-94, Dept. of Computer Science, Princeton University (May 1994)

    Google Scholar 

  21. Rao, A.S., Rangan, C.P.: Linear algorithm for domatic number problem on interval graphs. Information Processing Letters 33(1), 29–33 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wu, J., Li, H.: Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links. In: Proc. of International Conference on Parallel Processing, pp. 189–200 (2000)

    Google Scholar 

  23. Wu, J.: Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links. IEEE Transactions on Parallel and Distributed Computing 22, 327–340 (2002)

    Google Scholar 

  24. Yen, C.C., Lee, R.C.T.: The weighted perfect domination problem. Information Processing Letters 35, 295–299 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering Graduate School of Engineering, Hiroshima University,  

    Satoshi Fujita

Authors
  1. Satoshi Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shin-ichi Nakano Md. Saidur Rahman

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujita, S. (2008). Vertex Domination in Dynamic Networks. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77891-2_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77890-5

  • Online ISBN: 978-3-540-77891-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation