TY - GEN
T1 - DPUMA
T2 - 4th International Conference on Ad-Hoc, Mobile, and Wireless Networks, ADHOC-NOW 2005
AU - Menchaca-Mendez, Rolando
AU - Vaishampayan, Ravindra
AU - Garcia-Luna-Aceves, J. J.
AU - Obraczka, Katia
PY - 2005
Y1 - 2005
N2 - In this paper we present DPUMA, a mesh-based multicast routing protocol specifically designed to reduce the overhead needed to deliver multicast packets, saving bandwidth and energy, two of the scarcest resources in MANETS. The two main features of DPUMA are: (1) for each multicast group, it periodically floods a single control packet to build the mesh, elect the core of the mesh and get two-hop neighborhood information; and (2), it computes the mesh's k-dominating set to further reduce overhead induced by flooding the mesh when forwarding data packets. These two characteristics contrast with other protocols that blindly flood the net in different stages to construct their routing structure (mesh or tree), to elect the leader of the structure, and that exchange hello messages to get neighborhood information. Using detailed simulations, we show over different scenarios that our protocol achieves similar or better reliability while inducing less packet transmission overhead than ODMRP, MAODV and PUMA which is DPUMA's predecessor.
AB - In this paper we present DPUMA, a mesh-based multicast routing protocol specifically designed to reduce the overhead needed to deliver multicast packets, saving bandwidth and energy, two of the scarcest resources in MANETS. The two main features of DPUMA are: (1) for each multicast group, it periodically floods a single control packet to build the mesh, elect the core of the mesh and get two-hop neighborhood information; and (2), it computes the mesh's k-dominating set to further reduce overhead induced by flooding the mesh when forwarding data packets. These two characteristics contrast with other protocols that blindly flood the net in different stages to construct their routing structure (mesh or tree), to elect the leader of the structure, and that exchange hello messages to get neighborhood information. Using detailed simulations, we show over different scenarios that our protocol achieves similar or better reliability while inducing less packet transmission overhead than ODMRP, MAODV and PUMA which is DPUMA's predecessor.
UR - http://www.scopus.com/inward/record.url?scp=33745301670&partnerID=8YFLogxK
U2 - 10.1007/11561354_16
DO - 10.1007/11561354_16
M3 - Contribución a la conferencia
SN - 3540291326
SN - 9783540291329
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 178
EP - 191
BT - Ad-Hoc, Mobile, and Wireless Networks - 4th International Conference, ADHOC-NOW 2005, Proceedings
Y2 - 6 October 2005 through 8 October 2005
ER -