Skip to main content
SpringerLink
Log in

FrogSim: distributed graph coloring in wireless ad hoc networks

An algorithm inspired by the calling behavior of Japanese tree frogs

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Graph coloring, which is at the heart of several problems arising in wireless ad hoc networks, concerns the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. This paper deals with the problem of generating valid colorings in a distributed way, while minimizing the number of colors used. Examples of related problems in wireless ad hoc networks are TDMA slot assignment, wakeup scheduling, and data collection. The presented algorithm is inspired by the desynchronization observed in the context of the calling behaviour of male Japanese tree frogs. Experimental results indicate that the proposed algorithm is very competitive with current state-of-the-art approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2
Fig. 3
Algorithm 2
Fig. 4

Similar content being viewed by others

Notes

  1. Note that θ i corresponds to the phase value of an oscillator from the model by Aihara et al. [3]. Moreover, recall that these phase values change over time and that the evolution of the phase value over time is different for each node.

References

  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.

    Article  Google Scholar 

  2. Aihara, I. (2009). Modeling synchronized calling behavior of Japanese tree frogs. Physical Review E, 80(1), 11–18.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  4. Blum, C. & Merkle, D. (Eds.) (2008). Swarm intelligence: introduction and applications. Natural computing. Berlin: Springer.

    Google Scholar 

  5. Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems. New York: Oxford University Press.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Chapter  Google Scholar 

  11. Karp, R. (1972). Reducibility among combinatorial problems. In Proceedings of the symposium on complexity of computer computations (p. 85).

    Chapter  Google Scholar 

  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.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Google Scholar 

  15. Lee, S. (2010). k-Phase oscillator synchronization for graph coloring. Mathematics in Computer Science, 3(1), 61–72.

    Article  Google Scholar 

  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.

    Google Scholar 

  17. Lynch, N. A. (2009). Distributed algorithms. Amsterdam: Elsevier.

    Google Scholar 

  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.

    Google Scholar 

  19. Paradis, L., & Han, Q. (2009). A data collection protocol for real-time sensor applications. Pervasive and Mobile Computing, 5, 369–384.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  21. Royo, R., Olivares, T., & Orozco-Barbosa, L. (2009). A synchronous engine for wireless sensor networks. Telecommunications Systems, 40(3–4), 151–159.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  23. Wells, K. (1977). The social behaviour of anuran amphibians. Animal Behaviour, 25, 666–693.

    Article  Google Scholar 

  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 Foundation for Autonomous Agents and Multiagent Systems.

    Google Scholar 

Download references

Acknowledgements

Thanks to the organizers of WMNC 2012 for inviting us to contribute to this special issue.

Author information

Authors and Affiliations

  1. Faculty of Technology and Environment, Prince of Songkla University, Phuket Campus, Thailand

    Hugo Hernández

  2. Department of Computer Science and Artificial Intelligence, University of the Basque Country, San Sebastian, Spain

    Christian Blum

  3. IKERBASQUE, Basque Foundation for Science, Bilbao, Spain

    Christian Blum

Authors
  1. Hugo Hernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Blum.

Additional information

This work was supported by grant TIN2012-37930 of the Spanish Government. In addition, support is acknowledged from IKERBASQUE (Basque Foundation for Science).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hernández, H., Blum, C. FrogSim: distributed graph coloring in wireless ad hoc networks. Telecommun Syst 55, 211–223 (2014). https://doi.org/10.1007/s11235-013-9776-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-013-9776-0

Keywords

Search

Navigation