Abstract:
Now a days wireless network is an essential technology for communication between two or more
mobile nodes, such type of infrastructure-less wireless network is mobile ad-hoc network (MANET).
Network topology of MANET is Dynamic due to mobility of nodes. So, there is a need of routing
protocol for efficient Route or communication of nodes. Dynamic Source Routing(DSR) is one of
those protocols,which needs a cache to store route information.Because of the behavior of nodes in
MANET, there is no any measurement to join or leave the network and occurred long delay and
network overhead due to the problem of frequent routing discovery process and maintaining too
many paths in cache of DSR, so there is a notice with having of a new mechanism which manages
size of route cache through the number and mobility of nodes.
This study focuses on minimizing the delay and network overhead which occurred through route
replay storms and stale routes in reactive routing protocol by optimizing the size of cache based
on the mobility and number of nodes. So specifying cache size is the main issue for minimizing
frequency of route requests, stale routes and route replay storm.
The new proposed work uses the existing routing mechanism of DSR which uses route cache as
a repository for any route and the new algorithm which manages the size of route cache at the
start of the network and when there is a node joins/leaves to/from the network. The architectural
algorithm considers the speed and number of nodes for specifying the size of cache on NS-2 sim ulator tools. The simulation results shows that the new approach KDSR have a greater average
throughput and lower end to end delay and overhead than the existing protocol DSR.This thesis
concludes that by detailing further research studies by releasing the new version of DSR through
variable size of route cache to minimize stale routes and frequency of route requests.
