Abstract
In recent years, ad hoc networks have attracted a great deal of attention. Ad hoc networks consist of nodes with wireless communication devices without any base stations or fixed infrastructures. Most routing protocols of ad hoc networks form a single-path. Single-path routing protocols need to repair routes each time the route has broken. This route repair generates a lot of control packets, and an increase in end-to-end packet delay. In order to compensate for these drawbacks of the single path routing, multipath routing schemes have been proposed. AOMDV (Ad hoc On-demand Multipath Distance Vector routing) is one multipath routing scheme. AOMDV constructs routes by flooding Route Request (RREQ) messages. When the number of nodes increases in the network, the routing load of AOMDV, which is defined as the ratio of the number of control packets to the number of delivered packets, may increase immensely. On the other hand, DART (Dynamic Address RouTing) has been proposed for a large scale network. In DART, the dynamic routing address has a tree-based logical structure related to connectivity between adjacent nodes. In this paper, we propose a multipath routing scheme to solve the above problems of AOMDV. The proposed scheme is an extension of DART for dealing with multiple paths. The proposed scheme aims to reduce the routing load and adapt to large ad hoc networks. We evaluated its performance by comparing it with AODV and AOMDV through simulation experiments. Performance metrics are the number of control packets and the routing load. Simulation results indicate the proposed scheme can reduce the number of control packets and the routing load.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abidi, S., Erfani, S.: A multipath routing survey for mobile ad-hoc networks. In: Proceedings of the 3rd IEEE Consumer Communications and Networksing Conference (CCNC 2006), vol. 2, pp. 984–988 (2006)
Eriksson, J., Faloutsos, M., Krishnamurthy, S.V.: DART: Dynamic address routing for scalable ad hoc and mesh networks. IEEE/ACM Transactions on Networking 15(1), 119–132 (2007)
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)
Lee, S.-J., Gerla, M.: Split multipath routing with maximally disjoint paths in ad hoc networks. In: Proceedings of IEEE International Conference on Communications (ICC 2001), vol. 10, pp. 3201–3205 (2001)
Marina, M.K., Das, S.R.: Marina and Samir R. Das. Ad hoc on-demand multipath distance vector routing. SIGMOBILE Mobile Computing and Communication Review 6(3), 92–93 (2002)
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-demand Distance Vector (AODV) routing. RFC 3561 (Experimental) (July 2003)
Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100. IEEE Computer Society Press, Los Alamitos (February 1999)
Scalable Network Technologies, Inc., QualNet network simulator
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Okazaki, T., Kohno, E., Ohta, T., Kakuda, Y. (2010). A Multipath Routing Method with Dynamic ID for Reduction of Routing Load in Ad Hoc Networks. In: Zheng, J., Simplot-Ryl, D., Leung, V.C.M. (eds) Ad Hoc Networks. ADHOCNETS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17994-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-17994-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17993-8
Online ISBN: 978-3-642-17994-5
eBook Packages: Computer ScienceComputer Science (R0)