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:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2007
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|