A Neighbor Coverage based Probabilistic Rebroadcast

for Reducing Routing Overhead in Mobile Ad hoc

Networks

Objective:

To avoid network congestion

increase the QoS by reducing the
overhead

Requirements:

Hardware:
Single PC
20 Gb Hard disc space
1Gb RAM

Software:
Linux OS (Ubuntu 10.04)
NS2.34
C++ environment

MANET:
A mobile ad hoc network (MANET), sometimes called a
mobile mesh network, is a self-configuring network of
mobile devices connected by wireless links

Types of MANET:

Vehicular Ad Hoc Networks (VANETs) are used for

communication among vehicles and between vehicles and roadside
equipment.
Intelligent vehicular ad hoc networks (InVANETs) are a kind of
artificial intelligence that helps vehicles to behave in intelligent
manners during vehicle-to-vehicle collisions, accidents, drunken
driving etc.
Internet Based Mobile Ad hoc Networks (iMANET) are ad hoc
networks that link mobile nodes and fixed Internet-gateway nodes. In
such type of networks normal ad hoc routing algorithms don't apply
directly.

Existing system:

One of the fundamental challenges of MANETs is the design of

dynamic routing protocols with good performance and less
overhead.
The conventional on-demand routing protocols use flooding to
discover a route
They broadcast a Route RREQ packet to the networks, and the
broadcasting induces excessive redundant retransmissions of
RREQ packet and causes the broadcast storm problem.

Routing Protocols:

Proactive protocols

Reactive protocols

Hybrid protocols

Route Requests (RREQ)

When a node re-broadcasts a Route Request, it sets up a reverse path

pointing towards the source
AODV assumes symmetric (bi-directional) links
When the intended destination receives a Route Request, it replies by
sending a Route Reply (RREP)
Route Reply travels along the reverse path set-up when Route Request
is forwarded

Route Requests in AODV

Y

S
B
A

C
G

Broadcast
transmission

S
B

Represents a node that has

received RREQ for D from S

H
I

D
N

Represents transmission of RREQ

Route Requests in AODV

Y
Z

S
B
A

Represents links on
Reverse Path

Y
Z
S

B
A

E
F

Node C receives RREQ from

G and H, but does not forward
it again, because node C has
already forwarded RREQ once

Reverse Path Setup in AODV

Y
Z

S
B
A

C
G

Node D does not forward RREQ,

because node D
is the intended target of the RREQ

Forward Path Setup in AODV

Y
S
B
A

Forward links are setup when

RREP travels along
the reverse path

Z
E

H
I

D
N

Represents a link on the

forward path

Disadvantages:

They broadcast a Route Request packet, which leads to a

considerable number of packet collisions, especially in dense
networks.
Due to node mobility in MANETs, frequent link breakages
may lead to frequent path failures and route discoveries,
which could increase the overhead of routing protocols and
reduce the packet delivery ratio and increasing the end-to-end
delay.
This scheme only considers the coverage ratio by the previous
node, and it does not consider the neighbors receiving the
duplicate RREQ packet.

Proposed system:

We propose a novel rebroadcast delay to determine the

rebroadcast order, and then we can obtain the more accurate
additional coverage ratio by sensing neighbor coverage
knowledge.
Our approach combines the advantages of the neighbor
coverage knowledge and the probabilistic mechanism, which
can significantly decrease the number of retransmissions so as
to reduce the routing overhead, and can also improve the
routing performance.

Block diagram:

Link Status

Delay Unit

Node Status/Network
monitor

Network manager

Modules:

Route discovery by RREQ

Failure detection by Err

Calculating rebroadcasting delay

Route recovery by RREQ and RREP

Model Output:

Nam window
Xgraph

NAM(Network Animator)

X-graph

CONCLUSSION:

THANKYOU

QUERIES