Ad-hoc网络中一种基于表驱动的辅助路由算法

通过研究ad hoc网络中移动节点的通信规律,在传统的三种通信模式的基础上定义了一种新的节点通信模式快速穿行模式,并针对该通信模式提出了一种新的路由算法路由代理算法·在快速穿行模式下,网络拓扑变化频繁,导致大量的系统带宽开销和计算开销,同时较大增长了承载业务的时延·路由代理算法是对当前表驱动ad hoc网络路由算法的补充,它专门针对快速穿行模式中高速节点的路由方法作出了修改,大大降低了由于高速节点快速运动导致的路由更新报文开销·仿真实验结果表明:该算法明显缩短了发往高速节点的数据传输时延,提高了路由的效率·

Auxiliary Table-Driven Routing Algorithm in Ad-Hoc Networks

After studying the characteristics of moving hosts in an ad-hoc wireless network, a new traffic pattern, namely the rapid-passing pattern, is defined, based on the three traditional traffic patterns. The routing agent algorithm is thus proposed for rapid-passing pattern under which the frequent changes in network topology will lead to heavy overheads for bandwidth and computation and, at the same time, prolong the time delay in the services to be done. As a supplement to current table-driven routing protocols, the routing agent algorithm shall dramatically reduce the packet overheads of route-updating messages due to the change of rapid-moving hosts. Simulation results show that it greatly shortens the time delay required for sending data to the rapid-moving host, thus improving the routing efficiency.