论文部分内容阅读
该文在分析Ad hoc网络两种典型的分簇算法的基础上,综合考虑节点度,节点的能量和移动性等多方面因素,提出了1种适用于Ad hoc网络的按需加权分簇算法。采用按需策略作为簇结构的维护策略,提高了网络体系结构的稳定性,减少了计算和通信开销。仿真结果验证了此种分簇算法的优越性。
Based on the analysis of two typical clustering algorithms in Ad hoc networks, this paper proposes a weighted on-demand clustering algorithm which is suitable for Ad hoc networks by comprehensively considering node degree, energy and mobility of nodes and so on. . Adopting the on-demand strategy as the maintenance strategy of the cluster structure improves the stability of the network architecture and reduces the computing and communication overhead. Simulation results verify the superiority of this clustering algorithm.