摘要： 现有分簇算法生成的簇结构都是强连通的单一结构，无法充分利用节点资源。针对该问题，提出一种兼容弱连通簇的分簇算法。定义符合弱连通簇的邻居表结构，并阐述邻居表维护策略，该算法去除簇成员与簇首强连通的条件限制，从而可选择更优的节点作为簇首。分析结果表明，该算法得到的簇结构具有较好的稳定性和持续性。

关键词: 分簇算法, Ad Hoc网络, 簇首, 簇成员, 弱连通

Abstract: The clustering architectures created by the existing clustering algorithms are all single structures and strongly connected, which can not fully use nodes’ resources. To solve this problem, this paper presents an algorithm compatible with weak connection clustering algorithm. This paper defines the neighbor table corresponding with weak connected cluster and stated the maintenance strategy of the neighbor table. This algorithm can select the better node as the cluster head by ignoring the limitation of strong connectivity between cluster head and cluster members. Analysis results show that this algorithm has better stability and steadiness.

Key words: clustering algorithm, Ad Hoc network, cluster header, cluster member, weak connection

中图分类号: 

• TP301.6