Multiple Routing Algorithm for Wireless Ad Hoc Network

Abstract

In recent years, on-demand routing protocols have attained more attention inmobile ad hoc networks as compared to other routing schemes due to their abilities and efficiency. There exist many ondemand routing protocols for mobile ad hoc networks (MANETS). Most of the protocols, however, use a single route and do not utilize multiple alternate paths. Multipath routing allows the establishment of multiple paths between a single source and single destination node and when a path breaks an alternate path is used instead of initiating a new route discovery, hence multipath routing represents a promising routing method for wireless mobile ad hoc networks. Multipath routing achieves load balancing and is more resilient to route failures. Recently, numerous on-demand multi-path routing protocols have been proposed for wireless mobile ad hoc networks. Performance evaluations of these protocols showed that they achieve lower routing overhead, lower end to-end delay and alleviate congestion in comparison with single path routing protocols. In this paper, we propose a new shortest multiple routing algorithm for MANETs. It is based on DSR, but which makes the destination nodes get the shortest unattached routes correspondingly is that only the destination nodes can respond to the routing request (RREQ), and the intermediate hosts rebroadcast the shorter RREQ packets with some conditions, besides, there are also some changes done for the route maintenance. Keywords—Uunipath Routing in MANETs, Multiple routing algorithm