Abstract
In this paper, we present some observations on the various algorithms proposed to find a Minimum Independent Dominating Set (MIDS). MIDS is proven to be an NP-hard problem. We compared an exact algorithm based on intelligent subset enumeration with another exact algorithm based on matching in graphs. We found that the former performs better than the latter for small graphs despite having a worse asymptotic complexity. There is only one Polynomial Time Approximation Scheme (PTAS) proposed in literature for computing MIDS which works for polynomially bounded growth graphs. We observed that changing the ε value in the PTAS reduces the running time quite drastically but does not increase the cardinality returned significantly. We compared the cardinality of the IDS returned by various heuristics for grid, unit disk graph and general graph topologies. The results show that the highest degree heuristic returns the best cardinality amongst all these algorithms in literature for all graphs except grid graphs for which the inter-dominator 3-hop distance heuristic performs better. To the best of our knowledge, this is the first empirical study where the exact, PTAS and heuristic solutions to the MIDS problem have been compared in terms of the quality of the solution returned as well as provide insights into the behavior of these approaches for various types of graphs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Erciyes, K., Dagdeviren, O., Cokuslu, D., Ozsoyeller, D.: Graph Theoretic Clustering Algorithms in Mobile Ad Hoc Networks and Wireless Sensor Networks. Appl. Comput. Math. (2), 162–180 (2007)
Chen, Y.P., Liestman, A.L., Liu, J.: Clustering algorithms for ad hoc wireless networks. Ad Hoc and Sensor Networks, 145–164 (2006)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7), 1265–1275 (1997)
Nocetti, F.G., Gonzalez, J.S., Stojmenovic, I.: Connectivity-based k-hop clustering in wireless networks. Telecommunication Systems 22(1-4), 205–220 (2003)
Basagni, S.: Distributed clustering for ad hoc networks. In: Proceedings ISPAN, International Symposium on Parallel Architectures, Algorithms and Networks, pp. 310–315 (1999)
Santos, A.C., Bendali, F., Mailfert, J., Duhamel, C., Hou, K.M.: Heuristic for designing energy-efficient wireless sensor network topologies. Journal of Networks 4(6), 436–444 (2009)
McLaughlan, B., Akkaya, K.: Coverage-based clustering of wireless sensor and actor networks. In: Proceedings International Conference on Pervasive Services, pp. 45–54 (2007)
Garey, M.R., Johnson, D.S.: Computers and Tractability, A guide to the theory of NP-Completeness. Freeman and Company, New York (1979)
Clark, B.N., Colbourn, C.J.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1990)
Halldrsson, M.M.: Approximating the minimum maximal independence number. Information Processing Letters 46(4), 169–172 (1993)
Liu, C., Song, Y.: Exact algorithms for finding the minimum independent dominating set in graphs. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 439–448. Springer, Heidelberg (2006)
Gaspers, S., Liedloff, M.: A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 78–89. Springer, Heidelberg (2006)
Bourgeois, N., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. CoRR abs/0905.1993 (2009)
Hurink, J.L., Nieberg, T.: Approximating minimum independent dominating sets in wireless networks. Information Processing Letters, 155–160 (2008)
Loughry, J., van Hemert, J., Schoofs, L.: Efficiently enumerating the subsets of a set (2000), http://applied-math.org/subset.pdf
Mastrogiovanni, M.: The clustering simulation framework: A simple manual (2007), http://www.michele-mastrogiovanni.net/software/download/README.pdf
Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite: An approach to universal topology generation. In: Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, MASCOTS 2001 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Potluri, A., Negi, A. (2011). Some Observations on Algorithms for Computing Minimum Independent Dominating Set. In: Aluru, S., et al. Contemporary Computing. IC3 2011. Communications in Computer and Information Science, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22606-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-22606-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22605-2
Online ISBN: 978-3-642-22606-9
eBook Packages: Computer ScienceComputer Science (R0)