Distributed cache updating for the dynamic source routing protocol ieee

Each node maintains in its cache table the information necessary for cache updates.

distributed cache updating for the dynamic source routing protocol ieee-51distributed cache updating for the dynamic source routing protocol ieee-39

We present an implementation of SRR in AODV routing protocol.

The results of an extensive simulation study confirm the performance improvement in all critical metrics, namely, packet delivery ratio, control overhead and end-to-end delay. Marina and Das [20] proposed three techniques to improve cache correctness in DSR: wider error notification, route expiry mechanism with adaptive timeout selection and negative caches. As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity.

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.

We conclude that cross-layer information awareness is key to making TCP efficient in the presence of mobility. When a node detects a link failure, our algorithm proactively notifies all reachable nodes that have cached that link about the link failure.

Therefore, it enables the routing protocol at TCP sender... On-demand routing protocols use route caches to make routing decisions.

The RREP travels hop by hop on the discovered route in reverse direction or on another route to the source.

Sometimes the RREP can not be sent to the intended next hop by an intermediate node due to the dynamic network topology or network congestion.

For lost ACKs, BEAD attempts to retransmit ACKs at either intermediate nodes or TCP receivers.

Tags: , ,