TY - CHAP
T1 - ADMP
T2 - An adaptive multicast routing protocol for mobile ad hoc networks
AU - Menchaca-Mendez, Rolando
AU - Menchaca-Mendez, Ricardo
AU - Garcia-Luna-Aceves, J. J.
N1 - Funding Information:
Mobile Ad Hoc Networks (or MANETs) are highly dynamic and do not rely on a fixed infrastructure. MANETs are well suited to applications where rapid deployment and dynamic reconfiguration are necessary. Examples of such scenarios are: military battlefield, emergency search and rescue, conference and conventions. The objective of a multicast routing protocol for MANETs is to enable This work was supported in part by the Mexican National Council for Science and Technology (CONACyT), by the Mexican National Polytechnic Institute (IPN), by the National Science Foundation under Grant CNS-0435522, and by the Baskin Chair of Computer Engineering at the University of California, Santa Cruz.
PY - 2006
Y1 - 2006
N2 - We present ADMP, the adaptive mesh-based multicast routing protocol, in which nodes are able to independently tune the amount of redundancy used to transmit data packets with the goal of improving the overall packet delivery ratio while keeping the retransmission overhead as low as possible. ADMP is based on a novel distributed algorithm for computing connected dominating sets. ADMP uses a single type of control packet, called multicast announcement, which is used to build the meshes of multicast groups, elect the core of each mesh and obtain two-hop neighborhood information. Using detailed simulations for different scenarios, we show that ADMP achieves similar or better reliability than two mesh-based multicast protocols that are very resilient (ODMRP and PUMA) while inducing low packet retransmission overhead.
AB - We present ADMP, the adaptive mesh-based multicast routing protocol, in which nodes are able to independently tune the amount of redundancy used to transmit data packets with the goal of improving the overall packet delivery ratio while keeping the retransmission overhead as low as possible. ADMP is based on a novel distributed algorithm for computing connected dominating sets. ADMP uses a single type of control packet, called multicast announcement, which is used to build the meshes of multicast groups, elect the core of each mesh and obtain two-hop neighborhood information. Using detailed simulations for different scenarios, we show that ADMP achieves similar or better reliability than two mesh-based multicast protocols that are very resilient (ODMRP and PUMA) while inducing low packet retransmission overhead.
UR - http://www.scopus.com/inward/record.url?scp=33751419596&partnerID=8YFLogxK
U2 - 10.1007/978-0-387-34738-7_13
DO - 10.1007/978-0-387-34738-7_13
M3 - Capítulo
AN - SCOPUS:33751419596
SN - 038734635X
SN - 9780387346359
T3 - IFIP International Federation for Information Processing
SP - 177
EP - 188
BT - Ad-Hoc Networking
A2 - Al Agha, Khaldoen
ER -