PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols

By Narayanan Sadagopan, Fan Bai, Bhaskar Krishnamachari, Ahmed G. Helmy. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2003

319 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/9343884f019d2fe823d22dc7f284c6181f7b00b5

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

In Electrical and Electronic Engineering

Citations in the corpus

MANET simulation studies: the incredibles (2005, methodology): “See [37] for an example of a MobiHoc author that described the analysis and data used to calculate the results.”
AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks (2005, background): “The average link duration has been proposed as a measure for the difficulty of a node mobility scenario which is more general than the maximum node speed [39].”
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case (2008, background): “There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks (VANETs), etc.”
AVE: Autonomous Vehicular Edge Computing Framework with ACO-Based Scheduling (2017, background): “Because communication via a relay of more than 2 hops is unstable according to existing research [22], nodes at more than 2 hops are ignored in both the NAI calculation and further scheduling.”
Connectivity of Wireless Multihop Networks in a Shadow Fading Environment (2003, background): “Last but not least, additional understanding of the connectivity dynamics, e.g., the stochastic properties of the duration of a path between two nodes [14,19, 25 ], needs further investigation.”
Spray and wait: an efficient routing scheme for intermittently connected mobile networks (2005, background): “To see this, note that the expected throughput of reactive protocols is connected with the average path duration PD and the time to repair a broken path trepair with the following relationship: throughput = min{0, rate(1− trepair PD )} [22].”
Denial of service resilience in ad hoc networks (2004, methodology): “We consider a mean route lifetime of E(TL) = 10 s, which corresponds to a high node velocity of Vmax = 30 m/s as reported in [32].”