By Topic

A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in 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
$33 $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 ; Hosei Univ., Tokyo ; Shietung Peng ; Wanming Chu

Overlay multicast protocol constructs a virtual mesh spanning all member nodes of a multicast group and employs standard unicast routing to fulfill multicast functionality on application layer. The advantages of this approach are simplicity and flexibility. However, efficiency and stability are the issues that must be addressed as the size of the multicast group grows in the mobile ad hoc networks (MANETs). In this paper, we propose tree trunk for overlay multicast to solve these problems in MANETs. A tree trunk is a path that minimizes the sum of the distances of all vertices to the path plus the length of the path. We give an efficient distributed algorithm for finding a tree trunk in a tree network. We also perform some empirical analysis based on the tree trunk and compare the results with those using spanning tree.

Published in:

22nd International Conference on Advanced Information Networking and Applications (aina 2008)

Date of Conference:

25-28 March 2008