一种新型自适应加权分簇算法的性能研究

自适应加权(AOW)分簇算法是移动自组网中一种性能良好的分簇算法,在这里被引入无线传感器网络,并针对其算法复杂的缺点,提出一种简化的MAOW(mended AOW)算法。仿真结果表明:MAOW算法具有较低的复杂性,并在负载平衡性上有较大提升。介绍分簇算法的背景和相关定义,说明几种已有算法的特点,接着引入自适应加权算法,又重点提出改进的MAOW算法,最后,通过仿真对全部算法进行分析比较。

Research on performance of automatic on-demand weighted clustering algorithm

Automatic on-demand weighted(AOW)clustering algorithm,which is introduced into the wireless sensor networks in this paper,is a clustering algorithm with a good performance in the mobile Ad Hoc networks.In order to reduce the complexity of the algorithm,a simpler algorithm MAOW is put forward.The simulation indicates that this scheme reduces the complexity and the balance of load has been greatly improved.The background of clustering algorithms and some related definitions are presented.The characteristics of several existing clustering algorithms are explained.Afterwards,The AOW algorithm is led and an improved MAOW algorithm has been described in detail.In the end,comparisons and analyses between MAOW and other clustering algorithms are performed by simulation.