Abstract
Mobile adhoc network is a set of mobie devices that can communicate with each other without infrastructure. The reactive protocols use a flood-based discovery mechanism to find routes when required. Since each route discovery incurs high overhead and latency, the frequency of route discoveries must be kept low for on-demand protocols to be effective. Multipath on-demand routing protocols can achieve better performance and scalability because in the single route discovery process it will find out the several routes. This paper proposed a novel multipath routing scheme which is used to reduce the routing overhead by using derived paths. The multipath routing scheme calculates fail-safe multiple routes and gives all the in between nodes of the prime path with several paths to target node. Simulations show that the performance of proposed approach is better than the conventional AODV.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Perkins, C.E., Royer, E.M.: Ad-hoc On-Demand Distance Vector Routing scalability. Mobile computing and communication Review 1(2) (2002)
Lee, S.J., Gerla, M.: AODV-BR: Backup Routing in ad hoc networks. In: IEEE Wireless Communications and Networking Conference WCNC, September 2000, vol. 3, pp. 1311–1316 (2000)
Marina, M.K., Das, S.R.: AOMDV: On-demand Multipath Distance Vector Routing in Ad Hoc Networks. ACM SIGMOBILE Mobile Computing and Communications Review 6(3), 92–93 (2002)
Lee, S.-J., Gerla, M.: Split Multipath Routing with Maximally Disjoint Paths in Ad hoc Networks. In: Proceedings of IEEE International Conference on Communications (June 2001)
Lim, H., Xu, K., Gerla, M.: TCP performance over multipath routing in mobile ad hoc networks. In: IEEE international conference on communication (ICC), vol. 2, pp. 1064–1068 (2003)
Liang, Q., Ren, Q.: Energy and mobility aware geographical multipath routing for wireless sensor networks. In: Proceedings of the IEEE wireless communications and networking conference, March 2005, vol. 3, pp. 1867–1871 (2005)
Jing, F., Bhuvaneswaran, R.S., Katayama, Y., Takahashi, N.: A multipath on-demand routing with path selection probabilities for mobile ad hoc networks. In: Proceedings of the international conference on wireless communications, networking and mobile computing 2005, vol. 2, pp. 1145–1148 (2005)
Tsirigos, A., Haas, Z.J., Tabrizi, S.S.: Multipath routing in mobile ad hoc networks or how to route in the presence of frequent topology changes. In: Proceedings of the military communications conference, Vienna, Virginia, October 2001, vol. 2, pp. 878–883 (2001)
Yao, Z., Jiang, J., Fan, P., Cao, Z., Vok, L.: A neighbor table based multipath routing in ad hoc networks. In: 57th IEEE semiannual vehicular technology conference, April 2003, vol. 3, pp. 1739–1743 (2000)
Dulman, S., Wu, J., Havinga, P.: An energy efficient multipath routing algorithm for wireless sensor networks. In: Proceedings of the 6th international symposium on autonomous decentralized systems with an emphasis on advanced distributed transportation systems, Pisa, Italy (April 2003)
Wang, L., Jang, S., Lee, T.-Y.: Redundant source routing for real-time services in ad hoc networks. In: Proceedings of IEEE international conference on mobile ad hoc and sensor systems conference, Washington, DC (November 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaisankar, N., Saravanan, R., Swamy, K.D. (2010). A Novel Multipath Routing Scheme in Mobile Adhoc Networks. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-12214-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12213-2
Online ISBN: 978-3-642-12214-9
eBook Packages: Computer ScienceComputer Science (R0)