A Location-Based Multi-path Routing approach in Ad Hoc networks

In QoS routing for wired networks, multiple path routing is popularly used. Because of excessive routing overhead, algorithms are not well suited for ad hoc networks. A Location-Based Multi-path Routing (LBMR) approach in Ad hoc is provided in this paper. This approach gets a shortest path by limiting the search for a new route to a smaller “request zone” of the ad hoc network (as in the LAR protocol) and uses intermediate nodes' location information to find another disjoint path by using Dijkstra's algorithm at destination node. Providing multiple routes helps to minimize route recovery process and to control message overhead. A per-packet allocation scheme is arranged to distribute data packets into two paths of active sessions. The results of simulation show that this routing method has good network performance with high packet delivery ratio, low control overload and low average end-to-end delay.