Paper Info
Title
A resilient routing approach for Mobile Ad Hoc Networks
Abstract
This paper presents a resilient routing algorithm that is more suitable for a Mobile Ad Hoc Network (MANET) with node quick moving or node sparse, than traditional routing algorithms such as Ad-hoc On-demand Distance Vector (AODV) routing. Since AODV routing in MANETs is known for its advantageous properties, the proposed routing algorithm is based on the AODV, and called RAODV (Resilient AODV). In the route discovery phase, it differs from AODV, which only establishes one routing path from a source node to the destination node, whereas RAODV establishes as many routes as possible. Thus, when the primary route breaks, the node can immediately adopt an alternative route without further route research effort. If no possible alternative route exists, the node will transmit the route break information backward to instruct the previous node on the reverse route to select an alternative one, and so on. The proposed RAODV can reduce the number of route rediscovery procedures, and thus improve the packet loss rate and transmission delay, especially in sparse MANETs. Simulator ns2 was used to evaluate the performance of RAODV. In some cases, the proposed RAODV was able to reduce the packet loss rate by 72.61% compared to traditional AODV.
Year
DOI
Venue
2015
10.1109/HPCSim.2015.7237102
2015 International Conference on High Performance Computing & Simulation (HPCS)
Keywords
Field
DocType
Sparse MANETs,Ad-hoc On-demand Distance Vector (AODV),Resilient AODV (RAODV),multiple routes,ns2
Link-state routing protocol,Ad hoc On-Demand Distance Vector Routing,Dynamic Source Routing,Static routing,Computer science,DSRFLOW,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Optimized Link State Routing Protocol,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4673-7812-3
0
0.34
References 
Authors
4
2
Name
Order
Citations
PageRank
Ming-Yang Su136222.26
Chih-Wei Yang200.34