An efficient and reliable Cooperative Multicast routing based on hop tree in Ad-hoc Networks

Abstract

A mobile ad-hoc network is an infrastructure less self-configuring network of mobile nodes which move their places randomly, move around or join the network. Over the past few years simulation work has been carried out to achieve a new reliable Routing protocol. This paper mainly concentrates on reducing the factors such as End-to- End Delay, Network Load and Packet loss in conventional AODV and DSR routing protocols. We propose a Cooperative Multicast Ad-hoc on-demand distance vector (CMAODV) Routing protocol. The results indicate that AODV loses more packets than CMAODV. In AODV routing protocol, more number of total packet losses is congestion related and sample data reveals that the packet loss distribution over time is bursting, which makes the tradition Poisson framework unsuitable for modeling it. Preliminary results exhibit self-similar pattern that leads us to believe that fractal model is promising to describe packet loss in ad hoc networks.