Personalized RAODV algorithm for reduce link break in mobile ad hoc networks

Mobile ad hoc networks is a self organizing wireless networks for mobile devices. It does not require any fixed infrastructure due to no wired backbone. It is suitable to use in environment that have a need of on the fly set-up. Every host is a router and packet forwarder. Each node may be mobile, and topology changes frequently and unpredictably due to the arbitrary mobility of mobile nodes. This aspect leads to frequent path failure and route rebuilding. Routing protocol development depends on mobility management, efficient bandwidth and power usage which are critical in ad hoc networks. In this paper, personalized Ad hoc On demand Distance Vector (RAODV) algorithm to reduce the link break scheme for mobile ad hoc networks. This present approach reduces packet loss and finds optimized route by taking into consideration of bandwidth, delay which results by improvement of quality of service. The performance analysis and simulation are carried out to evaluate network performance using network simulator NS-2 based on the quantitative basic parameters like throughput, delay in term of number of nodes and various mobility rates. A simulation result was during the comparison of AODV protocol with RAODV the probability of link break has been decreases in RAODV considering when various pause times and increases number of nodes.