一种基于加权分簇的舰艇编队快速组网算法  

A Fast Networking Algorithm for Ship Formation Based on Weighted Clustering

作　　者：周君哲 Zhou Junzhe(Army Engineering University,Nanjing,China)

机构地区：[1]陆军工程大学,江苏南京

出　　处：《科学技术创新》2023年第6期85-88,共4页Scientific and Technological Innovation

摘　　要：针对舰艇编队中的无线自组网快速组网问题,提出了一种基于加权分簇的快速组网算法(Weighted Clustering Fast Networking Algorithm,WCFNA),该算法首先通过功率判决寻找候选簇头,再将节点移动性和邻居节点数作为权值确定簇头,完成分簇,并在节点移动导致网络变化后进行簇的维护。仿真结果表明,WCFNA算法与传统算法在拓扑建立速度、网络持续时间、网络抗毁能力等性能方面具有显著改善。Aiming at the problem of wireless ad hoc network fast networking in the naval fleet,a Weighted Clustering Fast Networking Algorithm(WCFNA)is proposed.This algorithm first looks for candidate cluster heads through power decision,and then determines the cluster heads by using node mobility and the number of neighbor nodes as weights to complete clustering,and then performs cluster maintenance after the network changes due to node movement.The simulation results show that the WCFNA algorithm and the traditional algorithm have significant improvement in the performance of topology establishment speed,network duration,network survivability and other aspects.

关 键 词：无线自组网 拓扑控制 加权分簇算法 

分 类 号：TP929.5[自动化与计算机技术]