A clustering algorithm of Ad-Hoc network based on honeycomb division

Early Ad Hoc network commonly used planar structure which is characterized by simple structure, the equal status of each node, easy maintenance. But this structure limited the expansion of network. Hierarchical network management system provides an effective means to address these problems. So, at present, the development of Ad Hoc network towards hierarchical structure. The hierarchical structure can be extended flexible. And this structure is characterized by routing and control overhead and easy network management. But how to grade the network, which is looking for the superior performance of clustering algorithm, is one of the problems of hierarchical structure currently. This paper proposes a clustering algorithm of Ad-Hoc network based on honeycomb division to solve problems which is the classic clustering algorithm encountered. There are how to divide the scale of cluster, the buttleneck of cluster head and overlap of the member between clusters. And we proved that the method is effective and superiority by simulation tests.