Efficient Multicast Routing in MANETs Using Prefix Labels

Abstract

Abstract-We introduce Prefix-based Multicast Routing (PMR), the first approach to multicast routing in MANETs in which the network-wide dissemination of control information is independent of the number of groups and sources per group. PMR establishes a labeled directed acyclic graph (LDAG) rooted at an elected node in the MANET and assigns a prefix label to each node denoting its network location relative to the root of the LDAG. Routes between any two prefix labels are implicit in the labels themselves. The sources and receivers of a multicast group use a consistent hashing function to map the identifier of the group (e.g., an IP multicast address) onto the group-prefix-label. The node whose prefix label is the closest match to the groupprefix-label serves as the core of the group. As in prior receiverinitiated multicast approaches, receivers join a multicast group by sending join requests towards the group core, and multicast sources simply forward their multicast data packets towards the cores of the groups. We use simulation experiments to compare PMR with ODMRP and MAODV for different mobility scenarios with varying number of nodes, groups and receivers. The results clearly show that PMR is far more efficient than traditional multicast routing approaches, even in relatively small networks.

MRBL: An Efficient Multicast Routing Protocol with Backup Labeling in MANETs

“…As mentioned, in multicast routing protocols for MANETs, ODMRP [1] is mesh-based while POEM [7] is tree-based. As ODMRP lets source nodes broadcast control packets periodically to maintain the groups, the required control packets will increase when the receivers increase, i.e., when nodes multiply, control and data packets multiply too.…”

“…There are a number of multicast routing protocols introduced in recent years, e.g., [1][2][3][4][5][6][7]. In [5], AMRIS uses a shared tree to manage the multicast groups and transmit data, and gives each node a unique ID number for identification when the link changes.…”

An Efficient Multicast Routing Protocol in MANETs

“…Tree-based routing which takes less control packets (but is less tolerant for invalid paths) may turn out a better routing choice for super busy MANETs if we can build and maintain paths at less cost than repairing paths. In existing multicast routing protocols [1][2][3][4][5], mesh-based ODMRP [1] lets sources broadcast control packets periodically to maintain groups: The needed control packets will grow when receivers grow, affecting the bandwidth of data transmission while lowering delivery ratios. Tree-based POEM [5] uses labels to mark nodes (assigning each node a unique label) when building the topology and will drop packets if nodes change locations or paths turn invalid.…”

“…In existing multicast routing protocols [1][2][3][4][5], mesh-based ODMRP [1] lets sources broadcast control packets periodically to maintain groups: The needed control packets will grow when receivers grow, affecting the bandwidth of data transmission while lowering delivery ratios. Tree-based POEM [5] uses labels to mark nodes (assigning each node a unique label) when building the topology and will drop packets if nodes change locations or paths turn invalid. We introduce a new tree-based multicast routing protocol using a more advanced label mechanism to maintain the topology and groups, and to build backup paths which can secure higher stability than other tree-based protocols.…”

Optimizing Network Topology to Reduce Aggregate Traffic in Systems of Mobile Agents

“…In [10], all nodes are considered identical, and prefix labelling and routing techniques (cf. [11]- [13]) are used to assign labels and routes.…”