a performance analysis of tora, aodv and dsr in manet using ns 2.34

5
Submitted by Mr. G. Pragadeeswaran Guided by Mr. A. Sureshkumar M.E, (PH.D) HOD/ECE Pavendar Bharathidasan College of Engineering and Technology 1

Upload: pragadeeselak

Post on 12-Mar-2015

76 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: A Performance Analysis of TORA, AODV and DSR in MANET Using NS 2.34

Submitted byMr. G. Pragadeeswaran

Guided byMr. A. Sureshkumar M.E, (PH.D)

HOD/ECEPavendar Bharathidasan College of Engineering and

Technology

Submitted byMr. G. Pragadeeswaran

Guided byMr. A. Sureshkumar M.E, (PH.D)

HOD/ECEPavendar Bharathidasan College of Engineering and

Technology

1

Page 2: A Performance Analysis of TORA, AODV and DSR in MANET Using NS 2.34

Introduction. Ad Hoc Network Routing Protocols

• Temporally-Ordered Routing Algorithm (TORA)• Dynamic Source Routing (DSR)• Ad Hoc On-Demand Distance Vector (AODV)

Simulation Environment Methodology Simulation Results Additional Observations Related Work Conclusions

2

Page 3: A Performance Analysis of TORA, AODV and DSR in MANET Using NS 2.34

An MANET (Mobile Ad hoc NETwork) is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration.

Each mobile node acts as a host as well as router.

The idea of ad hoc networking is infrastructureless networking.

The mobile nodes in the network dynamically establish routing among themselves to form their own network “on the fly.”

In this paper we will dicuss, quantitative analysis of the performance of TORA, AODV and DSR routing protocols.

3

Page 4: A Performance Analysis of TORA, AODV and DSR in MANET Using NS 2.34

4

Page 5: A Performance Analysis of TORA, AODV and DSR in MANET Using NS 2.34

Temporally Ordered Routing Algorithm (TORA)

Distributed routing protocol based on a “link reversal” algorithm.

Discover routes on demand

Provide multiple routes to a destination

Establish routes quickly

Minimize communication overhead by localizing algorithmic reaction to topological changes when possible.

5