An Optimized Ad-hoc On-demand Multipath Distance Vector(AOMDV) Routing Protocol
Citations
137 citations
114 citations
88 citations
Cites background from "An Optimized Ad-hoc On-demand Multi..."
...[49] (a multi-path extension of AODV) which distributes trust information through RREQ packets in order to resist bad mouthing and double-face attacks....
[...]
54 citations
50 citations
Cites background or methods from "An Optimized Ad-hoc On-demand Multi..."
...First Hop is used to find out ignored reverse paths and ensure the established reverse paths that are ignored before are linkdisjoint with other established reverse paths [3]....
[...]
...Routing “cutoff” problem can be solved with method proposed in [3]....
[...]
...During the route discovery above, “cutoff” problem [3] will cause some reverse paths to be ignored....
[...]
...RREP First Hop field is used to ensure the link-disjoint character of forward paths, and RREQ First Hop field is used to decide whether route “cutoff” problem exists [3]....
[...]
References
11,490 citations
Additional excerpts
...[3] Lee, S. J. and Gerla, M., “AODV-BR: Backup Routing in Ad hoc Networks,” Proc. of IEEE Wireless Communications and Networking Conference, pp. 1311-1316 (2000)....
[...]
...It uses the routing information already available in the AODV protocol as much as possible....
[...]
...It makes use of AODV control packets with a few extra fields in the packet header such as advertised hop count and route list which contains multiple paths....
[...]
...[2] Perkins, C., Belding-Royer, E., and Das, S., “Ad hoc On-Demand Distance Vector (AODV) Routing,” rfc3561.txt (2003)....
[...]
...Ⅳ SIMULATION RESULT As AOMDV has been proved to outperform AODV in [5], here we only evaluate the performance of AOMDV and OAOMDV protocol using Network Simulator 2 (ns 2) and compare them....
[...]
1,522 citations
"An Optimized Ad-hoc On-demand Multi..." refers background or methods in this paper
...As AOMDV has been proved to outperform AODV in [5], here we only evaluate the performance of AOMDV and OAOMDV protocol using Network Simulator 2 (ns 2) and compare them....
[...]
...[5] tries to find link-disjoint paths....
[...]
...AOMDV[5] extends the prominent AODV to discover multiple link-disjoint paths between the source and the destination in every route discovery....
[...]
...To overcome such inefficiency, several studies [3], [4], [5], [6], [7] have been presented to compute multiple paths....
[...]
...To decrease route discovery frequency in single path routing, some multipath routing protocols have been proposed to extend AODV [3], [4], [5]....
[...]
1,281 citations
711 citations
"An Optimized Ad-hoc On-demand Multi..." refers background in this paper
...[3] Lee, S. J. and Gerla, M., “AODV-BR: Backup Routing in Ad hoc Networks,” Proc. of IEEE Wireless Communications and Networking Conference, pp. 1311-1316 (2000)....
[...]
...It uses the routing information already available in the AODV protocol as much as possible....
[...]
...It makes use of AODV control packets with a few extra fields in the packet header such as advertised hop count and route list which contains multiple paths....
[...]
...[2] Perkins, C., Belding-Royer, E., and Das, S., “Ad hoc On-Demand Distance Vector (AODV) Routing,” rfc3561.txt (2003)....
[...]
...Ⅳ SIMULATION RESULT As AOMDV has been proved to outperform AODV in [5], here we only evaluate the performance of AOMDV and OAOMDV protocol using Network Simulator 2 (ns 2) and compare them....
[...]
93 citations
"An Optimized Ad-hoc On-demand Multi..." refers background in this paper
...To overcome such inefficiency, several studies [3], [4], [5], [6], [7] have been presented to compute multiple paths....
[...]
...[4] selects node-disjoint paths, and it only performs well with high density of mobile nodes....
[...]
...To decrease route discovery frequency in single path routing, some multipath routing protocols have been proposed to extend AODV [3], [4], [5]....
[...]