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

Ho, , CK and Ewe, , HT (2005) Performance of an ant colony optimization (ACO) algorithm on the dynamic load-balanced clustering problem in ad hoc networks. COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 3801 . pp. 622-629. ISSN 0302-9743

Full text not available from this repository.

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.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 23 Aug 2011 07:21
Last Modified: 23 Aug 2011 07:21
URI: http://shdl.mmu.edu.my/id/eprint/2349

Actions (login required)

View Item View Item