Proceedings ArticleDOI
An Optimized Ad-hoc On-demand Multipath Distance Vector(AOMDV) Routing Protocol
Yuhua Yuan,Huimin Chen,Min Jia +2 more
- pp 569-573
TLDR
An optimization of ad hoc on-demand multipath distance vector (OAOMDV) is presented to solve the "route cutoff" problem in AOMVV and simulation results show the performance improvement.Abstract:
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 improvementread more
Citations
More filters
Proceedings ArticleDOI
Multipath hybrid Ad hoc networks for avionics applications in disaster area
TL;DR: An Ad Hoc routing protocol for computing multiple “FSO only” paths to ensure faster communication among the nodes, and using “hybrid paths” consisting of a mixture of FSO and RF links as a backup is developed.
Proceedings ArticleDOI
AOMDV routing algorithm for Wireless Mesh Networks with local repair (AOMDV-LR)
TL;DR: An AomDV protocol with local repair capabilities (AOMDV-LR) is presented, which approaches intermediate nodes in the existing paths try to find new path to the destination in the event of link failure and when no alternate route available.
Proceedings ArticleDOI
Load Balanced Ad-Hoc On-Demand Routing Based on Weighted Mean Queue Length Metric
TL;DR: Simulation results show that the proposed load balancing algorithms yield significant performance gains in terms of the packet delivery ratio, End-to-End delay, and traffic load balancing on nodes.
Proceedings ArticleDOI
Vehicle-to-Vehicle (V2V) Communication using Routing Protocols: A Review
TL;DR: This review paper describes the different design of routing choices which helps to develop different routing algorithms for VANETs, a distinguished approach to an Intelligent Transportation System (ITS).
A multi routing algorithm for ad-hoc networks
Mehdi Bahrami,Mohammad Bahrami +1 more
TL;DR: This paper proposes new routing algorithms for path energy as an additional metric for routing and investigates the effect of the added metric on improving the lif espan of the Ad-Hoc communication network and the corresponding effect on the overall network perform ance.
References
More filters
Ad hoc On-Demand Distance Vector (AODV) Routing
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Proceedings ArticleDOI
On-demand multipath distance vector routing in ad hoc networks
Mahesh K. Marina,Samir R. Das +1 more
TL;DR: Performance comparison of AOMDV with AODV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.
Journal ArticleDOI
A review of routing protocols for mobile ad hoc networks
TL;DR: In this article, a wide range of routing protocols have been proposed in the literature and a performance comparison of all routing protocols and suggest which protocols may perform best in large networks is provided.
Proceedings ArticleDOI
AODV-BR: backup routing in ad hoc networks
Sung-Ju Lee,Mario Gerla +1 more
TL;DR: This work proposes a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes to the Ad-hoc On-Demand Distance Vector protocol and evaluates the performance improvements by simulation.
Proceedings ArticleDOI
On-demand node-disjoint multipath routing in wireless ad hoc networks
Xuefei Li,Laurie Cuthbert +1 more
TL;DR: Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.