An Optimized Ad-hoc On-demand Multipath Distance Vector(AOMDV) Routing Protocol

To avoid frequent route discovery, various multipath routing protocol has been proposed based on the existing single path routing protocol in ad hoc networks. Ad hoc on-demand multipath distance vector (AOMDV) is one of extensions to the well-studied ad hoc on distance vector (AODV). In this paper an optimized AOMDV (OAOMDV) is presented to solve the "route cutoff" problem in AOMDV. The proposed protocol adds a new scheme into AOMDV and simulation results show the performance improvement

[1]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[2]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[3]  Laurie G. Cuthbert,et al.  On-demand node-disjoint multipath routing in wireless ad hoc networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[4]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[5]  Rong-Hong Jan,et al.  An efficient multiple paths routing protocol for ad-hoc networks , 2001, Proceedings 15th International Conference on Information Networking.

[6]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[7]  Hiroaki Higaki,et al.  Multiple-route ad hoc on-demand distance vector (MRAODV) routing protocol , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..