Bypass AODV: improving performance of ad hoc on-demand distance vector (AODV) routing protocol in wireless ad hoc networks
Ahed Alshanyour,Uthman Baroudi +1 more
- pp 17
Reads0
Chats0
TLDR
Bypass-AODV enhances resource utilization by avoiding unnecessary error recovery cycles and consequently increases the network throughput and route reliability; it avoids dropping packets by transmitting them over the constructed bypass.Abstract:
Bypass-AODV, a local recovery protocol, is proposed to enhance the performance of AODV routing protocol by overcoming several inherited problems such as unnecessary error recovery invocations, newly non-optimal reconstructed routes, high packet drop ratios, and high routing overheads. Bypass-AODV uses cross-layer MAC-notification to identify mobility-related link break, and then setup a bypass between the broken-link end nodes via an alternative node while keeps on the rest of the route. Therefore, Bypass-AODV enhances resource utilization by avoiding unnecessary error recovery cycles and consequently increases the network throughput. On the other hand, Bypass-AODV enhances route reliability; it avoids dropping packets by transmitting them over the constructed bypass. The simulation results show that when running 1-TCP connection, Bypass-AODV performs better than AODV. In particular, this behavior is rapidly changed with increasing the physical distance between the TCP connection end nodes beyond 2 hops. For example, when number of hops is equal to 6, goodput is enhanced by more than 100% compared to AODV for a 1-TCP connection and about 24% for multiple TCP connections. Further, the ratio of packet drop is reduced from 16% to 2%. Moreover, considering the hop count, the Bypass-AODV shows less sensitivity to the ongoing number of TCP connections.read more
Citations
More filters
Cluster based Routing Protocol for mobile ad hoc networks
TL;DR: A cluster based routing protocol for mobile ad hoc network that uses clustering's structure to decrease average end-to-end delay and improve the average packet delivery ratio.
Proceedings ArticleDOI
Evaluation of parameterised route repair in AODV
TL;DR: A flexible, parameterised and adaptive approach to choosing the Local Repair Threshold, which determines how far along the end-to-end path that a link break needs to occur in order to initiate Local Repair, is defined.
Proceedings ArticleDOI
Intelligent route discovery for ZigBee mesh networks
TL;DR: This study proposes the use of a novel fuzzy-logic-based metric to be used in the decision making process of AODV, which shows a reduction in the communication delay, number of packets and overhead, improving route efficiency and reducing packet overload.
Proceedings ArticleDOI
Random and realistic mobility models impact on the performance of bypass-AODV routing protocol
Ahed Alshanyour,Uthman Baroudi +1 more
TL;DR: Ns-2 simulation results show that bypass-AODV is insensitive to the selected random mobility model and it has a clear performance improvement compared to AODV, but, for vehicular mobility models, bypass- aODV are suffering from performance degradation at high speed conditions.
Journal ArticleDOI
A simulation study: the impact of random and realistic mobility models on the performance of bypass-AODV in ad hoc wireless networks
Ahed Alshanyour,Uthman Baroudi +1 more
TL;DR: Simulation results show an interesting feature that is the insensitivity of Bypass-AODV to the selected random mobility model, and it has a clear performance improvement compared to AODV.
References
More filters
Proceedings ArticleDOI
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
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%.