A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of TCP performance over mobile 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
Ensuring cache freshness in on-demand ad hoc network routing protocols
Proceedings of the second ACM international workshop on Principles of mobile computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Mitigating channel usage in cooperative caching for Mobile Ad hoc Networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately estimate timeouts because topology changes are unpredictable. In this paper, we propose proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is key to the adaptation of on-demand routing protocols to mobility.