Dynamic Route Switching Protocol in Mobile Ad Hoc Networks

Due to limited bandwidth, how to decrease routing overhead is an important issue in mobile ad hoc networks. Several multipath routing protocols have been proposed to reduce the frequency of route discovery. However, in rapidly changed network topologies, some backup paths may be broken before a host uses them. Additionally, to obtain multiple loop-free paths, some protocols only select backup paths that are equal or shorter than the first found path. Longer routing paths are discarded even if they can stay available longer than the primary path. This paper presents a dynamic route switching protocol (DRSP) to locate more useful and long-lived routing paths. The protocol not only considers node mobility but energy consumption. Based on the prediction, invalid backup paths are erased automatically so the possibility of unsuccessful delivery can be reduced. The mobility prediction also can adjust appropriate transmission power. The DRSP protocol was implemented on ns-2 and simulation results show that the DRSP outperformed AODV, DSR, and AOMDV