A Preferred Link Based Multicast Protocol for Wireless Mobile Ad

Transcription

A Preferred Link Based Multicast Protocol for Wireless Mobile Ad
A Preferred Link Based Multicast
Protocol for Wireless Mobile Ad
hoc Networks
R. S. Sisodia, Karthigeyan. I, B. S. Manoj,
and
C. Siva Ram Murthy
ICC 2003
Outline






Introduction
Multicast Tree
Preferred Link Based Algorithm
Tree Maintenance
Performance
Conclusions
Introduction

Existing multicast routing protocols can
be broadly classified into two categories



Tree based protocols
Mesh based protocol
Mesh based protocols have high packet
delivery ratio compared to tree based
protocols


More control overhead
JoinQuery packets
Introduction (cont.)

This paper propose an efficient
protocol

Preferred Link Based Multicast protocol
(PLBM)

Uses a preferred link approach for
forwarding JoinQuery packets


Preferred link based algorithm


Restricts the flooding of JQ packets
Preferred nodes
Locally repairs broken links

The local two hop network topology
Multicast Tree

Tree nodes





Multicast source
Connected member nodes
Forwarding nodes
Neighbors Neighbors Table (NNT)
Connect Table (CT)
Multicast Tree (cont.)
Preferred Link Based Algorithm

The PLBA


Preferred links (nodes)
Utilizes the two hop topology
information

NNT
E
C
B
Preferred node
D
A
Preferred Link Based Algorithm (cont.)

Condition 1

The current forwarding node excludes
all its neighbors that have already
forwarded JQ
D
E
B
C
JQ
A
Preferred Link Based Algorithm (cont.)

Condition 2

The current forwarding node is
prevented from forwarding JQ to those
neighbors that are shared by the nodes
D
B
C
A
Preferred Link Based Algorithm (cont.)

Condition 3

Prevents broadcast to those nodes that
are neighbors of nodes in the traversed
path of JQ
D
B
D
C
A
Preferred Link Based Algorithm (cont.)

Example
Preferred Link Based Algorithm (cont.)

Example
Tree Maintenance
PACKET_AWAIT_TIMER
Performance






GloMoSim
Simulation Area 1000X1000 m
The simulation is run for 600
seconds
Transmission Rage 250m
Nodes 50
PACKET_AWAIT_TIMER 1 sec
Performance (cont.)
Group size 20
Performance (cont.)
Mobility 9 m/s
Conclusions

An efficient receiver-initiated tree
based multicast protocol

Preferred link based approach

Dominating set