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

现存的Ad Hoc网络分簇算法大都只考虑影响网络性能的某个方面的因素，因此这些分簇算法的应用场合非常受限，本文在现存分簇算法的基础上设计了一种考虑多方面因素的新型分簇算法，可以在一定程度上改善网络的性能，并且具有较强的通用性，首先介绍了分簇算法提出的背景和一些相关的定义和假设，然后说明了几种现存的分簇算法的不足，接着重点分析了一种性能较好的分簇算法一自适应按需加权分簇算法，最后通过模拟对该分簇算法与其它映几种算法进行了性能比较和评价。

A Novel Clustering Algorithm in Ad Hoc Network and Its Performance Simulations

Most existing clustering algorithms only consider some single factor, which will affect network performances, thus they have very limited application scenarios. Basing on existent clustering algorithms, this paper designs a novel clustering algorithm considering various factors which can improve network performance to some extent and has more generality. The paper firstly introduces the backgrounds of the appearance of clustering algorithms and some related definitions and assumptions. Then the drawbacks of several existing clustering algorithms are explained. Afterwards, a clustering algorithm with good performance-AOW is analyzed in detail. Finally, performance comparisons and evaluations between AOW and other clustering algorithms are performed by simulations.