Ad Hoc中的一种新型分簇算法及性能仿真

New clustering algorithm in Ad Hoc network and performance simulations

简要介绍了已有的分簇算法,并讨论了这些算法的优缺点。针对这些算法的不足,提出了一种新型有效、适用于大规模高速运动Ad Hoc网络的分簇算法。仿真实验证明该算法可有效解决均匀分簇、均衡结点负担、保持簇结构的稳定性等问题,并能够满足大规模高速运动Ad Hoc网络的要求。给出了相关的仿真分析和结论。

Some existing clustering algorithms are briefly introduced, and these advantages and disadvantages. Aimed at their shortage, a new clustering algorithm in Ad Hoc network is proposed, which fits for large Ad Hoc network even when mobile device move at a high speed. According to the simulation experiment, the results show that the proposed algorithm is able to solve the problems, such as clus- tering well-proportioned, balance the burden of nodes, maintain the stability of cluster structure, and meet the requirements of the large high speed movement Ad Hoc network. A related analysis and conclusion is given at the end.