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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| منشور في: |
2007
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| id |
my-mmu-ep.1276 |
|---|---|
| record_format |
uketd_dc |
| spelling |
my-mmu-ep.12762010-08-19T04:05:52Z Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective 2007-07 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 http://shdl.mmu.edu.my/1276/ http://myto.perpun.net.my/metoalogin/logina.php phd doctoral Multimedia University Research Library |
| institution |
Multimedia University |
| collection |
MMU Institutional Repository |
| topic |
TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television |
| spellingShingle |
TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television Ho, Chin Kuan Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| 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. |
| format |
Thesis |
| qualification_name |
Doctor of Philosophy (PhD.) |
| qualification_level |
Doctorate |
| author |
Ho, Chin Kuan |
| author_facet |
Ho, Chin Kuan |
| author_sort |
Ho, Chin Kuan |
| title |
Metaheuristics For Ad Hoc Network Clustering: A Graph-Theoretic Perspective |
| title_short |
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_sort |
metaheuristics for ad hoc network clustering: a graph-theoretic perspective |
| granting_institution |
Multimedia University |
| granting_department |
Research Library |
| publishDate |
2007 |
| _version_ |
1747829333154594816 |