Since 2014
Heuristic Clustering Algorithms in Ad hoc Networks
Emerging Markets Journal
View Archive Info| Field | Value | |
| Title |
Heuristic Clustering Algorithms in Ad hoc Networks
|
|
| Creator |
Aydın, Nevin
|
|
| Description |
The clustering allows dividing the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead. The clusterheads have direct communication link with each of its members whereas the member nodes of a cluster must go through the clusterhead to communicate with each other. Since choosing clusterheads optimally is an NP-hard problem, existing solutions to this problem are based on heuristic (mostly greedy) approaches. In this paper, we present three well-known heuristic clustering algorithms: the Lowest-ID, the Highest-Degree, and the Node-Weight.
|
|
| Publisher |
University Library System, University of Pittsburgh
|
|
| Contributor |
—
|
|
| Date |
2014-03-05
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion Peer-reviewed Article |
|
| Format |
application/pdf
|
|
| Identifier |
http://emaj.pitt.edu/ojs/index.php/emaj/article/view/39
10.5195/emaj.2014.39 |
|
| Source |
EMAJ: Emerging Markets Journal; Vol 3, No 3 (2014); 77-80
2158-8708 2159-242X |
|
| Language |
eng
|
|
| Relation |
http://emaj.pitt.edu/ojs/index.php/emaj/article/view/39/195
|
|