一种新的移动自组织网络动态簇选择算法  

A Novel Dynamic Clustering Algorithm in Mobile Ad Hoc Networks

作　　者：夏丹丹[1] 李刚[2] 于亮[1] 李加庆[1] 

机构地区：[1]空军雷达学院研究生管理大队,武汉430019 [2]空军雷达学院信息与指挥自动化系,武汉430019

出　　处：《空军雷达学院学报》2008年第2期130-132,135,共4页Journal of Air Force Radar Academy

摘　　要：为了提高移动自组织网络的扩展性,提出了一种新的动态簇选择算法.该算法以链路保持度和节点的可信度来作为选取簇首的度量,既保证了分簇结构的稳定性,又增强了簇首的可信度.最后进行了模拟实验.实验结果表明,该算法能提高网络的运行效率,簇结构稳定.For improving the extensibility of mobile Ad Hoc network （MANET）, a novel dynamic clustering algorithm was proposed. The algorithm chose the maintenance of links and credibility of nodes as measurement of choice of cluster head to guarantee the stability of clustering architecture and to enhance the credibility of clustering head. At last, the algorithm was simulated, which proves that the algorithm is capable of improving the efficiency of network working and making the clustering architecture stable.

关 键 词：移动自组织网络 动态簇选择算法 簇结构 稳定性 

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