An Ant Colony Optimization Algorithm for Multi-Objective Clustering in Mobile Ad-Hoc Networks
Date Issued
2014
Date
2014
Author(s)
Wu, Chung-Wei
Abstract
With the rise of the fourth generation (4G) communication standards and the growing usage of mobile computing devices, mobile ad hoc network becomes a hot topic and getting more and more attention in recent years. In this thesis, we address the clustering problem in mobile ad hoc network (MANET). Due to the convenient deployment and the flexibility for variety terrains, MANET has been widely used in various fields. Routing protocols are the most important issue of MANETs, however, it has been proved that both proactive and reactive routing schemes cannot perform well or even didn’t work in a large scale size of MANET, and clustering is the most efficient method to deal with it. Clustering leads a hierarchical structure, for each cluster a cluster head will be chosen for intra- and inter- communication. However clustering in MANET is NP-hard and needs to consider multiple objectives. In this thesis, we propose a Pareto-based ant colony optimization (ACO) algorithm to deal with this multiobjective optimization problem. We proposed a clustering matrix encoding to reflect the cluster selection and cluster formation without any bias and redundant solutions. A repair function is proposed for upgrading the quality of solutions. Apart from this, we also propose a mechanism to maintain the cluster structure for dynamic situations. The experiment results confirm that it outperforms several state-of-the-art algorithms and indicates the potential to be applied to practical use.
Subjects
隨建即連網路
蟻群優化演算法
多目標最佳化
網路叢聚問題
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-103-R01922078-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):7ee761d935ea06fc659067364a18d541