FrogSim: Distributed graph coloring in wireless ad hoc networks: An algorithm inspired by the calling behavior of Japanese tree frogs

Telecommunication Systems

Volumn 55, Issue 2, 2014, Pages 211-223

  Hernández, Hugo ^a   Blum, Christian ^b,c  

^a PRINCE OF SONGKLA UNIVERSITY   (Thailand)

^b UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^c BASQUE FOUNDATION FOR SCIENCE   (Spain)

Author keywords

Distributed graph coloring; Swarm Intelligence; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COLOR; FORESTRY; SCHEDULING; TIME DIVISION MULTIPLE ACCESS; WIRELESS AD HOC NETWORKS;

ADJACENT NODES; DATA COLLECTION; DESYNCHRONIZATION; GRAPH COLORINGS; MINIMIZING THE NUMBER OF; STATE-OF-THE-ART APPROACH; SWARM INTELLIGENCE; WAKE-UP SCHEDULING;

TREES (MATHEMATICS);

COLOR; FORESTRY; SCHEDULING;

EID: 84901693608     PISSN: 10184864     EISSN: 15729451     Source Type: Journal    
DOI: 10.1007/s11235-013-9776-0     Document Type: Conference Paper

References (24)

1. Abraham, A., Liu, H., Hassanien, A. E. (2011). Multi swarms for neighbor selection in peer-to-peer overlay networks. Telecommunications Systems, 46(3), 195-208.
2. Aihara, I. (2009). Modeling synchronized calling behavior of Japanese tree frogs. Physical Review E, 80(1), 11-18.
3. Aihara, I., Kitahata, H., Yoshikawa, K., Aihara, K. (2008). Mathematical modeling of frogs' calling behavior and its possible application to artificial life and robotics. Artificial Life and Robotics, 12(1), 29-32.
4. Blum, C. Merkle, D. (Eds.) (2008). Swarm intelligence: introduction and applications. Natural computing. Berlin: Springer.
5. Bonabeau, E., Dorigo, M., Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems. New York: Oxford University Press.
6. Bui, M., Butelle, F., Lavault, C. (2004). A distributed algorithm for constructing a minimum diameter spanning tree. Journal of Parallel and Distributed Computing, 64(5), 571-577.
7. DIMACS: DIMACS implementation challenges (2006). http://dimacs.rutgers. edu/Challenges/.
8. Finocchi, I., Panconesi, A., Silvestri, R. (2005). An experimental analysis of simple, distributed vertex coloring algorithms. Algorithmica, 41(1), 1-23.
9. Gómez Mármol, F., Martínez Pérez, G. (2011). Providing trust in wireless sensor networks using a bio-inspired technique. Telecommunications Systems, 46(2), 163-180.
10. Hernández, H., Blum, C. (2011). Distributed graph coloring in wireless ad hoc networks: a light-weight algorithm based on Japanese tree frogs' calling behaviour. In Proceedings of WMNC 2011 - the 4th joint IFIP wireless and mobile networking conference (pp. 1-7). Piscataway: IEEE Press. This article won the best paper award.
11. Karp, R. (1972). Reducibility among combinatorial problems. In Proceedings of the symposium on complexity of computer computations (p. 85).
12. Keshavarzian, A., Lee, H., Venkatraman, L. (2006). Wakeup scheduling in wireless sensor networks. In MobiHoc 06 - proceedings of the 7th ACM international symposium on mobile ad-hoc networking and computing (pp. 322-333). New York: ACM. (Pubitemid 44300730)
13. Lee, J., Bahk, S., Choi, J. G. (2010). Energy efficient transmission scheduling for infrastructure sensor nodes in location systems. Computer Networks, 54, 3295-3308.
14. Lee, S. (2008). Firefly inspired distributed graph coloring algorithms. In H. R. Arabnia Y. Mun (Eds.), Proceedings of PDPTA 2008 - international conference on parallel and distributed processing techniques and applications (pp. 211-217). Athens: CSREA Press.
15. Lee, S. (2010). k-Phase oscillator synchronization for graph coloring. Mathematics in Computer Science, 3(1), 61-72.
16. Lee, S., Lister, R. (2008). Experiments in the dynamics of phase coupled oscillators when applied to graph coloring. In Proceedings of ACSC 2008 - proceedings of the thirty-first Australasian conference on computer science (pp. 83-89). Sydney: Australian Computer Society.
17. Lynch, N. A. (2009). Distributed algorithms. Amsterdam: Elsevier.
18. Mutazono, A., Sugano, M., Murata, M. (2009). Frog call-inspired self-organizing anti-phase synchronization for wireless sensor networks. In INDS 09 - proceedings of the 2nd international workshop on nonlinear dynamics and synchronization (pp. 81-88). New York: IEEE Press.
19. Paradis, L., Han, Q. (2009). A data collection protocol for real-time sensor applications. Pervasive and Mobile Computing, 5, 369-384.
20. Rhee, I., Warrier, A., Min, J., Xu, L. (2009). DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks. IEEE Transactions on Mobile Computing, 8(10), 1384-1396.
21. Royo, R., Olivares, T., Orozco-Barbosa, L. (2009). A synchronous engine for wireless sensor networks. Telecommunications Systems, 40(3-4), 151-159.
22. Vergados, D. J., Sgora, A., Vergados, D. D., Vouyioukas, D., Anagnostopoulos, I. (2012). Fair TDMA scheduling in wireless multihop networks. Telecommunication Systems, 50(3), 181-198.
23. Wells, K. (1977). The social behaviour of anuran amphibians. Animal Behaviour, 25, 666-693. (Pubitemid 8192182)
24. Zivan, R. (2008). Anytime local search for distributed constraint optimization. In Proceedings of AAMAS 08 - the 7th international joint conference on autonomous agents and multiagent systems (Vol. 3, pp. 1449-1452). Richland: International Foundatin for Autonomous Agents and Multiagent Systems.