出版社：University Library System, University of Pittsburgh
摘要：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.
