Jump label

Service navigation

Main navigation

You are here:

Sub navigation

Main content


Horst F. Wedde, Muddassar Farooq und Yue Zhang
BeeHive - An Efficient Fault Tolerant Routing Algorithm under High Loads Inspired by Honey Bee Behavior
Proceedings of the Fourth International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), Hrsg.: Marco Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada und T. Stützle, Nr. 3172, S. 83-94, Spr, Brussels, Belgium, 2004-09


Bees organize their foraging activities as a social and com- municative effort, indicating both the direction, distance and quality of food sources to their fellow foragers through a ”dance” inside the bee hive (on the ”dance floor”). In this paper we present a novel routing algorithm, BeeHive, which has been inspired by the communicative and evaluative methods and procedures of honey bees. In this algorithm, bee agents travel through network regions called foraging zones. On their way their information on the network state is delivered for updating the local routing tables. BeeHive is fault tolerant, scalable, and relies com- pletely on local, or regional, information, respectively. We demonstrate through extensive simulations that BeeHive achieves a similar or better performance compared to state-of-the-art algorithms.


Weiterführende Informationen