Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective
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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/1276/ |
| _version_ | 1848789743132737536 |
|---|---|
| author | Ho, Chin Kuan |
| author_facet | Ho, Chin Kuan |
| author_sort | Ho, Chin Kuan |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:01:34Z |
| format | Thesis |
| id | mmu-1276 |
| institution | Multimedia University |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:01:34Z |
| publishDate | 2007 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-12762010-08-19T04:05:52Z http://shdl.mmu.edu.my/1276/ Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective Ho, Chin Kuan TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television 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. 2007-07 Thesis NonPeerReviewed Ho, Chin Kuan (2007) Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective. PhD thesis, Multimedia University. http://myto.perpun.net.my/metoalogin/logina.php |
| spellingShingle | TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television Ho, Chin Kuan Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title | Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title_full | Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title_fullStr | Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title_full_unstemmed | Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title_short | Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title_sort | metaheuristics for ad hoc network clustering: a graph-theoretic perspective |
| topic | TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television |
| url | http://shdl.mmu.edu.my/1276/ http://shdl.mmu.edu.my/1276/ |