FrogSim: distributed graph coloring in wireless ad hoc networks
- 17 August 2013
- journal article
- research article
- Published by Springer Nature in Telecommunication Systems
- Vol. 55 (2) , 211-223
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Energy efficient transmission scheduling for infrastructure sensor nodes in location systemsComputer Networks, 2010
- Multi swarms for neighbor selection in peer-to-peer overlay networksTelecommunication Systems, 2010
- Providing trust in wireless sensor networks using a bio-inspired techniqueTelecommunication Systems, 2010
- A data collection protocol for real-time sensor applicationsPervasive and Mobile Computing, 2009
- Modeling synchronized calling behavior of Japanese tree frogsPhysical Review E, 2009
- A synchronous engine for wireless sensor networksTelecommunication Systems, 2008
- Mathematical modeling of frogs’ calling behavior and its possible application to artificial life and roboticsArtificial Life and Robotics, 2008
- An Experimental Analysis of Simple, Distributed Vertex Coloring AlgorithmsAlgorithmica, 2004
- A distributed algorithm for constructing a minimum diameter spanning treeJournal of Parallel and Distributed Computing, 2004
- The social behaviour of anuran amphibiansAnimal Behaviour, 1977