Performance of an ant colony optimization (ACO) algorithm on the dynamic load-balanced clustering problem in ad hoc networks

  • Authors:

  • Chin Kuan Ho;Hong Tat Ewe

  • Affiliations:

  • Faculty of Information Technology, Multimedia University, Persiaran Multimedia, Cyberjaya, Malaysia;Faculty of Information Technology, Multimedia University, Persiaran Multimedia, Cyberjaya, Malaysia

  • Venue:
  • CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper examines the performance of a recently proposed ACO algorithm when applied to the problem of constructing load-balanced clusters in ad hoc networks with node mobility. Performance, in this context, is measured in terms of the magnitude of change in solution quality after nodes move, and reactivity. Reactivity refers to the number of cycles ACO takes to recover from any degradation in solution quality resulting from node movements. Empirical results on 16 problem instances of various sizes revealed a positive correlation