IMPLEMENTATION AND SIMULATION OF

ADHOC ON DEMAND DISTANCE VECTOR

(AODV) ROUTING PROTOCOL FOR MOBILE
ADHOC NETWORKING (MANET)
 AIM
• To Simulate a wireless network using AODV
protocol and to evaluate the performance of
network using NS-2(Network Simulator).
MOTIVATION
 INFRASTRUCTURED NETWORK
• When a node S wishes to communicate with a node D, the former notifies the
base station, which eventually establishes the communication with the destination
node.
• All that matters is that both nodes source and destination are within the
transmission range of the base station. If one of them fails to fulfill this condition,
the communication will abort.

Contd..)
• Question: what happens if the base station is
unavailable? Or what happens if we are in a situation
where such an infrastructure did not exist at the first
place?

• Answer: We simply Fail to Communicate!

 This problem motivated us for selecting

Infrastructureless networking as the subject.

Contd..)
 Second Approach
ADHOC
• Does not rely on any stationary infrastructure
• No Base Station.
• Nodes consequentially forward data packets
from one to another until a destination node
is finally reached.

Contd..)
 Simple 3-node ad-hoc network
• source node S wants to communicate with a destination node
D. S and D are not within transmission range of each other.
Therefore, they both use the relay node R to forward packets
from one to another. So, even though R is primarily a host, R
is acting as a router at the same time.
LITERATURE SURVEY
 Mobile Ad Hoc Networks

• A collection of wireless mobile hosts forming a temporary network

without the aid of any established infrastructure.

• Significant Features:
• Dynamic topology of interconnections
• No administrator
• Short transmission range- routes between nodes has one or
more hops
• Nodes act as routers or depend on others for routing
• movement of nodes invalidates topology information
 CLASSIFICATION OF ROUTING
PROTOCOLS

Routing protocols

Proactive Reactive Hybrid

DSDV WRP AODV DSR LMR ABR LAR ZRP CBRP

CGSR TORA SSA

10
 AODV Overview
• AODV is a packet routing protocol designed for use in mobile
ad hoc networks (MANET)

• Intended for networks that may contain thousands of nodes

• One of a class of demand-driven protocols

• Source, destination and next hop are addressed using IP

addressing

• Each node maintains a routing table that contains information

about reaching destination nodes.
– Each entry is keyed to a destination node.
Control messages

• Routing request

• Routing reply

• Route error

• HELLO messages
 RREQ Message
A
B
?
B
B
? B ?
?
B
? B B
? ?
A RREQ message is broadcasted when a node B
needs to discover a route to a destination.
 RREP Message
A
A

A
When a RREQ reaches a destination node, the B
destination route is made available by
unicasting a RREP back to the source route.
• RERR Messages
– This message is broadcast for broken links

• Hello Messages
– Hello Message = RREP with TTL = 1
– This message is used for broadcasting connectivity
information.
– A node should use Hello messages only if it is part
of an active route.
 BLOCK DIAGRAM
SIMULATION
NETWORK RESULTS
TRACE
SIMULATOR 2 (FILES IN
OTCL SCRIPT GRAPH
WIRELESS
OTCL NETWORK
1.NETWORK SCRIPT FORMAT
TOPOLOGY
C++
2.SIMULATION LIBRARIES
SIMULATION
SCENARIO RESULTS NAM
-NAM TRACR
COMPONENTS/HARDWARE
REQUIREMENTS

• Linux Fedora Operating System.

• Network Simulator NS - 2.
 Network Simulator-2
• Network Simulator version 2 (NS-2) is a free and open
source discrete event network simulator.
• NS-2 is based on an object oriented simulator written
in C++ and a OTcl interpreter
• The OTcl script, which is provided by the user at the
simulation time, is used to define and to configure the
network topology and network elements and to
schedule the events.
• Two other independent and optional tools are provided
with NS packages: Network animator (Nam) and
xgraph.
SIMULATION PARAMETERS

• No. of Nodes
• Packet Size
• Traffic Type
• Simulation time
• Delivery Ratio
 FLOWCHART
INITIALIZE NETWORK PARAMETERS

INITIALIZE GLOBAL VARIABLES

SET UP NETWORK TOPOLOGY

CREATE GOD
SPECIFY NO. OF SET BAND
MOBILE NODES WIDTH

CONFIGURE NODE

SET UP TRAFFIC FLOW BETWEEN NODES

SIMULATE END
 MERITS
• No central Infrastructure
• Reduce messages overhead
• reacts relatively fast
• updates only the affected nodes
• saves storage place as well as energy.
• The destination node replies only once to
the first request and ignores the rest.
• If routing table entry is not used recently,
the entry is expired.
 DEMERITS
• Intermediate nodes can lead to inconsistent routes
( if the source sequence number is very old and the
intermediate nodes have a higher but not the latest
destination sequence number, thereby having stale
entries).
• Heavy control overhead.
• Periodic beaconing which leads to unnecessary
bandwidth consumption
APPLICATIONS
 Applications
• Useful where geographical or terrestrial constraints
demand totally distributed network without fixed
base stations.
• Military Battlefields.
• Disaster and Rescue Operations.
• Conferences.
• Peer to Peer Networks.
• Armed forces operations
• Emergency services
• Game parties
• Home networking
MULTI HOP WIRELESS NETWORKS
INTER VEHICULAR
COMMUNICATION
AIRCRAFT COMMUNICATION
Thank you!