Citation

Ho, C. K. and Ewe, H. T. (2005) A hybrid ant colony optimization approach (hACO) for constructing load-balanced clusters. In: The 2005 IEEE Congress on Evolutionary Computation, 2005. IEEE Xplore, pp. 2010-2017. ISBN 0-7803-9363-5

Text A hybrid ant colony optimization approach (hACO) for constructing load-balanced clusters.pdf Restricted to Repository staff only Download (2MB)

Abstract

Nodes in an ad hoc network are usually organized into clusters, with each cluster being coordinated by a node acting as the cluster head (CH). Cluster members are one hop away from their CH. The collection of CHs give rise to a graph structure known as a dominating set. This paper proposes a hybrid ACO (hACO) approach that, when given a graph representing a network, selects a set of CHs in such a way that enables the remaining nodes to be distributed as evenly as possible to these CHs while ensuring that the maximum load a CH can take is maintained. Artificial ants are used to select the CHs. After a CH is selected, a heuristic is used to determine cluster member assignment. Solution quality is measured using a metric called the load balancing factor (LBF). We benchmark the performance of the hACO against a recently proposed genetic algorithm (GA) that addresses the same problem. Empirical results point to the fact that hACO consistently produced good solutions across the 41 problem instances. Even though GA gave the best solutions for several instances, its performance deteriorated for graphs with relatively higher density. We explain this behavior by examining the clusters produced by both methods.

Item Type:	Book Section
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines > 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:55
Last Modified:	06 Dec 2013 00:16
URII:	http://shdl.mmu.edu.my/id/eprint/2334

Downloads

Edit (login required)