摘要
在分析目前4种典型的Ad Hoc网络分簇算法优缺点的基础上,提出了应用计算几何中最小覆盖问题算法,并借鉴了GSM、CDMA移动通讯中的蜂窝位置管理技术,设计了一种基于动态分区技术新的Ad Hoc网络分簇算法:将Ad Hoc网络中的各个节点动态地划分为若干个动态分区,每个动态分区就是一个簇,并确定了簇头更新策略。实践证明,该分簇算法计算复杂度低,具有较高的适应性。
Based on the analysis on the four typical clustering algorithms of the present Ad Hoc network, a solution to problems ofmincoverage in applied computational geometry is put forward for the first time. By using some managing techniques in mobile communication of GSM and CDMA for reference, a new clustering algorithm of MANET based on the dynamic grouped technique is designed： all the nodes of MANET are grouped dynamically into several ＂mobile cells＂, a cluster is applied within one cell, the cluster refreshed strategy is also decided. Experiment has proved that the application of this clustering algorithm can not only reduce the computation time, but also improve the adaptability.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第23期5646-5649,共4页
Computer Engineering and Design
关键词
动态分区
移动自组网
分簇算法
计算几何
拓扑网络设计
最小覆盖
位置管理
dynamic grouped
mobile Ad Hoc network
clustering algorithm
computational geometry
topology network design
minimal covered
location manage
