一种战术网的分群算法及管理  

A Clustering Algorithm of Ad Hoc Networks and It' s Management

作　　者：庞晓斌[1] 姜长生[1] 

机构地区：[1]南京航空航天大学自动化学院,南京210016

出　　处：《微计算机信息》2008年第21期29-31,共3页Control & Automation

基　　金：无人直升机群空战战术数据链和智能火力控制的综合系统研究颁发部门;中航二集团;航空支撑科技基金(05c52007)

摘　　要：利用最大连接度分群算法进行群首选举,并进行网关的确定,然后对形成的分群结构进行适当有效的管理。对群的管理主要通过对节点的管理实现,并在统计通信流量的基础上限制对群本身的过度操作,避免了群结构的频繁变动,使网络在保证通信质量的同时具有一定稳定性。本文意义在于提出了一种分群算法及其群的管理,是研究战术网路由协议的前提,作为相关研究工作的参考。A cluster head is elected by the clustering algorithm-Maximum Degree of Connectivity, and a gateway is specially decided, then, appropriate and effecte management is taken to the formative Clusters. The management of clusters is done mostly by controlling the nodes in the cluster, and is limited by the statistical results of communication traffic to avoid frequent variation of the cluster structure. All these ensure both the communication quality and the stability of the whole network. This text gives a method of clustering algorithm and the cluster management for a reference, which is the precondition of researching routing protocol.

关 键 词：分群算法 群的管理 

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