Building multicast trees in ad-hoc networks

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. Categories and Subject Descriptors C.2.2 [Computer - Communication Networks]: Network Protocols General Terms Multicast Trees, MANETs Keywords Mobile Networking, Wireles...

• Type: Conference
• Year: 2008
• Where: AUTONOMICS
• Authors: Raphaël Kummer, Peter G. Kropf, Pascal Felber
• Keywords: AUTONOMICS 2008, Communications, Efficient Multicast Trees, Multicast Trees, Terms Multicast Trees