Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks
by Zhao Cheng, Wendi B. Heinzelman
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 1/2, 2006

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.

Online publication date: Sun, 09-Jul-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com