Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!

  • Christian Blum
  • Maria J. Blesa
  • Borja Calvo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8667)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Online scientific news site ScienceDaily: Frog calls inspire a new algorithm for wireless networks (July 2012),
  2. 2.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    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)CrossRefzbMATHGoogle Scholar
  4. 4.
    Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer, London (2013)CrossRefzbMATHGoogle Scholar
  5. 5.
    Erciyes, K., Dagdeviren, O., Cokuslu, D., Yilmaz, O., Gumus, H.: Modeling and Simulation of Mobile Ad hoc Networks, pp. 134–168. CRC Press (2010)Google Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman (1979)Google Scholar
  7. 7.
    Halldórsson, M.M., Radhakrishnan, J.: Greedy is Good: Appriximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18, 145–163 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. Tech. rep., ArXiv repository (2012),
  11. 11.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Christian Blum
    • 1
    • 2
  • Maria J. Blesa
    • 3
  • Borja Calvo
    • 1
  1. 1.Department of Computer Science and Artificial IntelligenceUniversity of the Basque Country UPV/EHUSan SebastianSpain
  2. 2.IKERBASQUE, Basque Foundation for ScienceBilbaoSpain
  3. 3.ALBCOM Research GroupUniversitat Politécnica de CatalunyaBarcelonaSpain

Personalised recommendations