移动自组网中基于按需加权的NTDR分簇算法  

The migration is divided bunch of algorithm

作　　者：胡波[1,2] 

机构地区：[1]福建省财税信息中心,福建350003 [2]中南大学信息科学与工程学院,湖南410083

出　　处：《网络安全技术与应用》2010年第7期94-96,共3页Network Security Technology & Application

摘　　要：本文分析了移动自组网几种典型分簇算法,并针对现有分簇算法的不足,提出基于按需加权的NTDR(DWNTDR)分簇算法,该算法综合考虑影响移动自组网性能的节点度,速度等多种因素。通过模拟和比较各分簇算法,证明该算法更适合移动自组网入侵检测系统。This article has analyzed the migration from a network several kind of model minute bunch of algorithm,and aims at the existing minute bunch of algorithm the insufficiency,proposes based in demand weighting NTDR（DWNTDR） minute bunch of algorithm,this algorithm overall evaluation influence migration from network performance node,speed and so on many kinds of factors.Through simulates and compares each minute bunch of algorithm,proves this algorithm more suitable migration from the network invasion examination system.

关 键 词：移动自组网 入侵检测 簇 DWNTDR 

分 类 号：TN929.5[电子电信—通信与信息系统]