BeesAnts: a new nature-inspired routing algorithm
by Eslam Al Maghayreh; Sallam Abu Al-Haija; Faisal Alkhateeb; Shadi Aljawarneh; Emad Al-Shawakfa
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 10, No. 1, 2013

Abstract: In this paper, we have introduced a new multi-agent nature-inspired routing algorithm. The algorithm is referred to as the BeesAnts algorithm. It is a combination of the ant colony-based routing algorithm (ARA) and the BeeHive-based routing algorithm. The proposed routing algorithm works effectively on networks consisting of two parts; one is a fixed network and the other is a mobile ad hoc network (MANET). It applies the ARA routing algorithm on the mobile part and the BeeHive routing algorithm on the fixed part. The experimental results and the statistical analysis have demonstrated that the BeesAnts routing algorithm outperforms its ancestor, the ARA routing algorithm, in terms of the propagation delay, the queue delay, and the number of hops.

Online publication date: Fri, 28-Jun-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com