A Novel Topological Multicast Routing Algorithm (ToMuRo)

Abstract

This paper presents a performance analysis of an enhanced version of the Topological Multicast Routing Algorithm (ToMuRo) on mobile wireless ad‐hoc networks, which includes undecided border nodes. Employing undecided border nodes to forward multicast packets represents a significant enhancement because it optimizes the path discovery process by selecting undecided nodes that can function as multicast relay nodes. Flooding Mechanism and On‐Demand Multicast Routing Protocol (ODMRP) are simulated and compared with both the basic and enhanced versions of the Topological Multicast Routing algorithm. The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers with various mobility patterns and transmission ranges. The behavior of 250 nodes is evaluated in terms of End to End Delay (EED), jitter, packet delivery ratio, and overhead. Results reveal that the enhanced version of ToMuRo performs better in terms of packet delivery ratio and jitter, while ODMRP performs better with respect to EED and Overhead.