一种Ad hoc网络中动态自适应的路由更新算法  

Dynamically Self-Adaptive Routing Update Algorithm for Ad hoc Networks

作　　者：金鑫[1] 张尧学[1] 王洪波[1] 

机构地区：[1]清华大学普适计算教育部重点实验室,北京100084

出　　处：《小型微型计算机系统》2005年第12期2078-2081,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(69873024)资助;国家"九七三"基础科研项目(G1998030409)资助

摘　　要：目前A d hoc网络中基于簇的路由算法都采用了混合路由策略,其路由信息的更新范围局限在局部网络中(或簇内).提出了一种改进的路由更新算法—基于分簇机制的动态自适应路由更新算法.该算法使用簇头节点来进行簇内路由信息更新,使用簇头和网关节点来进行簇间路由信息更新,同时根据网络拓扑结构变化的快慢,动态地调整路由信息传播的范围.模拟结果显示该算法在使节点获得了较为准确的路由信息的前提下,有效地减少了路由信息更新所带来的控制开销.Recent routing algorithms based on clustering mechanism in Ad hoc networks mostly adopt the hybrid routing strategy,whose routing update process only performs in local network （or in cluster）. This paper proposed an improved routing update algorithm - a dynamically self-adaptive routing update algorithm based on clustering mechanism. The algorithm processes intra-cluster update through clusterhead nodes and processes inter-cluster update through clusterhead and gateway nodes. At the same time, according to the changing rate of the network topology, the algorithm adjusts the routing update scope dynamically. The simulations results show that the algorithm can reduce the control overhead effectively while let nodes get relatively exact routing information.

关 键 词：AD HOC网络 路由更新 簇 控制开销 

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