【摘要】 该文在分析Ad hoc网络两种典型的分簇算法的基础上,综合考虑节点度,节点的能量和移动性等多方面因素,提出了1种适用于Ad hoc网络的按需加权分簇算法。采用按需策略作为簇结构的维护策略,提高了网络体系结构的稳定性,减少了计算和通信开销。仿真结果验证了此种分簇算法的优越性。更多还原

【Abstract】 Two representative clustering algorithms for Ad hoc network is studied. Based on the consideration of several aspects including node degree, battery power and mobility, a novel on-demand weighted clustering algorithm for Ad hoc network is presented. The adoption of the on-demand strategy improves the stability of the network architecture and lowers the computing and communication costs. The simulation experiment verifies the better performance of this clustering algorithm.更多还原