Caching strategies in on-demand routing protocols for wireless ad hoc networks

By Yih-Chun Hu, David B. Johnson. ACM/IEEE International Conference on Mobile Computing and Networking, 2000

403 citations recorded by the source corpus.

An on-demand routing protocol for wireless and hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a data packet addressed to that node. In order to avoid the need for such a route discovery to be performed before each data packet is sent, such routing protocols must cache routes previously discovered. This paper presents an analysis of the effects of different design choices for this caching in on-demand routing protocols in wireless ad hoc networks, dividing the problem into choices of cache structure, cache capacity, and cache timeout. Our analysis is based on the Dynamic Source Routing protocol (DSR), which operates entirely on-demand. Using detailed simulations of wireless ad hoc networks of 50 mobile nodes, we studied a large number of different caching algorithms that utilize a range of design choices, and simulated each cache primarily over a set of 50 different movement scenarios drawn from 5 different types of mobility models. We also define a set of new mobility metrics that allow accurate characterization of the relative difficulty that a given movement scenario presents to an ad hoc network routing protocol, and we analyze each mobility metric's ability to predict the actual difficulty in terms of routing overhead experienced by the routing protocol across the scenarios in our study.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/01a3a39fbe971455380418d00b6f1a22f81881e5

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

Effective replica allocation in ad hoc networks for improving data accessibility (2001, background): “Some other routing protocols have also been proposed by several research groups[7], [9], [13], [17], [18], [19], [24].”
Ad hoc on-demand multipath distance vector routing (2002, neutral): “These issues are, however, being addressed [13,35,36].”
Performance comparison of two on-demand routing protocols for ad hoc networks (2000, background): “More recently, the effects of cache structure, cache capacity, cache timeouts, and mobility patterns on the performance of DSR were studied [ 8 ].”
Real-time communication and coordination in embedded sensor networks (2003, background): “As reported in [67], the majority of packet loss in ad-hoc networks are due to outdated entries in the routing cache.”
A SURVEY OF MOBILITY MODELS in Wireless Adhoc Networks (2004, methodology): “The Gauss-Markov Mobility Model was first introduced by Liang and Haas[13] and widely utilized[14][2].”
An on-demand minimum energy routing protocol for a wireless ad hoc network (2002, methodology): “[10] use a similar structure, the so-called link cache for storing the information obtained from the route replies.”
Preemptive routing in Ad Hoc networks (2001, background): “For example Hu and Johnson analyzed the effect of several cache parameters [19] on cache operation.”
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks (2002, methodology): “Some of these optimizations are relatively easy to secure; for example, flow state [19] requires only broadcast authentication of control messages, whereas link-state caching [18] requires some mechanism to authenticate links, whereas Ariadne only attempts to authenticate nodes.”
Performance of route caching strategies in Dynamic Source Routing (2001, background): “More recently, the effects of cache structure, cache capacity, cache timeouts and mobility patterns on the performance of DSR were studied in [8].”