Efficient Tree Based Multicast Routing Algorithm for Manet

Abstract

Aim: newlineTo minimize the number of redundant rebroadcasting of packets during the searching process, route discovery process of MAODV was modified that is known as Expanding Ring Search (ERS) which results in reduced broadcast overhead in wireless networks. In this technique, RREQ packet is broadcasted with specific value of TTL parameter. When 1-hop nodes will receive the packet, TTL value will be decremented by 1 and rebroadcast the RREQ packet. This will continue till TTL value is positive. It has been observed that the performance of such ERS scheme depends largely on the search set and the concern TTL set-values to search for the destination nodes. newlineMaterials and Methods: Network Simulator NS-2 newlineResults and Discussion: newline Modify the Expanding Ring Search algorithm used for route discovery process in multicast routing in MANET newline Twofold result analysis to compare performance of OERS and MAODV for Packet Delivery Ratio, Throughput and End to End Delay for different number of receiver nodes by varying TTL_Increment value newline Analyze the effect of node speed on performance of OERS and MAODV protocol for Packet Delivery Ratio, Throughput, End to End Delay and Normalized Routing Load for different number of receiver nodes in multicast group newlineConclusion(s): Based on results of PDR, Throughput, E2E Delay and NRL performance metrics, it can be concluded that proposed OERS is more efficient than the existing multicast MAODV protocol. newline