Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs
Graph coloring—also known as vertex coloring—considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimization version of the problem concerns the minimization of the number of colors used. In this paper we deal with the problem of finding valid graphs colorings in a distributed way, that is, by means of an algorithm that only uses local information for deciding the color of the nodes. The algorithm proposed in this paper is inspired by the calling behavior of Japanese tree frogs. Male frogs use their calls to attract females. Interestingly, groups of males that are located near each other desynchronize their calls. This is because female frogs are only able to correctly localize male frogs when their calls are not too close in time. The proposed algorithm makes use of this desynchronization behavior for the assignment of different colors to neighboring nodes. We experimentally show that our algorithm is very competitive with the current state of the art, using different sets of problem instances and comparing to one of the most competitive algorithms from the literature.
KeywordsDistributed graph coloring Calling behavior of Japanese tree frogs
The authors greatly appreciate the help by Enrico Malaguti who kindly provided experimental results of the centralized algorithm from Malaguti et al. (2008) for all problem instances.
Furthermore, we would like to thank Martin Middendorf who made us aware of the literature dealing with the calling behavior of Japanese tree frogs.
Finally, it is mandatory to mention the work of the Editor, Marco Dorigo, and the anonymous reviewers, who did a great job in helping to fine-tune the paper.
This work was supported by grant TIN2007-66523 (FORMALISM) of the Spanish government, and by the EU project FRONTS (FP7-ICT-2007-1). In addition, C. Blum acknowledges support from the Ramón y Cajal program of the Spanish Government, and H. Hernández acknowledges support from the Comissionat per a Universitats i Recerca del Departament d’Innovació, Universitats i Empresa de la Generalitat de Catalunya and from the European Social Fund.
- Battiti, R., Bertossi, A. A., & Brunato, M. (2000). Distributed saturation degree methods for code assignment in multihop radio networks. In WSDAAL 2000—Proceedings of the 5th workshop on distributed systems: algorithms, architectures and languages (pp. 18–20). Google Scholar
- Braunstein, A., Mulet, R., Pagnani, A., Weigt, M., & Zecchina, R. (2003). Polynomial iterative algorithms for coloring and analyzing random graphs. Physics Review E, 68, 15 pp. Google Scholar
- Degesys, J., & Nagpal, R. (2008). Towards desynchronization of multi-hop topologies. In S. Brueckner, P. Robertson, & U. Bellur (Eds.), SASO 2008—Proceedings of the 2nd IEEE international conference on self-adaptive and self-organizing systems (pp. 129–138). Piscataway: IEEE Press. CrossRefGoogle Scholar
- Dorne, R., & Hao, J. K. (1998). A new genetic local search algorithm for graph coloring. In A. Eiben, T. Bäck, M. Schoenauer, & H.-P. Schwefel (Eds.), Lecture notes in computer science: Vol. 1498. PPSN 1998—Proceedings of the 5th international conference on parallel problem solving from nature (pp. 745–755). Berlin: Springer. CrossRefGoogle Scholar
- Center for Discrete Mathematics and Theoretical Computer Science (2006). Dimacs implementation challenges. http://dimacs.rutgers.edu/Challenges/.
- Guo, C., Zhong, L. C., & Rabaey, J. M. (2001). Low power distributed mac for ad hoc sensor radio networks. In GLOBECOM 2001—IEEE global telecommunications conference, Vol. 5 (pp. 2944–2948). Piscataway: IEEE Press. Google Scholar
- Hansen, J., Kubale, M., Kuszner, Ł., & Nadolski, A. (2004). Distributed largest-first algorithm for graph coloring. In M. Danelutto, M. Vanneschi, & D. Laforenza (Eds.), Lecture notes in computer science: Vol. 3149. Euro-Par 2004—Proceedings of the 10th international European conference on parallel and distributed computing (pp. 804–811). Berlin: Springer. Google Scholar
- Herman, T., & Tixeuil, S. (2004). A distributed TDMA slot assignment algorithm for wireless sensor networks. In S. Nikoletseas & J. D. P. Rolim (Eds.), Lecture notes in computer science: Vol. 3121. ALGOSENSORS 2004—Proceedings of 1st international workshop on algorithmic aspects of wireless sensor networks (pp. 45–58). Berlin: Springer. CrossRefGoogle Scholar
- Hernández, H., & Blum, C. (2011). Implementing a model of Japanese tree frogs’ calling behavior in sensor networks: a study of possible improvements. In N. Krasnogor & P. L. Lanzi (Eds.), BIS-WSN 2011—Proceedings of the 1st international GECCO workshop on bio-inspired solutions for wireless sensor networks, Vol. 2 (pp. 615–622). New York: ACM Press. Google Scholar
- Kosowski, A., & Kuszner, Ł. (2006). On greedy graph coloring in the distributed model. In W. E. Nagel, W. V. Walter, & W. Lehner (Eds.), Lecture notes in computer science: Vol. 4128. Euro-Par 2006—Proceedings of the 12th international European conference on parallel and distributed computing (pp. 592–601). Berlin: Springer. Google Scholar
- Kroc, L., Sabharwal, A., & Selman, B. (2009). Counting solution clusters in graph coloring problems using belief propagation. In D. Koller, D. Schuurmans, Y. Bengio, & L. Bottou (Eds.), Proceedings of NIPS 2008—22nd annual conference on neural information processing systems (pp. 873–880). Cambridge: MIT Press. Google Scholar
- Kuhn, F., & Wattenhofer, R. (2006). On the complexity of distributed graph coloring. In PODC 2006—Proceedings of the 25th annual ACM symposium on principles of distributed computing (pp. 7–15). New York: ACM Press. Google Scholar
- Lee, S. A. (2008). Firefly inspired distributed graph coloring algorithms. In H. R. Arabnia & Y. Mun (Eds.), PDPTA 2008—Proceedings of the international conference on parallel and distributed processing techniques and applications (pp. 211–217). CSREA Press. Google Scholar
- Lee, S. A., & Lister, R. (2008). Experiments in the dynamics of phase coupled oscillators when applied to graph coloring. In ACSC 2008—Proceedings of the 31st Australasian conference on computer science (pp. 83–89). Darlinghurst: Australian Computer Society, Inc. Google Scholar
- Lu, G., Sadagopan, N., Krishnamachari, B., & Goel, A. (2005). Delay efficient sleep scheduling in wireless sensor networks. In K. Makki & E. Knightly (Eds.), INFOCOM 2005—Proceedings of the IEEE 24th international conference on computer communications (pp. 2470–2481). Piscataway: IEEE Press. Google Scholar
- Lynch, N. A. (2009). Distributed algorithms. San Mateo: Morgan Kaufmann. Google Scholar
- Mutazono, A., Sugano, M., & Murata, M. (2009). Frog call-inspired self-organizing anti-phase synchronization for wireless sensor networks. In INDS 2009—Proceedings of the 2nd international workshop on nonlinear dynamics and synchronization (pp. 81–88). Piscataway: IEEE Press. Google Scholar
- Panagopoulou, P., & Spirakis, P. (2008). A game theoretic approach for efficient graph coloring. In S.-H. Hong, H. Nagamochi, & T. Fukunaga (Eds.), Lecture notes in computer science: Vol. 5369. ISAAC 2008—Proceedings of the 19th international symposium on algorithms and computation (pp. 183–195). Berlin: Springer. Google Scholar
- Zivan, R. (2008). Anytime local search for distributed constraint optimization. In AAMAS 08—The 7th international joint conference on autonomous agents and multiagent systems, Vol. 3 (pp. 1449–1452). Richland: International Foundation for Autonomous Agents and Multiagent Systems. Google Scholar