On-demand routing protocols use route caches to make routing decisions.
Distributed cache updating dynamic source routing protocol pdf
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-Max Life, 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.ABSTRACT: Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation, communication, and sensing abilities, in a battery-powered sensor network, energy and communication bandwidth are a precious resources.Thus, there is a need to adapt the networking process to match the application in order to minimize the resources consumed and extend the life of the network.In this paper, we introduce a comparative study in different routing algorithms that propose vital solutions to the most important issues that should be taken into account when designing wireless network which are reliability, lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will introduce their algorithms and discuss how did they propose to solve such of these challenges and finally we will do some evaluation to each approach.ABSTRACT: Route discovery in manymobile ad hoc protocols is based on flooding.