移动自组织网中一种平均节点度分簇算法

An average degree clustering algorithm in mobile ad hoc network

针对移动adhoc网络现有分簇算法容易造成通信瓶颈的现象,在最高节点度分簇算法的基础上提出了基于平均节点度的分簇方法,通过选举具有合适节点度大小的节点作为簇头来平衡网络负载,应用Glomosim做的仿真结果显示该算法能较好维持网络的稳定性。

In this paper, a clustering algorithm for mobile ad hoc network （MANET） named average degree clustering algorithm （ADCA） was presented. The proposed algorithm overcomes the shortcoming of those typical clustering algorithms which can easily bring in communication bottleneck. In order to balance the burden of nodes, those nodes which have proper degree were elected as cluster heads. The proposed ADCA was simulated by Glomosim, and the experimental result shows that the novel algorithm is good at maintaining the stability of net structure.