战术Ad hoc网络的一种分群方法  

A Clustering Algorithm for Tactical Ad hoc Network

作　　者：刘行兵[1,2] 张聪品[1] 李文林[3] 

机构地区：[1]河南师范大学计算机与信息技术学院,河南新乡453007 [2]北京科技大学信息工程学院,北京100083 [3]河南师范大学数学与信息科学学院,河南新乡453007

出　　处：《广西师范大学学报（自然科学版）》2008年第3期234-237,共4页Journal of Guangxi Normal University:Natural Science Edition

基　　金：国家自然科学基金资助项目(60643003);河南省自然科学基金资助项目(0511012500);河南省科技公关项目基金资助课题(2007520026)

摘　　要：战术Ad hoc网群是按一定编制组成,其群首及成员相对固定。传统的Ad hoc网分群算法对群首和群成员的确立存在随机性,对战术Ad hoc网分群缺乏针对性。提出基于指挥员节点的战术Ad hoc网分群算法,通过规划保证指挥员节点具有最大逻辑编制连接度,群首用递归算法对节点进行相关度计算,其他节点执行跟随算法,确保指挥员节点在成群和运动过程中保持实际上最大连接度,实现战术Ad hoc网的层次结构的划分。Tactical Ad hoc network cluster is composed of a certain amount of preparation,and members of cluster and cluster header are relatively fixed. The traditional clustering algorithms of Ad hoc network to establish cluster and cluster header are random,which can not be used for tactical Ad hoc clustering. In this paper,a clustering algorithm based on commander node for tactical Ad hoc network is proposed, through the planning Guarantee commander node with the greatest logic degree of connectivity,after calculating value of relation of cluster nodes by recursive algorithm,other nodes implement the following algorithm to ensure commander node with the greatest actual degree of connectivity in the course of clustering and moving,achieving the level of the structure for tactical Ad hoc network.

关 键 词：自组网 分群算法 群和群首 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]