scispace - formally typeset
Search or ask a question

Showing papers by "Muddassar Farooq published in 2005"


Proceedings ArticleDOI
25 Jun 2005
TL;DR: The results of the 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.
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).

179 citations


Proceedings ArticleDOI
08 Jun 2005
TL;DR: It is verified that BeeAdHoc consumes significantly less wireless network card energy as compared to DSR, AODV, and DSDV, which are existing state-of-the-art routing algorithms, but without compromising traditional performance metrics, packet delivery ratio and delay.
Abstract: In this paper we present an energy efficient routing algorithm, BeeAdHoc, which is inspired from foraging principles of honey bees. The bee behavior was instrumental in designing efficient mobile agents, scouts and foragers, for routing in mobile ad-hoc networks. We did extensive simulations to verify that BeeAdHoc consumes significantly less wireless network card energy as compared to DSR, AODV, and DSDV, which are existing state-of-the-art routing algorithms, but without compromising traditional performance metrics, packet delivery ratio and delay.

40 citations


Book ChapterDOI
TL;DR: A comprehensive performance evaluation framework that will empower the routing protocol designers to design state-of-the-art algorithms and extensively evaluate their performance and show some undiscovered aspects of the algorithms and provide valuable understanding about their merits and demerits is proposed.
Abstract: Performance evaluation of routing protocols is an important area of research that deals with the analysis and investigation of such protocols. A performance evaluation framework unveils different facets of a protocol and explores its behavior under diversified network operations. The nature inspired routing community, at the moment, lacks such a framework. Therefore, in this paper we propose a comprehensive performance evaluation framework that will empower the routing protocol designers to design state-of-the-art algorithms and extensively evaluate their performance. Using our framework, we exhaustively evaluated three state-of-the-art nature inspired routing algorithms. The results show some undiscovered aspects of the algorithms and provide valuable understanding about their merits and demerits. We believe that this will be the first major step in designing, standardizing and developing a performance evaluation library that will facilitate an extensive and unbiased evaluation of nature inspired routing algorithms.

29 citations