Authors: Kuo-Feng Ssu, Chih-Hsun Chou, Chi-Sheng Chiu
Addresses: Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan. ' Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan. ' Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan
Abstract: 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 longlived routing paths. The protocol not only considers node mobility but energy consumption also. Based on the prediction, expired backup paths are erased automatically so that the possibility of unsuccessful delivery can be reduced. The mobility prediction can also adjust appropriate transmission power. The DRSP protocol was implemented on ns-2 and evaluation results show that the DRSP outperformed AODV, DSR, and AOMDV.
Keywords: mobile networks; ad hoc networks; wireless networks; multipath routing protocols; multiple paths; power failure; dynamic route switching; node mobility; energy consumption; transmission power.
International Journal of Ad Hoc and Ubiquitous Computing, 2006 Vol.1 No.3, pp.147 - 155
Published online: 24 May 2006 *Full-text access for editors Access for subscribers Purchase this article Comment on this article