Abstract
Bees organize their foraging activities as a social and communicative 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 completely 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barán, B., Sosa, R.: A new approach for antnet routing. In: Proceedings of the Ninth International Conference on Computer, Communications and Networks (2000)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Oxford (1999)
Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communication networks. Journal of Artificial Intelligence 9, 317–365 (1998)
Di Caro, G., Dorigo, M.: Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 1998), pp. 541–546. IASTED/ACTA Press (1998)
Dijkstra, E.: A note on two problems in connection with graphs. Numerical Mathematics 1, 269–271 (1959)
Goldberg, D.: Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading (1989)
Grassé, P.: La reconstruction du nid et les coordinations interindividuelles chez bellicositermes natalensis et cubitermes sp. la théorie de la stigmergie: essai d’interprétation du comportement des termites constructeurs. Insectes Sociaux 6, 41–81 (1959)
Liang, S., Zincir-Heywood, A., Heywood, M.: The effect of routing under local information using a social insect metaphor. In: Proceedings of IEEE Congress on Evolutionary Computing (May 2002)
Liang, S., Zincir-Heywood, A., Heywood, M.: Intelligent packets for dynamic network routing using distributed genetic algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference. GECCO (July 2002)
Nii, P.: The blackboard model of problem solving. AI Mag 7(2), 38–53 (1986)
Seeley, T.: The Wisdom of the Hive. Harvard University Press, London (1995)
Varga, A.: OMNeT++: Discrete event simulation system: User manual, http://www.omnetpp.org
von Frisch, K.: The Dance Language and Orientation of Bees. Harvard University Press, Cambridge (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wedde, H.F., Farooq, M., Zhang, Y. (2004). BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive