Download now Free registration required
Multiple path routing has been developed for reliable communication in wired networks. Because of excessive routing overhead, this paper provides a Location-Based Multiple path Routing (LBMR) in the ad hoc approach. This algorithm limits the smaller 'Request zone' ad hoc network protocol LAR to find a new line of shortest path, 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.
- Format: PDF
- Size: 1228.8 KB