BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior

  • Authors:

  • Horst F. Wedde;Muddassar Farooq;Thorsten Pannenbaecker;Bjoern Vogel;Christian Mueller;Johannes Meth;Rene Jeruschkat

  • Affiliations:

  • University of Dortmund, Germany;University of Dortmund, Germany;University of Dortmund, Germany;University of Dortmund, Germany;University of Dortmund, Germany;University of Dortmund, Germany;University of Dortmund, Germany

  • Venue:
  • GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present BeeAdHoc, a new routing algorithm for energy efficient routing in mobile ad hoc networks. The algorithm is inspired by the foraging principles of honey bees. The algorithm mainly utilizes two types of agents, scouts and foragers, for doing routing in mobile ad hoc networks. BeeAdHoc is a reactive source routing algorithm and it consumes less energy as compared to existing state-of-the-art routing algorithms because it utilizes less control packets to do routing. The results of our extensive simulation experiments show that BeeAdHoc consumes significantly less energy as compared to DSR, AODV, and DSDV, which are state-of-the-art routing algorithms, without making any compromise on traditional performance metrics (packet delivery ratio, delay and throughput).