Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15]


Journal of Information Science and Engineering, Vol. 27 No. 5, pp. 1581-1596 (September 2011)

A Dynamic Ant Colony Based Routing Algorithm for Mobile Ad-hoc Networks

Department of Computer Engineering and Information Technology
Amirkabir University of Technology
Tehran, 15875-4413 Iran

In this paper we study the performance of ant colony based routing algorithms in mobile ad hoc networks (MANETs) and present SAMP-DSR, a new algorithm to address the shortcomings of both ant colony based as well as the traditional DSR algorithms. Due to the unstable nature of MANETs memory based search algorithms such as ant based methods become inefficient and impractical as the network mobility increases. Our simulations show that ant based routing algorithms suffer from lack of accuracy while incurring extensive memory usage as well as valuable processing power and bandwidth costs in highly dynamic environments. The proposed ANT based routing algorithm exploits a dual-mode approach. Each node can independently operate in a local mode as well as in global mode using the information provided by ants. The network topology changes are constantly monitored. When the rate of topology change gets too high for ants to converge efficiently, a node switches to local mode to rely less on the information learnt through ants. Our simulations show how this switching approach significantly improves the performance of the network by quickly adapting to the dynamics of the environment.

Keywords: MANETs, dynamic source routing, ant colony optimization, reliability, quality of service

Full Text () Retrieve PDF document (201109_05.pdf)

Received January 11, 2010; revised March 15 & May 13, 2010; accepted June 3, 2010.
Communicated by Chung-Ta King.