MULTICASTING OVER MANETS

MANET

A mobile ad hoc network is a autonomous system

connected by wireless links.

It doesnt have infrastructure.

Network topology may dynamically change.

Nodes are free to move.

 MULTICASTING
Multicasting is the process by which data is set to multiple
recipients.
Usually multicast is receiver driven a receiver becomes a
multicast group member and receives multicast data; but it
could also be source driven.
An extreme example of multicast is global broadcast wherein
data is relayed to all users in the network.
Two popular methods: Source based, Core based.
A multicast group does not necessarily have a single source
group communications
 Types of Multicast Routing
Reactive routing
MAODV
Proactive routing
DSDV
Hybrid routing
Zone Routing Protocol (ZRP)
 Multicast Ad-hoc on demand
distance vector

Pure on-demand protocol

Node does not need to maintain knowledge of another
node unless it communicates with it
AODV includes route discovery and route maintenance.
AODV minimizes the number of broadcasts by creating
routes on-demand
AODV uses only symmetric links because the route reply packet
follows the reverse path of route request packet
AODV uses hello messages to know its neighbors and
to ensure symmetric links
In the path discovery (RREQ)
phase, source broadcasts RREQ
message.

Intermediate nodes record in their

route tables the address of neighbor
from which RREQ is received to
establish a reverse path.

When RREQ reaches destination or

an intermediate node responds by
uni casting a route reply (RREP)
back to neighbor.
 Destination sequenced distance vector
protocol
Basic Routing Protocol .

Each node maintains a list of all destinations and

number of hops to each destination.

Each entry is marked with a sequence number.

Periodically send table to all neighbors to maintain

topology
 WORKING OF DSDV
When X receives information from Y about a route to Z
Let destination sequence number for Z at X be S(X), S(Y)
is sent from Y .
If S(X) > S(Y), then X ignores the routing information
received from Y .
If S(X) = S(Y), and cost of going through Y is smaller than the
route known to X, then X sets Y as the next hop to Z If S(X)
< S(Y), then X sets Y as the next hop to Z, and S(X) is updated
to equal S(Y) .
X Y Z
 The Zone Routing Protocol (ZRP)

Combines both reactive and proactive schemes.

Finds loop free routes to the destination.

Flat structure
Each node, individually creates its own neighborhood which
it calls a routing zone.

The zone is defined as a collection of nodes whose minimum

.
distance (in hops) from the node in question is no greater than a
value that is called the zone radius.

Peripheral nodes are those nodes whose minimum distance

from the node in question is equal to the zone radius.
 Applications for multicast over MANETS
Military application.
Online gaming.