A New Multiple Routing Algorithm for Ad Hoc Networks

Design and analysis of routing protocols are the key issues for a mobile ad hoc networks (MANETs). In this paper, we propose a new multiple routing algorithm - the shortest multiple source routing (SMSR) algorithm for MANETs. SMSR is based on dynamic source routing (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. The DSR protocol is compared with the SMSR algorithm under OPNET in routing overhead ratio, packets delivery ratio and average end-to-end delay. The simulation results show that the performance of the SMSR algorithm is better than the DSR protocol.