Bees ants based routing algorithm

8Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose a novel routing algorithm called Bees Ants algorithm. This algorithm is a combination of Ant colony based Routing Algorithm (ARA) and BeeHive based Routing Algorithm. The proposed routing algorithm depends on splitting the network into two parts; one is a fixed network and the other is a mobile ad hoc network (MANET), then applying the Ant colony based Routing Algorithm on the mobile part and the BeeHive based Routing Algorithm on the fixed one. After comparing the proposed algorithm with the ARA algorithm, it shows promising results in terms of propagation delay, queue delay, and number of hops. © 2010 IEEE.

Cite

CITATION STYLE

APA

Al Maghayreh, E., Al-Haija, S. A., Alkhateeb, F., & Aljawarneh, S. (2010). Bees ants based routing algorithm. In ISMS 2010 - UKSim/AMSS 1st International Conference on Intelligent Systems, Modelling and Simulation (pp. 344–349). https://doi.org/10.1109/ISMS.2010.70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free