Using ant-like agents for fault-tolerant routing in mobile ad-hoc networks

  • Authors:

  • Sudip Misra;Mohammad S. Obaidat;Sanjay K. Dhurandher;Karan Verma;Pushkar Gupta

  • Affiliations:

  • School of Information Technology, Indian Institute of Technology-Kharagpur, West Bengal, India;Department of Computer Science, Monmouth University, West Long Branch, NJ;CAITFS, Division of Information Technology, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, India;Division of Information Technology, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, India;Division of Information Technology, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, India

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fault-prone nodes in mobile ad-hoc networks (MANETs) degrade the performance of any routing protocol. Using greedy routing mechanisms that tend to choose a single path every time, may cause major data losses, if there is a breakdown of such a path in a fault-prone environment. On the other hand, using all the available paths causes an undesirable amount of overhead on the system. Designing an effective and efficient fault-tolerant routing protocol is inherently hard, since the problem is NP-complete, due to the unavailability of precise path information in adversarial environments [1]. To address the challenges of effective fault-tolerant routing, we present a fault-tolerant routing algorithm (FTAR), based on the ideas of how swarms of natural ants operate[2]. The algorithm is divided into various stages namely initialization, path selection, pheromone deposition, confidence calculation, evaporation and negative reinforcement. Simulation results show that FTAR achieves high packet delivery ratio and throughput as compared to some of the key protocols which do not do fault-tolerance at all. Most importantly, FTAR beats the best fault-tolerant MANET routing algorithm [1] known currently, with respect to the amount of routing overhead incurred, which is an important consideration.