1 / 13

Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks

Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks. B.H. Liu, M.J. Tsai, and W.C. Ko Department of Computer Science National Tsing Hua University Hsing Chu, Taiwan, ROC Speaker : Bing-Hong Liu. Agenda. Introduction The Heuristic Simulation

kato
Download Presentation

Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks B.H. Liu, M.J. Tsai, and W.C. Ko Department of Computer Science National Tsing Hua University Hsing Chu, Taiwan, ROC Speaker : Bing-Hong Liu

  2. Agenda • Introduction • The Heuristic • Simulation • Conclusion

  3. core core Introduction(1/2) • Core-based group-shared tree • Shared by group members and rooted at core node • Core distributes the packets to and from all group members Local broadcast operation Traditional Find a minimum non-leaf multicast tree

  4. Introduction(2/2) • Minimum non-leaf multicast tree Problem • No polynomial time approximation scheme unless P=NP • A distributed heuristic is needed

  5. A Reduction A reduction on one node reforms tree structure between this node and its all neighbors

  6. Which node does the reduction? It leads us to define the profit of each tree node

  7. Profit Value • Node’s profit can be simply defined • If the number of its neighbors is smaller than or equal to 2 • Set to 0 • Otherwise • Set to the number of its neighbors - 2 • The node with larger profit value (> 0) in its neighborhood can do the reduction

  8. Distributed Reduction Method(1/2) A cycle is constituted This problem is solved by the election model

  9. Distributed Reduction Method(2/2) • Election model • Each tree node elects a candidate with largest profit in its neighborhood • A node can do the reduction when it is the candidate of each of itself and all neighbors

  10. Simulation(1/2) • Environment • Network topology is generated by geometrically distributed network model [1] • Group members are randomly selected from all nodes in the network • Cost • The number of non-leaves in the multicast tree • Comparison • Graph-center tree (GCT), multicast-center tree (MCT), and random-member tree (RMT) • RMT applied with our reduction method (RRMT)

  11. Simulation(2/2) X axis: The number of group members Y axis: The average ratio of the cost of other multicast tree to that of RRMT

  12. Conclusion • A heuristic is to reduce the cost of the multicast tree when the local broadcast operation is used • RMT applied with our heuristic gets better performance than original one

  13. Reference • [1] S.K.S. Gupta and P.K. Srimani, “Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 1, 2003, pp.27–38.

More Related