Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

In a reactive routing protocol such as DSR, when a route search message is flooded, a large number of nodes learn the path to the originator of the search. Moreover, each of these nodes learns paths to all upstream nodes along the route to the originator. Thus, during a route search, a large amount of topology information is distributed and stored in cache. This information is then used to reduce the number of hops future route search messages must travel. In this paper a model of the impact of topology cache is developed. The model allows the impact of cache to be estimated for a wide range of node speeds, node densities, network sizes, and values of cache timeout. When compared to simulation, the model predicts the number of hops that the route search message spreads within 10%. This model allows a wide range of analysis to be performed. For example, the paper includes an investigation of optimal cache timeout and an investigation of the impact of cache in highly mobile environments.

REFERENCES

• 1: D. Johnson, Y. Hu, and D. Maltz, "The dynamic source routing protocol (dsr) for mobile ad hoc networks for ipv4", RFC 4728 (Experimental), Internet Engineering Task Force, Feb. 2007.
• 2: Richard J. La , Yijie Han, Distribution of path durations in mobile ad hoc networks and path selection, IEEE/ACM Transactions on Networking (TON), v.15 n.5, p.993-1006, October 2007 [doi>10.1109/TNET.2007.896241]
• 3: Brad Williams , Tracy Camp, Comparison of broadcasting techniques for mobile ad hoc networks, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513825]
• 4: Josh Broch , David A. Maltz , David B. Johnson , Yih-Chun Hu , Jorjeta Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.85-97, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288256]
• 5: William Navidi , Tracy Camp, Stationary Distributions for the Random Waypoint Mobility Model, IEEE Transactions on Mobile Computing, v.3 n.1, p.99-108, January 2004 [doi>10.1109/TMC.2004.1261820]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols
          Subjects: Routing protocols