ABSTRACT
Generally, the clustering algorithm in an ad hoc network completes the cluster formation and connection in the topology probe. The goal of the clustering algorithm is to establish and maintain a set of clusters that are connected with each other and can overlap the whole network and support resource management and routing protocols with less overhead of calculation and communication. Classic clustering algorithms in wireless ad hoc networks include minimum ID clustering algorithm, maximum degree clustering algorithm, motion-based clustering algorithm, and weight-based clustering algorithm. All the clustering algorithms are based on topology without using the information of location. The chapter summarizes the advantages and goals of clustering algorithms in wireless sensor networks. It provides a discussion on some characteristics of clusters, the characteristics of the cluster heads, property in the process of clustering, and the comprehensive classification of clustering algorithms in the whole process of clustering algorithms.
