Problem Statement

Enhanced AODV Routing Protocol with Reduced

Overhead and Delay

Chandra Kumar R USN: 1PE13CS046

Satyanarayana C USN: 1PE13CS134
Sunil Kumar T R USN: 1PE13CS163
Nisha Girish Kaushik USN: 1PE14CS417

PESIT-Bangalore South Campus

Guided by Mr. Hanumanth Pujar
Batch 24

13/04/2017

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Problem Statement

To enhance the performance of Ad-hoc On-demand Distance

Vector (AODV) protocol by minimizing overhead created by
control messages.
To compare the performance metrics of original AODV and
improved algorithm.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:Packet format

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:Location packet format

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:Routing table

Routing table is maintained by every node.

Location of the nodes is added into the table.
Timestamp to note the time of change in routing table entry.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:calculation

The perpendicular distance of the node from the line joining

source and destination is given as
w = 1/(2*T*D)
where,
T is the Transmission range of the mobile nodes
D is the Density of the nodes in the network i.e ratio of
number of nodes and area of the network

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:calculation(cont’d)

The perpendicular distance of node P(px,py) and line joining

source S(sx,sy) and D(dx,dy) is calculated as

distance = abs((dy-sy)*px - (dx-sx)*py + (dx-sy) - (dy-sx))/

sqrt((dy-sy)*(dy-sy) + (dx-sx)*(dx-sx))

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:Get Location information

create a MobileNode object(obj).

node::get-node-by-address(node-address) function gives the
location information of the node.
obj->X() gives x value.
obj->Y() gives y value.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:SendRequest

The source checks its routing table to a find the location of

destination.
If found, it creates a RREQ message adding location of source
and destination.
The threshold of the perpendicular distance is also added to
the message packet.
else, it sends a location information packet (LOCREQ).
The message is broadcasted to the neighboring nodes.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:Recv

Called whenever a node receives a packet.

Based on the packet type particular function is invoked.
LAODVTYPE-RREQ
LAODVTYPE-RREP
LAODVTYPE-HELLO
LAODVTYPE-LOC-REQ
LAODVTYPE-LOC-REP

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:RecieveRequest

If intermediate node receives the packets, updates the table

and forwards the packet based on W.
If destination receives the packet, Generate a route reply
message.
and forwards it to the neighbor node based on next hop value
in the routing table.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:RecieveReply

If intermediate node receives the packet, Forward it to the

neighbor node based on next hop value in the routing table.
If source receives the packet, then route is established. Data
packets are sent.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:Hello Messages

Location information is added to the hello messages.

Sends periodically.
Each node sends its location to neighboring nodes.
Nodes that receive this packet, update their routing table.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:LocationRequest

source sends the location request packet if there is no location

of destination found in the routing table.
If Intermediate node receives the packet, it checks if
destination location is available, if not then forwards it.
Destination node sends its location by creating a location
reply packet.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Implementation:LocationReply

Destination adds its location information and sends it to the

neighboring node.
Intermediate nodes forward it based on next hop value.
source node updates the table and begin route search process.

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Diagram

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Diagram

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Diagram

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Performance metrics

Packet delivery ratio

Routing overhead
End to end delay

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Simulation Environment

Simulation time : 900 secs

Node speed : 10
Number of nodes : 20, 40, 60, 80, 100
Transmission range : 250m

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Results: Packet Delivery Ratio

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Results: Routing OverHead TCP

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Results: Routing OverHead UDP

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Results: End to End delay

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Output

Direct path between node 0 and node 5

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Output(cont’d)

path through intermediate node 6

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol

 Problem Statement

Bibliography

M. Ayash, M. Mikki and K. Yim, "Improved AODV Routing

Protocol to Cope with High Overhead in High Mobility
MANETs,"Innovative Mobile and Internet Services in
Ubiquitous Computing (IMIS), 2012 Sixth International
Conference on, Palermo, 2012, pp. 244-251. doi:
10.1109/IMIS.2012.44
www.isi.edu
ns2 manual

Chandra R, Satyanarayana C, Sunil TR, Nisha K Enhanced AODV protocol