On Demand Multipath Routing Algorithm for Adhoc Wireless Networks

In this paper, a new shortest multiple routing algorithm for MANETs is proposed. This is based on DSR, but makes the destination nodes get the shortest unattached routes correspondingly 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. A Shortest Multiple Routing Algorithm (SMSR) based on the DSR protocol is presented. The intention of the algorithm is to get more topology messages and the correspondingly shortest routes.