Routing for Mobile AdHoc Network

CLASS-BE(ETRX)

NAME OF THE GROUP MEMBERS:

TANAY MANDVE KANHAIYALAL SUTAR KEWAL NAGDA MAULIK SHAH

PROJECT GUIDE: SHEETAL JAGTAP MADAM

COMPARING PARAMETERS :AODV v/s DSDV

20 MOBILITY

50 MOBILITY 1m/s 5m/s 10m/s

NO MOBILITY

1m/s 5m/s 10m/s

1m/s 5m/s 10m/s

AODV
Destination-Sequenced DistanceVector

DSDV
Ad hoc on-demand distance vector routing

reactive

proactive

DSDV: Destination Sequence Distance Vector

Expansion of distance vector based on Bellman-Ford

routing mechanism include freedom from loops in routing tables. Every node maintains a routing table in which the information of all possible destinations recorded. The route with the most recent sequence number is always used, when having the same sequence, the route with smaller metric is used. Routing table updates are periodically transmitted or as needed throughout the network in order to maintain consistency. To reduce the routing update overhead, employ two types 4 packets. of CCL
full dump

DSDV

CCL

AODV: Ad-hoc On-Demand Distance Vector Routing

Improved over DSDV algorithm (minimize the number of

required broadcast by creating routes on a demand basis; maintain a complete list of routes as in the DSDV algorithm) Nodes (not on a selected path) dont maintain routing information or participate in routing table exchanges. Instead of source routing, AODV relies on dynamically establishing route table entries at intermediate node. AODV use the concept of destination sequence number from DSDV. AODV only supports the use of symmetric links.

CCL

AODV
Example:

X X
S
7 CCL

Mobile Agent Routing (MAR)

A routing algorithm, which is based on sharing

local information to find paths, is employed. Every node on the network only knows about its neighbors to start with. In a network based on mobile agents, a mobile agent walks from node to node and collects information during its travels. MAR enables the mobile agent not only to leave information on nodes it has visited, but also to read information left by other mobile agents.

Comparison of AODV, DSDV, MAR

AODV AODV is a reactive Protocol i.e. On Demand Driven DSDV MAR DSDV is a proactive MAR is hybrid. Protocol i.e. Pre Based on technique called computed or Table Driven rumor routing.

It is derived from DSDV, jointly developed by Nokia Research Centre.

It is based on the Bellman It is still under research. Ford Algorithm.

.nam file

.trace file (20 nodes)

Work to be done:
Comparison of protocols by changing various

parameters like speed, mobility, packet rate etc. Final results obtained after comparisons on NS-2 Plotting it on graph

References
Papers: Y. Zhou and A. N. Zincir-Heywood (Dalhousie University),

INTELLIGENT AGENTS FOR MOBILE AD HOC NETWORKS. Pavlos Papageorgiou Literature Survey on Wireless Sensor Networks(July 2003).
Mobile Ad Hoc Networking - John Wiley & Sons- IEEE press.
Dr.D.Sivakumar, A Survey of Routing Algorithms for MANET

IEEE-International Conference On Advances In Engineering, Science And Management (March 30, 31, 2012).

13

THANK YOU