Citation
Ho, Chin Kuan (2007) Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective. PhD thesis, Multimedia University. Full text not available from this repository.
Official URL: http://myto.perpun.net.my/metoalogin/logina.php
Abstract
The ant colony optimization (ACO) metaheuristic has been successfully applied to two computationally difficult graph-theoretic problems arising from the task of clustering nodes in ad hoc networks. In such clustering, each node is either a cluster head (CH) or an ordinary node attached to a CH. The construction of the minimum number of clusters is formulated as the Minimum Dominating Set (MDS) problem, which is known to be NP-Hard and computationally intractable.
| Item Type: | Thesis (PhD) |
|---|---|
| Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television |
| Divisions: | Faculty of Computing and Informatics (FCI) |
| Depositing User: | Ms Rosnani Abd Wahab |
| Date Deposited: | 19 Aug 2010 04:05 |
| Last Modified: | 19 Aug 2010 04:05 |
| URII: | http://shdl.mmu.edu.my/id/eprint/1276 |
Downloads
Downloads per month over past year
 Edit (login required) |