Developing Optimization of Aodv Protocol in Mobile Ad Hoc Network

Abstract

Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise newlinewireless mobile nodes which can freely and dynamically self-organize into arbitrary and newlinetemporary (adhoc) network topologies, allowing people and devices to seamlessly internetwork newlinein areas with no preexisting communication infrastructure. In ad hoc networks, each node acts newlineas both- a router and as a host. Also the topology of an ad hoc network changes dynamically, newlinewhich makes it difficult to design an efficient routing protocol. Routing algorithms determine newlinethe specific choice of route. A MANET protocol should function effectively over a wide range newlineof networking context from small, collaborative, ad hoc groups to larger mobile, multi hop newlinenetworks. Three types of routing protocols are available: proactive, reactive and hybrid. There newlineare many ad hoc routing protocols, such as DSDV, WRP, OLSR (proactive protocols) or newlineReactive protocols like AODV, DSR, TORA, and hybrid protocol ZRP. newlineThe AODV protocol works as a pure on-demand route acquisition system. It provides excellent newlineconnectivity, but end-to-end delay is higher as compared to proactive routing protocol. Even newlinethough overhead requirement of this protocol is less as compared to proactive protocol, but still newlineit has scope for further reduction. Alternate way of repairing route locally can reduce control newlineoverhead and hence delay occurs in route maintenance. Alternate route finding for next to next newlinenode and use of this alternate link in case of link breakage is a better option for route newlinemanagement, as all nodes in the link are active and link breakage is observed due to movement newlineof a single node. Large number of control packets can be avoided by removing hello packets newlineused to maintain connectivity between nodes. This improves bandwidth utilization of the newlinenetwork. newlineIn this research, an algorithm based on alternate route finding for next to next node in AODV is newlinesuggested. In case of link breakage, this alternate route can be used to continue data transfer.

Description

Keywords

Citation

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced