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
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
Scenario-based performance analysis of routing protocols for 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
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Performance of Route Caching Strategies in Dynamic Source Routing
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
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
CAPTURE: location-free contact-assisted power-efficient query resolution for sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
Distributed Cache Updating for the Dynamic Source Routing Protocol
IEEE Transactions on Mobile Computing
Flooding strategy for target discovery in wireless networks
Wireless Networks
Node density effects on reactive routing protocols for mobile ad hoc wireless networks
AINTEC'06 Proceedings of the Second Asian international conference on Technologies for Advanced Heterogeneous Networks
Hi-index | 0.00 |
In a wireless ad hoc network, nodes cooperate to forward packets for each other over possibly multi-hop paths, to allow nodes not within direct wireless transmission range to communicate. Many routing protocols have been proposed for the ad hoc network environment, several of which operate on-demand and utilize a route cache listing links that this node has learned. In such protocols, aggressive caching of overheard routes can significantly improve performance; in particular, overhead can be reduced by leverag-ing information received in packets overheard or forwarded from other nodes, including other routing packets and the source routes on other data packets. Unfortunately, such information sharing can substantially increase the risk of cache cross-pollution, since stale routing information in one node's cache, representing a link that no longer exists, can easily be added into the caches of other nodes. Even when a node has actually learned that a link no longer exists, it is still possible for that node to again hear the stale information. In this paper, we present a new mechanism which we call epoch numbers, to reduce this problem of cache staleness, by preventing the re-learning of stale knowledge of a link after having earlier heard that the link has broken. Our scheme does not rely on ad hoc mechanisms such as short-lived negative caching; rather, we allow a node having heard both of a broken link and a discovery of the same link to sequence the two events in order to determine whether the link break or the link discovery occurred before the other.