A Probability Based Multicast Routing Protocol With Energy Constrained For Manet

Recently, the study of multicast routing attracts more attentions in MANET. Multicast Ad Hoc On-Demand Distance Vector (MAODV) protocol, which is multicast operation of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, enables dynamic, self-starting, multihop routing between participating mobile nodes wishing to join or participate in a multicast group within an Ad Hoc network. Through analyzing its operation mechanism, we present a probability based multicast routing protocol with energy constrained (PBMR), in which a hybrid probability forwarding strategy is adopted. When a node wants to join a multicast tree, it floods a RREQ-Join message to its neighbors, when the neighbors receive this message, the neighbor with much energy left has a high probability to forward the message, and so on. By making correctness proof and complexity analysis of PBMR, this paper evaluates MAODV and PBMR with extensive simulations, the results show that PBMR has a better jitter than MAODV and a more balance in energy consumption. On the one hand, it saves the energy of the network system; on the other hand, it has a longer network lifetime and a more stable routing than MAODV and successfully solves the inconsistent problem of energy and scalability.