Skip to main content
SpringerLink
Log in

Two new heuristics for the dominating tree problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Dominating Tree Problem (DTP) aims to find a dominating tree (d T r e e) of minimum cost on a given connected, undirected and weighted graph in such a way that a vertex in the graph is either in d T r e e or adjacent to a vertex in d T r e e. A solution (d T r e e) to this problem can be used as routing backbone in wireless sensor network. Being a \(\mathcal {NP}\)-Hard problem, several problem-specific heuristics and metaheuristic techniques have been proposed. This paper presents two new heuristics for the DTP. First one is a new problem-specific heuristic that exploits the problem structure effectively, whereas the other is an artificial bee colony (ABC) algorithm. The proposed ABC for the DTP is different from the existing ABC algorithm for the DTP in the literature on its two main components: initial solution generation, and determining a neighboring solution. Computational results show on a set of standard benchmark instances that the proposed problem-specific heuristic and ABC algorithm for the DTP demonstrate the superiority over all existing problem-specific heuristics and metaheuristic techniques respectively in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Arkin E, Halldorssom M, Hassin R (1993) Approximating the tree and tour covers of a graph. Inf Process Lett 47:275–282

    Article  MathSciNet  MATH  Google Scholar 

  2. Chaurasia SN, Singh A (2016) A hybrid heuristic for dominating tree problem. Soft Comput Springer 20:1–21

    Article  Google Scholar 

  3. Drazic Z, Cangalovic M, Kovacevic-Vujcic V (2017) A metaheuristic approach to the dominating tree problem. Optim Lett Springer 11:1155–1167

    Article  MathSciNet  MATH  Google Scholar 

  4. Fujito T (2001) On approximability of the independent/connected edge dominating set problems. Inf Process Lett 79:261–266

    Article  MathSciNet  MATH  Google Scholar 

  5. Fujito T (2006) How to trim an MST: A 2-approximation algorithm for minimum cost tree cover. In: Proceedings of the 33rd international colloquium on automata, languages and programming, ICALP, Part I. Venice, July 10-14, 2006, pp 431–442

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Computer Engineering Department Engineering Faculty. Erciyes University, Turkey

    Google Scholar 

  8. Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21–57

    Article  Google Scholar 

  9. Park M, Wang C, Willson J, Thai M, Wu W, Farago A (2007) 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)

  10. Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Techn J 36:1389–1401

    Article  Google Scholar 

  11. Shin I, Shen Y, Thai M (2010) On approximation of dominating tree in wireless sensor networks. Optim Lett 4:393–403

    Article  MathSciNet  MATH  Google Scholar 

  12. Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput Elsevier 9:625–631

    Article  Google Scholar 

  13. Sundar S (2014) A steady-state genetic algorithm for the dominating tree problem. In: Proceedings of the tenth international conference on simulated evolution and learning (SEAL 2014), LNCS, vol 8886. Springer-Verlag, Dunedin, pp 48–57

  14. Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci Elsevier 180:3182–3191

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  16. Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput Springer 21:1193–1202

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. Wan P, Alzoubi KM, Frieder O (2002) Distributed construction on connected dominating set in wireless ad hoc networks. In: Proceedings IEEE INFOCOM 2002, the 21st annual joint conference of the IEEE computer and communications societies. New York, June 23-27, 2002, pp 1597–1604

  20. Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M 1999). Seattle, Washington, August 20, 1999, pp 7–14

  21. Zhang N, Shin I, Li B, Boyaci C, Tiwari R, Thai M (2008) New approximation for minimum-weight routing backbone in wireless sensor network. In: Lecture notes in computer science, vol 5258. Springer-Verlag, Berlin, pp 96–108

Download references

Author information

Authors and Affiliations

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

    Kavita Singh & Shyam Sundar

Authors
  1. Kavita Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shyam Sundar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shyam Sundar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, K., Sundar, S. Two new heuristics for the dominating tree problem. Appl Intell 48, 2247–2267 (2018). https://doi.org/10.1007/s10489-017-1075-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-017-1075-0

Keywords

Search

Navigation