一种基于移动预测的自适应Ad hoc网络分簇算法  

An Adaptive Clustering Algorithm Based on Mobility Prediction in Ad hoc Networks

作　　者：蒋毅[1] 史浩山[1] 

机构地区：[1]西北工业大学电子信息学院,西安710072

出　　处：《计算机科学》2007年第3期27-29,34,共4页Computer Science

基　　金：教育部博士点基金项目"高效能移动智能体空地一体化系统及其在战术网中的应用研究"(20050699037)。

摘　　要：在移动Adhoc网络中采用分簇机制可以达到在拓扑结构频繁变化的网络环境中快速部署节点通信的目的。本文在深入研究移动预测技术的基础上,分析已有分簇算法存在的诸多不足,提出了一种基于移动预测的自适应分簇算法,包括分簇算法和分簇保持策略两方面的内容,并通过模拟证明该算法保持了分簇结构的稳定性,提高了网络负载平衡能力,减少了节点之间的通信路由开销,有效防止了通信的中断,弥补了已有分簇算法的不足。Using clustering mechanism in mobile Ad hoc networks with variable topology framework, it can archive the purpose of deploying the communication of nodes rapidly. Based on studying deeply in the technology of mobility prediction, analyzing the shortages in clustering algorithm previously, this paper presents an adaptive clustering algorithm based on mobility prediction in mobile Ad hoc networks. It contains tow aspects., clustering algorithm and clustering maintenance, compensating shortages in clustering algorithm previously, keeping stability of clustering framework, increasing ability of Load-Balancing, reducing spending of communication routing between nodes, avoiding the communication interrupt through simulating.

关 键 词：移动预测 自适应 AD hoe网络 分簇算法 

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