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...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 出版: |
2007
|
| 主题: | |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | 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. |
|---|