Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A dynamic core based multicast routing protocol for ad hoc wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Neighbor supporting ad hoc multicast routing protocol
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Aggregated Multicast—A Comparative Study
Cluster Computing
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
IEEE Transactions on Mobile Computing
The core-assisted mesh protocol
IEEE Journal on Selected Areas in Communications
Computers & Mathematics with Applications
Hi-index | 0.00 |
We present Hydra, the first multicast routing protocol for MANETs that establishes a multicast routing structure approximating the set of source-rooted shortest-path trees from multicast sources to receivers, without requiring the dissemination of control packets from each source of a multicast group. Hydra accomplishes this by dynamically electing a core for the mesh of a multicast group among the sources of the group, and aggregating multicast routing state in the nodes participating in multicast meshes, so that only control packets from the core are disseminated towards the receivers of a group. We prove that Hydra establishes correct routes from senders to receivers of a multicast group when multicast state information is aggregated. We also present simulation results illustrating that Hydra attains comparable or higher delivery ratios than the On-Demand Multicast Routing Protocol (ODMRP), but with considerably lower end-to-end delays and far less communication overhead. Results are shown for scenarios using 802.11 DCF and TDMA as the MAC layer protocols and using random waypoint and group mobility as mobility models.