Title: Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks

Authors: Zhao Cheng, Wendi B. Heinzelman

Addresses: Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY 14627, USA. ' Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY 14627, USA

Abstract: On-demand routing protocols are widely used in mobile ad hoc networks due to their capability of adjusting to frequent network topology changes within acceptable routing overhead. In this paper, we reinvestigate two techniques, route caching and searching localisation, in particular their joint effect on reducing routing overhead. We first analyse and present the optimal value for two essential parameters: route caching validation probability and local searching radius. We then propose a new routing strategy that adapts to the current caching availability and is self-tunable towards the optimal performance. Simulation shows that routing overhead is thus greatly reduced.

Keywords: route caching; adaptive local searching; caching strategies; on-demand routing protocols; ad hoc networks; mobile networks; routing overhead reduction; simulaiton.

DOI: 10.1504/IJHPCN.2006.010203

International Journal of High Performance Computing and Networking, 2006 Vol.4 No.1/2, pp.51 - 65

Available online: 09 Jul 2006 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article