TY - JOUR
T1 - Hydra
T2 - Efficient multicast routing in MANETs using sender-initiated multicast meshes
AU - Menchaca-Mendez, Rolando
AU - Garcia-Luna-Aceves, J. J.
N1 - Funding Information:
Work was partially sponsored by the U.S. Army Research Office (ARO) under grant W911NF-05-1-0246, by the National Science Foundation under grant CNS-0435522, by the Baskin Chair of Computer Engineering, by the UC MEXUS-CONACyT program and by the Mexican National Polytechnic Institute.
PY - 2010/2
Y1 - 2010/2
N2 - 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.
AB - 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.
KW - Ad hoc networks
KW - Mesh-based routing
KW - Multicast routing
KW - Multicast state aggregation
KW - Scalability
UR - http://www.scopus.com/inward/record.url?scp=74849085461&partnerID=8YFLogxK
U2 - 10.1016/j.pmcj.2009.07.010
DO - 10.1016/j.pmcj.2009.07.010
M3 - Artículo
SN - 1574-1192
VL - 6
SP - 144
EP - 157
JO - Pervasive and Mobile Computing
JF - Pervasive and Mobile Computing
IS - 1
ER -