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
|
| 主題: | |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|