Selective route discovery routing algorithm for mobile ad-hoc networks

In mobile ad-hoc networks the real traffic of a node is commonly concentrated in a small number of particular nodes. This characteristic has not been considered in the design of the existing routing algorithms. Therefore, it is difficult to guarantee performance in a simulation environment with realistic accuracy. To resolve this problem we propose a new routing algorithm called the Selective Route Discovery (SRD) algorithm. In this algorithm, each node selects frequently accessed nodes and periodically sends additional RREQ messages. Therefore, it can quickly adapt to the changes in network topology according to the movement of the nodes. This paper shows that the SRD algorithm has a shorter packet delivery time than the AODV algorithm when the simulation condition is improved so that the traffic concentration for each destination node varies.