A Mobile Ad-Hoc Routing Algorithm with Comparative Study of Earlier Proposed Algorithms

Abstract

A mobile ad-hoc network is an autonomous collection of mobile nodes that communicate over bandwidth constrained wireless links. Due to nodal mobility, the network topology may change rapidly and unpredicta-bly over time. The routing protocols meant for wired network cannot be used for mobile ad-hoc network be-cause of mobility of network. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Ad-Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm have been implemented. The ad-hoc routing protocols can be divided into two classes; Table-Driven and On-Demand. This paper examines two routing protocols for mobile ad-hoc net-works—the Destination Sequenced Distance Vector (DSDV), the table-driven protocol and the Ad-Hoc On- Demand Distance Vector routing (AODV), an on-demand protocol and propose an algorithm that facilitates efficient routing of the packet and failure recovery mechanism.