Performance Comparison of AODV and DSDV Routing Protocols of MANET

Performance Comparison of AODV and DSDV Routing Protocols of MANET

Bhaskar N. Patel (B.S. Patel Polytechnic, India) and S.G. Prajapati (B.S.Patel Polytechnic, India)
Copyright: © 2012 |Pages: 8
DOI: 10.4018/978-1-4666-0321-9.ch008

Abstract

A mobile ad hoc network is a collection of mobile nodes communicating without wired network and infrastructure or centralized control. Due to limited transmission range of wireless network, more than single hops may be required to transfer data across the network. In order to reliable communication within the network, a routing protocol is used which are call MANET routing protocol. The major function of such an MANET routing protocol is to establishment short and real route between a pair of nodes so that messages may be delivered in a timely manner. This chapter examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the pro-active routing protocol, and the Ad hoc On- Demand Distance Vector routing (AODV), an re-active routing protocol. The authors compare both protocols based on packet delivery fraction and average delay with changing number of source nodes and pause time.
Chapter Preview
Top

1. Introduction

With the recent advances in mobile and wireless technology, more and more mobile devices with wireless capability are covering the global market. It has become necessary to set up networks without costly infrastructure and investment. This is the driving force behind wide-scale use of MANETs (Mobile Ad-Hoc Networks). An Ad-Hoc mobile network is a collection of nodes that are capable of changing on a continual basis. A routing protocol is used to discover routes between the nodes, so as to facilitate communication between these nodes.

  • •

    Description of Chapter

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. It evaluates both protocols based on packet delivery fraction, average delay and throughput while varying number of nodes and pause time using NS-2 (Network Simulator). Traffic pattern and node mobility is generated using ns-2 utility and performance metrics are calculated using a java module.

Top

4. Destination Sequence Distant Vector Protocol

The destination sequenced distance vector routing protocol is a proactive routing protocol which is a modification of conventional Bellman-Ford routing algorithm. every time adds a new attribute, sequence number, to each route table entry at each node. Each node maintained Routing table and with this table, node transmits the packets to other nodes in the network. This protocol was motivated for the use of data exchange along changing and arbitrary paths of interconnection which may not be close to any base station(Ramachandran, 2006).

4.1 Advantage

  • •

    DSDV protocol guarantees loop free paths .

  • •

    Count to infinity is less .

  • •

    Avoid extra traffic with incremental updates instead of full dump updates.

  • •

    DSDV maintains only the best path instead of maintaining multiple paths to every destination. so the space in routing table is reduced.

4.2 Disadvantage

  • •

    Wastage of bandwidth due to periodically hello message even if no change in the network topology .

  • •

    Doesn’t support Multi path Routing.

  • •

    Difficult to find a time delay for the advertisement of routes.

  • •

    It is difficult to maintain the routing table’s advertisement for larger network. which consumes more bandwidth.

Complete Chapter List

Search this Book:
Reset