An efficient clustering scheme in mobile peer-to-peer networks

With the growing capability of wireless communication and hardware, it is possible to envision networks comprising of a large number of mobile nodes. This kind of networks needs a scalable solution to rapidly deploy and organize these nodes into a functional network. In this paper, we present a clustering scheme based on the Kautz digraph to efficiently solve this problem. We defined nodes identifiers as Kautz strings and used Breadth-First-Search via post-order to travel a well-defined address tree for clusters creation. By formal proof and experimental simulations, our clustering scheme can achieve good performance and effectiveness.