Yih-Chun Hu
David B. Johnson
ABSTRACT
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.
- 1.Josh Broch, David B. Johnson, and David A. Maltz. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks. Internet-Draft, draft-ietf-manet-dsr-03.txt, October 1999. Work in progress.Google Scholar
- 2.Josh Broch, Dave Maltz, Dave Johnson, Yih-Chun Hu, and Jorjeta Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 85-97, October 1998. Google Scholar
- 3.Kevin Fall and Kannan Varadhan, editors, ns Notes and Documentation. The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC, November 1997. Available from http://www-mash.cs.berkeley, edu/nsd.Google Scholar
- 4.Zygmunt J. Haas. A Routing Protocol for the Reconfigurable Wireless Network. In 1997 IEEE 6th International Conference on Universal Person Communications Record. Bridging the Way to the 21st Century, ICUPC '97, volume 2, pages 562- 566, October 1997.Google Scholar
- 5.IEEE Computer Society LAN MAN Standards Committee. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Std 802.11--1997. The Institute of Electrical and Electronics Engineers, New York, New York, 1997.Google Scholar
- 6.Internet Engineering Task Force MANET Working Group. Mobile Ad-hoc Networks (manet) Charter. Available at http://www, ietf. orgthtml.charters/manet-charter, html.Google Scholar
- 7.Per Johansson, Tony Larsson, Nicklas Hedman, Bartosz Mielczarek, and Mikael Degermark. Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks. In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 195- 206, August 1999. Google Scholar
- 8.David B. Johnson. Routing in Ad Hoc Networks of Mobile Hosts. In Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications, pages 158-163, December 1994.Google Scholar
- 9.David B. Johnson and David A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In Mobile Computing, edited by Tomasz Imielinski and Hank Korth, chapter 5, pages 153-181. Kluwer Academic Publishers, 1996.Google ScholarCross Ref
- 10.John Jubin and Janet D. Tornow. The DARPA Packet Radio Network Protocols. Proceedings of the IEEE, 75(1):21-32, January 1987.Google Scholar
- 11.Young-Bae Ko and Nitin Vaidya. Location-Aided Routing (LAR) in Mobile Ad Hoc Networks. In Proceedings of the Fourth International Conference on Mobile Computing and Networking (MobiCom'98), pages 66--75, October 1998. Google ScholarDigital Library
- 12.Tony Larsson. Personal communication, February 8, 2000.Google Scholar
- 13.Ben Liang. Personal communication, February 4, 2000.Google Scholar
- 14.Vincent D. Park and M. Scott Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proceedings oflNFOCOM'97, pages 1405-1413, April 1997. Google ScholarDigital Library
- 15.Charles E. Perkins and Elizabeth M. Royer. Ad-Hoc On- Demand Distance Vector Routing. In Second iEEE Workshop on Mobile Computing Systems and Applications, pages 90- 100, February 1999. Google Scholar
- 16.Miguel Sanchez. RE: Mobility pattern in a MANET, June 25, 1998. IETF MANET Mailing List, Message-ID: <000a01 bda0555d84f9380511352a9e@ msanchez.disca, upv. es>.Google Scholar
- 17.Miguel Sanchez. Re: Node Movement Models in Ad hoc, July 15, 1999. IETF MANET Mailing List, Message-ID: <378DC8F6.B01 CF351 @disca.upv.es>.Google Scholar
- 18.Miguel Sanchez. Personal communication, February 1, 2000.Google Scholar
Index Terms
- Caching strategies in on-demand routing protocols for wireless ad hoc networks
Recommendations
Performance evaluation of routing protocols for ad hoc wireless networks
A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links. Such networks are expected to play an increasingly important role in future civilian and military settings, being useful for ...
Efficient on-demand routing for mobile ad hoc wireless access networks
In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the ...
Predictive caching strategy for on-demand routing protocols in wireless ad hoc networks
Route caching strategy is important in on-demand routing protocols in wireless ad hoc networks. While high routing overhead usually has a significant performance impact in low bandwidth wireless networks, a good route caching strategy can reduce routing ...
Comments