ACM Home Page
Please provide us with feedback. Feedback
Building multicast trees in ad-hoc networks
Full text PdfPdf (217 KB)
Source International Conference on Autonomic Computing and Communication Systems archive
Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems table of contents
Turin, Italy
Article No. 26  
Year of Publication: 2008
ISBN:978-963-9799-34-9
Authors
Raphaël Kummer  University of Neuchâtel, Emile-Argand, Neuchâtel, Switzerland
Peter Kropf  University of Neuchâtel, Emile-Argand, Neuchâtel, Switzerland
Pascal Felber  University of Neuchâtel, Emile-Argand, Neuchâtel, Switzerland
Sponsors
: ICST
ACM: Association for Computing Machinery
: Create-Net
Publisher
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 39,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
V. Devarapalli and D. Sidhu. MZR: a multicast protocol for mobile ad hoc networks. volume 3, pages 886--891, 2001.
 
5
Z. Haas. A new routing protocol for the reconfigurable wireless networks. In IEEE 6th International Conference on Universal Personal Communications Record, volume 2, pages 562--566, San Diego, CA, USA, 1997.
 
6
 
7
R. Kummer, P. Kropf, and P. Felber. Distributed lookup in structured peer-to-peer ad-hoc networks. In R. Meersman and Z. Tari, editors, On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE, volume 4276 of Lecture Notes in Computer Science, pages 1541--1554. Springer Berlin / Heidelberg, 2006.
8
 
9
C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. MILCOM '97, 1997.
 
10
 
11
12

Collaborative Colleagues:
Raphaël Kummer: colleagues
Peter Kropf: colleagues
Pascal Felber: colleagues