Skip to main content
SpringerLink
Log in

Approximation Algorithms for Permanent Dominating Set Problem on Dynamic Networks

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10722))

Abstract

A temporal graph is a graph whose node and/or edge set changes with time. Many dynamic networks in practice can be modeled as temporal graphs with different properties. Finding different types of dominating sets in such graphs is an important problem for efficient routing, broadcasting, or information dissemination in the network. In this paper, we address the problems of finding the minimum permanent dominating set and maximum k-dominant node set in temporal graphs modeled as evolving graphs. The problems are first shown to be NP-hard. A \(\ln (n\tau )\)-approximation algorithm is then presented for finding a minimum permanent dominating set, where n is the number of nodes, and \(\tau \) is the lifetime of the given temporal graph. Detailed simulation results on some real life data sets representing different networks are also presented to evaluate the performance of the proposed algorithm. Finally, a \((1-\frac{1}{e})\)-approximation algorithm is presented for finding a maximum k-dominant node set.

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

References

  1. Casteigts, A., Flocchini, P.: Deterministic algorithms in dynamic networks: Problems, analysis, and algorithmic tools, Technical report, DRDC 2013-020 (2013)

    Google Scholar 

  2. Chaintreau, A., Hui, P., Scott, J., Gass, R., Crowcroft, J., Diot, C.: Impact of human mobility on opportunistic forwarding algorithms. IEEE Trans. Mobile Comput. 6, 606–620 (2007)

    Article  Google Scholar 

  3. Dubois, S., Kaaouachi, M., Petit, F.: Enabling minimal dominating set in highly dynamic distributed systems. In: Stabilization, Safety, and Security of Distributed Systems - 17th International Symposium, SSS, 18–21 August, pp. 51–66 (2015)

    Google Scholar 

  4. Ferreira, A.: On models and algorithms for dynamic communication networks: the case for evolving graphs. In: 4e Rencontres Francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL), pp. 155–161 (2002)

    Google Scholar 

  5. Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Discrete mobile centers. In: 17th Annual Symposium on Computational Geometry, 3–5 June, pp. 188–196 (2001)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  7. Gemmetto, V., Barrat, A., Cattuto, C.: Mitigation of infectious disease at school: targeted class closure vs school closure. BMC Infect. Dis. 14, 695 (2014)

    Article  Google Scholar 

  8. Guibas, L.J., Milosavljevic, N., Motskin, A.: Connected dominating sets on dynamic geometric graphs. Comput. Geom. 46, 160–172 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hershberger, J.: Smooth kinetic maintenance of clusters. In: 19th ACM Symposium on Computational Geometry, 8–10 June, pp. 48–57 (2003)

    Google Scholar 

  10. Jain, S., Fall, K.R., Patra, R.K.: Routing in a delay tolerant network. In: ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 145–158 (2004)

    Google Scholar 

  11. Kostakos, V.: Temporal graphs. Phys. A 388, 1007–1023 (2009)

    Article  MathSciNet  Google Scholar 

  12. Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 21–24 August, pp. 177–187 (2005)

    Google Scholar 

  13. Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection, June 2014. http://snap.stanford.edu/data

  14. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14, 265–294 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  15. Parekh, A.K.: Analysis of a greedy heuristic for finding small dominating sets in graphs. Inf. Process. Lett. 39, 237–240 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ros, F.J., Ruiz, P.M.: Minimum broadcasting structure for optimal data dissemination in vehicular networks. IEEE Trans. Veh. Technol. 62, 3964–3973 (2013)

    Article  Google Scholar 

  17. Siljak, D.: Dynamic graphs. Nonlinear Anal. Hybrid Syst. 2, 544–567 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Stehl, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J., Quaggiotto, M., Van den Broeck, W., Rgis, C., Lina, B., Vanhems, P.: High-resolution measurements of face-to-face contact patterns in a primary school. PLOS ONE 6, e23176 (2011)

    Article  Google Scholar 

  19. Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst. 13, 14–25 (2002)

    Article  Google Scholar 

  20. Whitbeck, J., de Amorim, M.D., Conan, V., Guillaume, J.: Temporal reachability graphs. In: 18th Annual International Conference on Mobile Computing and Networking, Mobicom 2012, 22–26 August, pp. 377–388 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India

    Subhrangsu Mandal & Arobinda Gupta

Authors
  1. Subhrangsu Mandal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arobinda Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Subhrangsu Mandal .

Editor information

Editors and Affiliations

  1. University of Hyderabad, Hyderabad, India

    Atul Negi

  2. University of Cincinnati, Cincinnati, Ohio, USA

    Raj Bhatnagar

  3. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA

    Laxmi Parida

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mandal, S., Gupta, A. (2018). Approximation Algorithms for Permanent Dominating Set Problem on Dynamic Networks. In: Negi, A., Bhatnagar, R., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2018. Lecture Notes in Computer Science(), vol 10722. Springer, Cham. https://doi.org/10.1007/978-3-319-72344-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72344-0_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72343-3

  • Online ISBN: 978-3-319-72344-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation