Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

By Asis Nasipuri, R. Castañeda, Samir R Das. Mob. Networks Appl., 2001

540 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0953f22b973189cad52e517d8200eebac924b3d6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Mobile Ad Hoc Networks (2004, unknown): “Two multipath extensions of DSR were proposed in [34] which aggressively determine multiple disjoint paths for each destination.”
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols (2003, background): “The exponential distribution of link duration also comes up in the analysis of single path and multipath DSR by Nasipuri, Castaneda and Das in [ 20 ].”
AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks (2005, background): “In many of them, only one of the paths is used for data transport, while the others are only used in case of a failure in the primary path [26] [33].”
Ad hoc on-demand multipath distance vector routing (2002, background): “Note that AOMDV also provides intermediate nodes with alternate paths as they are found to be useful in reducing route discovery frequency [9].”
Video transport over ad hoc networks: multistream coding with multipath transport (2003, background): “a) Multipath routing, which focuses on finding multiple routes for a source-destination pair, and on how to select a maximally disjoint set of routes from the multiple routes found [21]‐[ 24 ]; b) Traffic dispersion, which focuses on how to allocate traffic to multiple end-to-end routes [25], [26].”
A MAC protocol for mobile ad hoc networks using directional antennas (2000, methodology): “We assume that the nodes move randomly within the sqaure area of the network following a mobility model similar to that used in [ 12 , 2]. According to this model, every node moves to a new position in the network after a random interval of time.”
A framework for reliable routing in mobile ad hoc networks (2003, background): “Path disjointness has been studied in [2][3][5][11].”
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks (2003, background): “For example, theoretical results with respect to routing ([1], [24]), capacity ([14], [17]), connectivity ([3], [16], [30]), and minimum power issues cannot be applied directly in a mobile scenario that employs the RWP model.”