基于缓存旁路和本地修复的多跳网络路由重建机制

该文针对多跳网络中现有AODV和AODV-BR按需路由算法的弊端，提出了基于缓存旁路和本地修复的AODV-CL路由重建机制。该机制利用空闲时间监听无线信道中传输的所有数据包和路由控制信令，用于维护有效的邻居节点列表及本地路由缓存，有效降低了周期性HELLO消息带来的信令负担，并增加了可用路由信息。中间节点在发现断链时，尝试采用局部修复，尽量避免由源节点广播RREQ消息发现路由。根据本地路由缓存及邻居节点的路由信息，实现了快速的路由发现及修复，能有效降低路由控制信令开销及丢包率。

Cache Bypass and Local Recovery Based Route Reconstruction Scheme for Mobile Ad hoc Networks

According to the disadvantages of the existing AODV and AODV-BR schemes in Ad hoc networks, a cache bypass and local recovery based route reconstruction scheme is proposed in this paper. The mobile node listens in all frames including data packets and routing control signaling in its free time, and maintains a neighbor list and local route cache, thus well reduces signaling cost brought by the periodical HELLO messages, and gains more usable route information. Once the intermediate node detects a broken link, it tries local recovery, instead of broadcasting RREQ messages to achieve route discovery from the source node. Fast route discovery and local recovery will be achieved according to local route cache and neighbors' route caches, thus routing control signaling and packet drop ratio are well reduced.