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.

[1]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[2]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[3]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[4]  Adam Nadolski,et al.  Distributed Largest-First Algorithm for Graph Coloring , 2004, Euro-Par.

[5]  Panagiota N. Panagopoulou,et al.  A Game Theoretic Approach for Efficient Graph Coloring , 2008, ISAAC.

[6]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[7]  Mauro Brunato,et al.  Distributed Saturation Degree Methods for Code Assignment in Multihop Radio Networks , 2000 .

[8]  Paolo Toth,et al.  A Metaheuristic Approach for the Vertex Coloring Problem , 2008, INFORMS J. Comput..

[9]  Adrian Kosowski,et al.  On Greedy Graph Coloring in the Distributed Model , 2006, Euro-Par.

[10]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[11]  Graham Cormode,et al.  Discrete Methods in Epidemiology: Dimacs Workshop, Date Mining And Epidemioloogy, March 18-19, 2004, Dimacs Center, Rutgers University (Dimacs Series in ... and Theoretical Computer Science) , 2006 .

[12]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[13]  Marek Kubale,et al.  A better practical algorithm for distributed graph coloring , 2002, Proceedings. International Conference on Parallel Computing in Electrical Engineering.

[14]  R. Zecchina,et al.  Polynomial iterative algorithms for coloring and analyzing random graphs. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[16]  Huang Lee,et al.  Wakeup scheduling in wireless sensor networks , 2006, MobiHoc '06.

[17]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[18]  Roger Wattenhofer,et al.  On the complexity of distributed graph coloring , 2006, PODC '06.

[19]  Roger Wattenhofer,et al.  Coloring unstructured radio networks , 2005, SPAA '05.

[20]  Radhika Nagpal,et al.  Towards Desynchronization of Multi-hop Topologies , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems.

[21]  Roie Zivan.  Anytime Local Search for Distributed Constraint Optimization , 2008, AAAI.

[22]  Paolo Toth,et al.  An exact approach for the Vertex Coloring Problem , 2011, Discret. Optim..

[23]  Christian Blum,et al.  Implementing a model of Japanese tree frogs' calling behavior in sensor networks: a study of possible improvements , 2011, GECCO '11.

[24]  Alain Hertz,et al.  Variable space search for graph coloring , 2006, Discret. Appl. Math..

[25]  M. Birattari.  Swarm Intelligence From Scholarpedia , 2007 .

[26]  Cristian S. Calude,et al.  Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[27]  K. Wells.  The social behaviour of anuran amphibians , 1977, Animal Behaviour.

[28]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[29]  Sof Anthony Lee,et al.  k-Phase Oscillator Synchronization for Graph Coloring , 2010, Math. Comput. Sci..

[30]  Jessica L. Cundiff.  Center for Discrete Mathematics and Theoretical , 2012 .

[31]  Kazuyuki Aihara,et al.  Mathematical modeling of frogs’ calling behavior and its possible application to artificial life and robotics , 2008, Artificial Life and Robotics.

[32]  Christian Lavault,et al.  A distributed algorithm for constructing a minimum diameter spanning tree , 2004, J. Parallel Distributed Comput..

[33]  Martin J. Wainwright,et al.  A new look at survey propagation and its generalizations , 2004, SODA '05.

[34]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[35]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[36]  Christian Blum,et al.  Swarm Intelligence: Introduction and Applications , 2008, Swarm Intelligence.

[37]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

[38]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[39]  Alessandro Panconesi,et al.  An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms , 2002, SODA '02.

[40]  Jan M. Rabaey,et al.  Low power distributed MAC for ad hoc sensor radio networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[41]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[42]  Sof Anthony Lee.  Firefly inspired distributed graph coloring algorithms , 2008, PDPTA.

[43]  Bhaskar Krishnamachari,et al.  Delay efficient sleep scheduling in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[44]  Alfredo Navarra,et al.  On the complexity of distributed graph coloring with local minimality constraints , 2009, Networks.

[45]  Alfredo Navarra,et al.  On the complexity of distributed graph coloring with local minimality constraints , 2009 .

[46]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[47]  Bart Selman,et al.  Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation , 2008, NIPS.

[48]  M. Murata,et al.  Frog call-inspired self-organizing anti-phase synchronization for wireless sensor networks , 2009, 2009 2nd International Workshop on Nonlinear Dynamics and Synchronization.

[49]  Ikkyu Aihara,et al.  Modeling synchronized calling behavior of Japanese tree frogs. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[50]  Andrzej Pelc,et al.  Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.

[51]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[52]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[53]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[54]  Raymond Lister,et al.  Experiments in the dynamics of phase coupled oscillators when applied to graph colouring , 2008, ACSC.

[55]  Leonid Barenboim,et al.  Deterministic Distributed Vertex Coloring in Polylogarithmic Time , 2010, JACM.

[56]  Jin-Kao Hao,et al.  A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.

[57]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..