An ant colony optimization based routing algorithm in mobile ad hoc networks and its parallel implementation

  • Authors:

  • Parimala Thulasiraman;Ruppa K. Thulasiram;Mohammad T. Islam

  • Affiliations:

  • Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada;Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada;Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada

  • Venue:
  • High performance scientific and engineering computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A mobile ad hoc network (MANET) consists of mobile wireless nodes that communicate in a distributed fashion without any centralized administration. The nodes instantaneously and dynamically form a network on the fly when it is needed. We define an irregular application as one that changes the network dynamically during runtime, exhibits chaotic load balancing among the processors and unpredictable communication behavior among the nodes during runtime. An ad hoc network has all these characteristics and hence could be considered as an irregular application from the parallel computing perspective.In this chapter, we describe the design of an on-demand routing algorithm called source update for MANETs using a metaheuristic based on the ant colony optimization (ACO) search technique. We develop a mechanism to detect cycles, parallelize this algorithm on a distributed memory machine using MPI, and study the performance of the parallel algorithm. We report the performance of this algorithm on a distributed network of workstations.