1. 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

2. Outline Introduction WCMP (Weight-based Clustering Multicast Protocol) Simulation Results and Analysis Conclusions

3. 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.

4. Introduction Based idea Construct a multicast delivery tree Select some nodes in the tree to become clusterheads using a weighted algorithm The clusterheads using to reduce the overhead and packet loss Determine the number of clusterheads to avoid throughput degradation due to clusterhead’s control messages

5. WCMP (Weight-based Clustering Multicast Protocol) Multicast tree creation Join_Tree_Request packet Join_Ack message S A C B G F E D Group member Non Group Member Join Tree request Join Ack

6. 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.

7. WCMP (Weight-based Clustering Multicast Protocol) W i, 0  i  n-1 N = {0, 1, 2, …, n-1} NN 2 (i) Deg(i), Deg(i)=1 is called a border node i

8. WCMP (Weight-based Clustering Multicast Protocol) Select a clusterhead according to a weight mechanism 1. The number of border nodes within 2-hop of i, denoted as BN i 2. The number of neighboring nodes for i within 2-hop, i.e., NN 2 (i) 3. Degree of i, i.e., Deg(i) The weight function W i is (0.7  BN i + 0.2  NN 2 (i) + 0.1  Deg(i)), for 0  i  n-1.

9. W A =(0.7  3+0.2  9+0.1  3)=4.2 W B =(0.7  4+0.2  9+0.1  3)=4.9 W i =(0.7  BN i + 0.2  NN 2 (i) + 0.1  Deg(i)) W C =(0.7  2+0.2  7+0.1  3)=3.1 W D =(0.7  3+0.2  6+0.1  3)=3.6 W E =(0.7  2+0.2  6+0.1  2)=2.8

11. WCMP (Weight-based Clustering Multicast Protocol) F G B D H S I K J A L C M E N O CHREQ (S, HP, FG) CHREP (S, HP, FG) CHREQ(S,, TRUE) CHREQ(S,, FALSE) CHREQ(S,, TRUE) CHREQ(S,, FALSE)

12. WCMP (Weight-based Clustering Multicast Protocol) A node joins the multicast tree F G B D H S I K J A L C M E N O JOIN JOIN ACK X

13. WCMP (Weight-based Clustering Multicast Protocol) S I K A LC MXE N O JB HD FG F G B D H S I K J A L C M E N O X

14. S I K A LC MXE N O JB HD FG F G B D H S I K J A L C M E N O X CHREQ CHREP

15. 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 local multicast tree and send JOIN messages to source After that, the multicast tree adjusts the clusterheads if needed.

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

17. Parameters Packet delivery ratio Control message overhead Number of clusterhead

21. Conclusions WCMP outperforms the existing mesh- based multicast routing protocol in mobile ad hoc networks