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
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
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
On the improving strategies upon the route cache of DSR in MANETs
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
Hi-index | 0.00 |
Dynamic Source Routing (DSR) is an efficient on-demand routing protocol for ad hoc networks, in which only needed routes are found and maintained. The route discovery/setup phase becomes the dominant factor for applications with short-lived small transfer traffic (one single packet or a short stream of packets per transaction) between the source and the destination: resource discovery, text-messaging, object storage/retrieval, queries and short transactions. Route caching is helpful to avoid the need for discovering a route or to shorten route discovery delay before each data packet is sent. The goal of this work is to develop a caching strategy that permits nodes to update their cache quickly to minimize end-to-end delay for short-lived traffic. The proposed approach consists of an Active Packet that travels through the nodes of the network twice. During the first travel, it visits the nodes collecting fresh network topology information. When the first visit is finished, another one is started to validate and update the caches of the nodes with this newly obtained information. This mechanism removes invalid cache links and caches valid links based on the collected topology information. The correct information in caches allows to speed up the Route Discovery and even to avoid it.