基于蚁群路由协议的局部修复算法

LOCAL REPAIR ALGORITHM BASED ON ANT COLONY ROUTING PROTOCOL

在无线网络中,当由节点频繁移动而引起通信链路发生故障时,路由协议需要对其进行修复,才能保证正常通信。现有路由修复机制存在控制开销大和时延长的不足,而且大多数为针对AODV(Ad Hoc On-demand Distance Vector Routing)路由算法的修复,难以充分保证链路性能,并且存在链路重构后链路再次失效的缺点。基于此,提出一种基于蚁群路由算法的局部修复算法。首先,选取稳定性高的节点发起路由修复,以降低链路修复后的不稳定;其次,将修复范围限定在较小的局部范围内以减小控制开销和时延。仿真表明,改进的路由局部修复算法明显地提高了链路的稳定性,缩短了修复时间,降低了路由开销。

In wireless networks, when a communication link fails caused by frequent node mobility, the routing protocols need to repair it, and then can the normal communication be ensured. Presently the route repair mechanisms has the deficiencies of heavy overhead and long delay, and mostly are for repairing the AODV （ Ad Hoc On-demand Distance Vector Routing） routing algorithms, it is hard to fully guarantee the performance of the link, and has the shortcoming of failure again after the link to be reconstructed. Based on this, we propose a partial repair algorithm which is based on ant colony routing algorithm. First, it selects the nodes with high stability to initiate the route repair to reduce the instability after the link has been repaired; secondly, it limits the repair scope within a smaller local area to reduce the control overhead and delay. Simulation shows that the improved route partial repair algorithm significantly improves the stability of the link and shortens the repair time as well as reduces the routing overhead.