用于Ad Hoc网络的分簇算法

A Novel Clustering Algorithm for Ad Hoc Network

簇结构是Ad Hoc网络中应用最为广泛的层次结构,而这种层次的形成和维护依赖于某种算法.在分析现有分簇算法的基础上,提出一种新的按需加权的分簇算法(NWBCA).算法综合考虑了移动节点的最佳连接度和能量状态因素,并采用按需策略作为簇结构的维护策略,提高了网络体系结构的稳定性,减少了计算和通信开销.通过性能比较,NWBCA的各项仿真指标均优于其他分簇算法,且仿真结果也证明了该算法的有效性.

Clustering is the most popular method to impose a hierarchical structure in the mobile Ad Hoc networks. However, the formation and maintenance of a hierarchical structure depends on certain clustering algorithm. By studying existing clustering algorithm, a new on-demand weighted clustering algorithm （NWBCA） is proposed. The optimized connectivity degree and energy status of mobile nodes are taken into consideration. The adoption of the on-demand strategy improves the stability of the network architecture and lowers the computing and communication cost. By investigating the performance of the proposed algorithm with that of others, the simulation indicates all the specifics of NWBCA are superior to those of the other and the validity of NWBCA has been proved.