Weight-Based Clustering Multicast Routing Protocol for Mobile Ad Hoc Networks

Chun-Chieh Huang, Ruay-shiung Chang and Ming-Huang Guo

National Dong-Hwa University, Hualien, Taiwan R.O.C and Shih-Hsiu University, Taipei, Taiwan, R.O.C

WCNC 2003

Outline Introduction WCMP (Weight-based Clustering

Multicast Protocol) Simulation Results and Analysis Conclusions

Introduction Multicast protocols existed for wireless ad

hoc networks Tree-based Mesh-based

The goal of this work is to improve multicasting performance in ad hoc networks by efficient use of the available knowledge of the networks.

Introduction Based idea

Construct a multicast delivery tree Select some nodes in the tree to become clust

erheads using a weighted algorithm The clusterheads using to reduce the overhea

d and packet loss Determine the number of clusterheads to avoi

d throughput degradation due to clusterhead’s control messages

WCMP (Weight-based Clustering Multicast Protocol) Multicast tree creation

Join_Tree_Request packet Join_Ack message

S

A C

B

GF

ED

Group memberNon Group Member

Join Tree requestJoin Ack

WCMP (Weight-based Clustering Multicast Protocol) Before describing the method, two

assumptions Each node correctly receives and transmits

the message in a limited time. A node moves into or moves out someone’s

transmission range, it can detect the new connection or delete the old connection in a limited time.

WCMP (Weight-based Clustering Multicast Protocol) Wi, 0 i n-1

N = {0, 1, 2, …, n-1} NN2(i)

Deg(i), Deg(i)=1 is called a border node

i

WCMP (Weight-based Clustering Multicast Protocol) Select a clusterhead according to a weight mech

anism1. The number of border nodes within 2-hop of i, denot

ed as BNi

2. The number of neighboring nodes for i within 2-hop, i.e., NN2(i)

3. Degree of i, i.e., Deg(i)

The weight function Wi is (0.7BNi + 0.2NN2

(i) + 0.1 Deg(i)), for 0in-1.

WA=(0.73+0.29+0.13)=4.2WB=(0.74+0.29+0.13)=4.9

Wi =(0.7BNi + 0.2NN2(i) + 0.1 Deg(i))

WC=(0.72+0.27+0.13)=3.1WD=(0.73+0.26+0.13)=3.6

WE=(0.72+0.26+0.12)=2.8

WCMP (Weight-based Clustering Multicast Protocol)

F G

B

D

H

SI

K

J

A

L

C

M

E NO

CHREQ (S, HP, FG)

CHREP (S, HP, FG)

CHREQ(S, <S, B>, TRUE)

CHREQ(S, <S, A>, FALSE)

CHREQ(S, <S, A, C, E>, TRUE)

CHREQ(S, <S, A, C>, FALSE)

WCMP (Weight-based Clustering Multicast Protocol) A node joins the multicast tree

F G

B

D

H

SI

K

J

A

L

C

M

E NO

JOIN

JOIN ACK

X

WCMP (Weight-based Clustering Multicast Protocol)

S

I

K

A

L C

MX E

N

O

J B

H D

F G

FG

B

D

H

SI

K

J

A

L

C

M

E N

O

X

WCMP (Weight-based Clustering Multicast Protocol)

S

I

K

A

L C

MX E

N

O

J B

H D

F G

FG

B

D

H

SI

K

J

A

L

C

M

E N

O

X

CHREQ

CHREP

WCMP (Weight-based Clustering Multicast Protocol) A node leaves the multicast tree

The neighbor nodes only update the Neighbor Table and the clusterhead updates its cluster information

If a clusterhead leaves the multicast tree Its downstream nodes will search for an adjacent loca

l multicast tree and send JOIN messages to source After that, the multicast tree adjusts the clusterheads i

f needed.

Simulation results and analysis Global mobile simulation (GloMoSim) 50 mobile nodes 1000m by 1000m One multicast group and the source node is

randomly chosen

Parameters Packet delivery ratio Control message overhead Number of clusterhead

Conclusions WCMP outperforms the existing mesh-

based multicast routing protocol in mobile ad hoc networks