Skip to main content
SpringerLink
Log in

An Ant Colony Optimization Approach for the Dominating Tree Problem

  • Conference paper
  • First Online:
Book cover Swarm, Evolutionary, and Memetic Computing (SEMCCO 2015)

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

Included in the following conference series:

  • 746 Accesses

Abstract

Dominating tree problem (DTP) seeks a tree DT with minimum total edge weight on a given edge-weighted, connected, and undirected graph so that each vertex of the graph is either a member of DT or adjacent to at least one of the vertices in DT. It is a \(\mathcal {NP}\)-Hard problem and finds its root in providing virtual backbone for routing in wireless sensor networks. For this problem, this paper proposes an ant colony optimization (DT-ACO) approach which is different from an existing ant colony optimization (ACO) approach for the DTP. The differences lie in new strategies for two components, viz. solution construction and update of pheromone trails. These new strategies help DT-ACO in exploring high quality solutions in much lesser time in comparison to existing ACO approach as well as another swarm-based metaheuristic approach for the DTP in the literature. Computational results show that DT-ACO outperforms these two swarm-based approaches in terms of solution quality and execution time both.

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. Shin, I., Shen, Y., Thai, M.T.: On approximation of dominating tree in wireless sensor networks. Optim. Lett. 4, 393–403 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Zhang, N., Shin, I., Li, B., Boyaci, C., Tiwari, R., Thai, M.T.: New approximation for minimum-weight routing backbone in wireless sensor network. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 96–108. Springer, Heidelberg (2008). doi:10.1007/978-3-540-88582-5_12

    Chapter  Google Scholar 

  3. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Park, M., Wang, C., Willson, J., Thai, M.T., Wu, W., Farago, A.: A dominating and absorbent set in wireless ad-hoc networks with different transmission range. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) (2007)

    Google Scholar 

  5. Thai, M.T., Tiwari, R., Du, D.-Z.: On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Trans. Mob. Comput. 7, 1–12 (2008)

    Article  Google Scholar 

  6. Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.-Z.: Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mob. Comput. 6, 721–730 (2007)

    Article  Google Scholar 

  7. Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction on connected dominating set in wireless ad hoc networks. In: Proceedings of the Conference of the IEEE Communications Society (INFOCOM) (2002)

    Google Scholar 

  8. Chaurasia, S.N., Singh, A.: A hybrid heuristic for dominating tree problem. Soft Comput. 20, 377–397 (2016)

    Article  Google Scholar 

  9. Sundar, S.: A steady-state genetic algorithm for the dominating tree problem. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 48–57. Springer, Heidelberg (2014). doi:10.1007/978-3-319-13563-2_5

    Google Scholar 

  10. Sundar, S., Singh, A.: New heuristic approaches for the dominating tree problem. Appl. Soft Comput. 13, 4695–4703 (2013)

    Article  Google Scholar 

  11. Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy, Technical Report 91-016. Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy (1991)

    Google Scholar 

  12. Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis. Dipartimento di Elettronica, Politecnico di Milano, Italy (1992). [in Italian]

    Google Scholar 

  13. Colorni, A., Dorigo, M., Maniezzo, V.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  14. Gambardella, L.M., Dorigo, M.: Ant colonies for the traveling salesman problem. BioSyst. 43, 7381 (1997)

    Google Scholar 

  15. Gambardella, L.M., Dorigo, M.: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 5366 (1997)

    Google Scholar 

  16. Stützle, T., Hoos, H.H.: Improving the ant system: a detailed report on the \({\cal{MAX-MIN}}\) ant system, Technical report AIDA-96-12, FG Intellektik, FB Informatic, TU Darmstadt, Germany (1996)

    Google Scholar 

  17. Stützle, T., Hoos, H.H.: \({\cal{MAX-MIN}}\) ant system. Future Gener. Comput. Syst. 16, 889–914 (2000)

    Google Scholar 

  18. Sundar, S., Singh, A.: New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195, 226–240 (2012)

    Article  MathSciNet  Google Scholar 

  19. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  20. Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)

    Article  Google Scholar 

  21. Stützle, T., Hoos, H.H.: New heuristic approaches for the dominating tree problem. Future Gener. Comput. Syst. 16, 889–914 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, Chhattisgarh, India

    Shyam Sundar

  2. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, Telangana, India

    Sachchida Nand Chaurasia & Alok Singh

Authors
  1. Shyam Sundar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sachchida Nand Chaurasia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alok Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alok Singh .

Editor information

Editors and Affiliations

  1. IIT, New Dehli, India

    Bijaya Ketan Panigrahi

  2. Nanyang Technological University, Singapore, Singapore

    Ponnuthurai Nagaratnam Suganthan

  3. Indian Statistical Institute, Kolkata, India

    Swagatam Das

  4. Department of Computer Science Engineering, Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, India

    Suresh Chandra Satapathy

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Sundar, S., Chaurasia, S.N., Singh, A. (2016). An Ant Colony Optimization Approach for the Dominating Tree Problem. In: Panigrahi, B., Suganthan, P., Das, S., Satapathy, S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2015. Lecture Notes in Computer Science(), vol 9873. Springer, Cham. https://doi.org/10.1007/978-3-319-48959-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48959-9_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48958-2

  • Online ISBN: 978-3-319-48959-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation