Research Article
Building Multicast Trees in Ad-hoc Networks
@INPROCEEDINGS{10.4108/ICST.AUTONOMICS2008.4648, author={Rapha\`{\i}l Kummer and Peter Kropf and Pascal Felber}, title={Building Multicast Trees in Ad-hoc Networks}, proceedings={8th International ICST Workshop on Middleware for Network Eccentric and Mobile Applications}, publisher={ACM}, proceedings_a={MINEMA}, year={2010}, month={5}, keywords={Mobile Networking Wireless Networks Protocol Ad-hoc Wireless Networks Mobile Ad-hoc Computing Multicast trees}, doi={10.4108/ICST.AUTONOMICS2008.4648} }- Raphaël Kummer
Peter Kropf
Pascal Felber
Year: 2010
Building Multicast Trees in Ad-hoc Networks
MINEMA
ICST
DOI: 10.4108/ICST.AUTONOMICS2008.4648
Abstract
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produce multicast trees requiring many nodes to act as relays even though they are not part of the multicast group. In this paper, we propose an algorithm for building efficient multicast trees that strives to minimize the number of non-member relay nodes and the number of transmissions required to reach all the group members, and to balance the degree of members when acting as internal nodes of the multicast tree. Our algorithm relies upon a lightweight distributed hash table (DHT) to construct and optimize the multicast trees. We evaluate the efficiency and scalability of our algorithm by simulations with various network configurations and sizes.