Abstract
The problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility location and backbone formation. In this paper we study the ability of a bio-inspired, distributed algorithm, initially proposed for graph coloring, to generate large independent sets. The inspiration of the considered algorithm stems from the self-synchronization capability of Japanese tree frogs. The experimental results confirm, indeed, that the algorithm has a strong tendency towards the generation of colorings in which the set of nodes assigned to the most-used color is rather large. Experimental results are compared to the ones of recent algorithms from the literature. Concerning solution quality, the results show that the frog-inspired algorithm has advantages especially for the application to rather sparse graphs. Concerning the computation round count, the algorithm has the advantage of converging within a reasonable number of iterations, regardless of the size and density of the considered graph.
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
Online scientific news site ScienceDaily: Frog calls inspire a new algorithm for wireless networks (July 2012), http://www.sciencedaily.com/releases/2012/07/120717100123.htm
Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science 331, 183–185 (2011)
Bui, M., Butelle, F., Lavault, C.: A distributed algorithm for constructing a minimum diameter spanning tree. Journal of Parallel and Distributed Computing 64(5), 571–577 (2004)
Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer, London (2013)
Erciyes, K., Dagdeviren, O., Cokuslu, D., Yilmaz, O., Gumus, H.: Modeling and Simulation of Mobile Ad hoc Networks, pp. 134–168. CRC Press (2010)
Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman (1979)
Halldórsson, M.M., Radhakrishnan, J.: Greedy is Good: Appriximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18, 145–163 (1997)
Hernández, H., Blum, C.: Distributed graph coloring: An approach based on the calling behavior of japanese tree frogs. Swarm Intelligence 6(2), 117–150 (2012)
Hernández, H., Blum, C.: FrogSim: distributed graph coloring in wireless ad hoc networks — an algorithm inspired by the calling behavior of Japanese tree frogs. Telecommunication Systems (2013)
Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. Tech. rep., ArXiv repository (2012), http://arxiv.org/abs/1211.0235
Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. In: Fatourou, P., Taubenfeld, G. (eds.) Proceedings of PODC 2013 – ACM Symposium on Principles of Distributed Computing, pp. 147–156. ACM Press (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Blum, C., Blesa, M.J., Calvo, B. (2014). Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2014. Lecture Notes in Computer Science, vol 8667. Springer, Cham. https://doi.org/10.1007/978-3-319-09952-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-09952-1_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09951-4
Online ISBN: 978-3-319-09952-1
eBook Packages: Computer ScienceComputer Science (R0)