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

Authors:
Zhao Cheng;Wendi B. Heinzelman
Affiliations:
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
Venue:
International Journal of High Performance Computing and Networking
Year:
2006

Citing 10
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Query localization techniques for on-demand routing protocols in ad hoc networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An Application of Parameter Estimation to Route Discovery By On-Demand Routing Protocols

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Performance of Route Caching Strategies in Dynamic Source Routing

ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Flooding strategy for target discovery in wireless networks

MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems

Quantified Score

Hi-index	0.00

Visualization

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.