By Topic

K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yamin Li ; Dept. of Comput. Sci., Hosei Univ., Tokyo ; Peng, S. ; Wanming Chu

Overlay multicast protocols construct a virtual mesh spanning all member nodes of a multicast group. It employs standard unicast routing and forwarding to fulfill multicast functionality. The advantages of this approach are robustness and low overhead. However, efficiency and stability are the issues that must be addressed in the mobile ad hoc network (MANET) environment. In this paper, we propose an effective structure for overlay multicast to solve these problems in MANET. Instead of using a spanning tree on the virtual mesh, we introduce a simple structure called k- tree trunk for multicast. A k-tree trunk of a tree is a subtree with k leaves that minimizes the sum of the distances of all vertices to the subtree plus the size of the subtree. The k-tree trunk is more stable and easier to maintain than the spanning tree in MANET. The simulation results show that our approach handles the flexibility and mobility issues in an overlay multicast protocol effectively, especially when the group size is large.

Published in:

Parallel Architectures, Algorithms, and Networks, 2008. I-SPAN 2008. International Symposium on

Date of Conference:

7-9 May 2008