Routing Protocol for Mobile Ad Hoc Network

Abstract

Routing protocol is the act of moving information across an inter-network from a source to a destination. Routing directs forwarding by passing of packets from their source toward their ultimate destination through intermediary nodes. The routing process usually directs forwarding on the basis of routing tables within the routers, which maintain a record of the best routes to various network destinations. Thus the construction of routing tables becomes very important for efficient routing. In wireless ad hoc networks, all nodes are mobile and can be connected dynamically in an arbitrary manner. One way to enhance the performance of routing protocol is to improve the metrics used in the route selection. This paper aims to find a way to minimize the end to end delay in the event of congestion in the primary route path and increase throughput by using the least amount of control bits. The proposed protocol is solved the congestion by using an additional factor in selecting the best available path, this factor depends on the assessment of congestion on the primary path. This has been accomplished by using the stored routing information that is not used by the primary routing table in the selecting of an alternative route. The proposed protocol has been compared with the AODV protocol and OLSR protocol. The Experimental results suggest a remarkable E-DSDV's performance in an end-to-end delay, NRL and throughput metrics are better than OLSR and AODV.