Ad hoc网络局部路由发现算法

Novel local route discovery algorithm in ad hoc networks

针对自组(ad hoc)网络按需路由协议采用全网络广播方式来进行路由发现带来的网络路由开销较大问题,提出一种减少网络路由开销的局部路由发现算法.路由附近节点根据当前路由上发送的数据报文计算到达目的节点的最小跳数;当路由发生中断时,路由发现请求报文将在中断路由附近节点间按照最小跳数减小的方式传递,从而合理限制路由发现范围;通过增大中断链路附近节点转发路由发现报文跳数的方式,扩大局部搜索范围,提高路由发现成功率.仿真实验结果表明,本算法最多可以减少约60%的网络路由开销,降低约70%的平均网络延迟,提升约10%的数据报文发送成功率.此外,任何基于广播方式进行路由发现的路由协议都可以使用这种算法优化性能.

In ad hoc networks, to solve the high level of routing overhead problem while on-demand routing protocols using full-net query flooding during route discovery, a local route discovery algorithm was proposed to reduce the routing overhead. Nodes around every route calculated the minimal hop counts to the destination node based on data packets through the route. When one route was broken, the route discovery request packets would be relayed only by nodes around the broken route in the way of the minimal hop counts decreased, which reasonably restricted route discovery region. The route discovery range would be enlarged by adding hop counts of route discovery request packets relayed by nodes around the broken link, which increased local route discovery success rate. The experimental results by simulation indicate this algorithm could contribute to reducing the routing overhead by about 60% , cutting down the average end-to-end delay by about 70% , and increasing the packet delivery ratio by about 10% at most. In addition, any routing protocol depending on flooding based routing discovery can use this algorithm for performance optimization.