一种适用于移动对等网络的分簇算法

通过分簇算法减小网络振动效应，延长网络的寿命是移动对等网络的研究重点之一。在研究Kautz图及其特性的基础上，提出一种基于Kautz图的移动对等网络分簇算法。在算法中，定义地址空间树，使用Kautz串作为节点标识，并运用后根序和宽度优先算法遍历地址空间树等一系列技术生成簇。同时设计了相关机制管理和维护簇结构，保证结构一致性。理论证明和实验评估表明，该分簇算法能有效减小振动效应，延长网络寿命。

A clustering algorithm for mobile peer-to-peer network

Using the clustering algorithm to reduce the network churn effect and extend the network lifetime is one of the research emphasis points of mobile peer-to-peer networks. Based on studying the Kautz graph and its characteristics, a clustering algorithm of mobile peer-to-peer network based on the Kautz graph is proposed. In the algorithm, an address space tree is defined firstly, and then the Kautz string is used as nodes’ identifier. The breadth-first-search via post-order is used to travel a well-defined address tree for clusters creation. Besides, the mechanism for management and maintenance of cluster structure is designed to ensure the structural integrity. Theoretical proof and experimental evaluation show that the clustering algorithm can effectively reduce the churn effect and extend the network lifetime.