Performance of an ant colony optimization (ACO) algorithm on the dynamic load-balanced clustering problem in ad hoc networks
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 r...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2349/ |
| Summary: | 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. |
|---|