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

Kumar Verma Pawan,Gupta Tarun,Nitin Nitin,Rakesh Nitin

doi:10.4236/ijcns.2010.33037

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 unpredictably over time. The routing protocols meant for wired network cannot be used for mobile ad-hoc network because 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 networks—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

Highlights

Introduction and MotivationWireless networks are the current field of research as it provides new advancement to the field of mobile network and reliable data transfer
This paper examines two routing protocols for mobile ad-hoc networks—the Destination Sequenced Distance Vector (DSDV), the table-driven protocol and the Ad-Hoc OnDemand Distance Vector routing (AODV), an on-demand protocol and propose an algorithm that facilitates efficient routing of the packet and failure recovery mechanism
Two mobile ad-hoc routing protocols—the Destination Sequenced Distance Vector (DSDV), the table-driven protocol and the Ad-Hoc On-Demand Distance Vector routing (AODV), an On-Demand protocol are selected for study

Summary

Introduction and Motivation

Wireless networks are the current field of research as it provides new advancement to the field of mobile network and reliable data transfer. They provide a mechanism to share the information and services via electronic medium without any geographical constraints. In contrast to infrastructure-based networks, in ad-hoc networks all nodes are mobile and can be connected dynamically in an arbitrary manner. Every node maintains the network topology information in the form of routing tables by periodically exchanging routing information

Table-Driven Routing Protocol

Overview of DSDV and AODV

Comparison of Table-Driven and On-Demand Routing Protocols

Proposed Routing Algorithm

Conclusions and Future Works