Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
From Pastry to CrossROAD: CROSS-Layer Ring Overlay for AD Hoc Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
CHR: A Distributed Hash Table for Wireless Ad Hoc Networks
ICDCSW '05 Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05) - Volume 04
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Reducing Latency in Rendezvous-Based Publish-Subscribe Systems for Wireless Ad Hoc Networks
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
XScribe: a stateless, cross-layer approach to P2P multicast in multi-hop ad hoc networks
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Distributed lookup in structured peer-to-peer ad-hoc networks
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Review: Review of multicast routing mechanisms in mobile ad hoc networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
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.