MODEL FOR ROUTING SCHEDULING IN A MOBILE ADHOC NETWORK

Abstract

Mobile ad hoc networks (MANETS) are self-created and self-organized by a collection of mobile nodes, interconnected by multi-hop wireless paths in a strictly peer to peer fashion. DSR (Dynamic Source Routing) is an on-demand routing protocol for wireless ad hoc networks that floods route requests when the route is needed. Route caches in intermediate mobile node on DSR are used to reduce flooding of route requests. But with the increase in network size, node mobility and local cache of every mobile node cached route quickly become stale or inefficient. In this paper, for efficient searching, we have proposed a generic searching algorithm on associative cache memory organization to faster searching single/multiple paths for destination if exist in intermediate mobile node cache with a complexity (Where n is number of bits required to represent the searched field).The other major problem of DSR is that the route maintenance mechanism does not locally repair a broken link and Stale cache information could also result in inconsistencies during the route discovery /reconstruction phase. So, to deal this, we have proposed an optimized cache coherence handling scheme for on -demand routing protocol (DSR). Mobile Ad-Hoc Network (MANET) is an infrastructure less wireless network of autonomous collection of mobile nodes (Smart phones, Laptops, iPads, PDAs etc.). Network is self-configured to reconstruct its topology and routing table information for the exchange of data packets on the joining and leaving of each node on ad-hoc basis. This project is based on the MANET applications and challenges. The researchers can get the overall concept of MANET as well as its applications and challenges.