MAODV

AcronymDefinition
MAODVMulticast Ad-Hoc On-Demand Distance Vector
References in periodicals archive ?
Similar to our terminology used for the MAODV example, we refer to a tree node to be either a multicast group member (source and receiver nodes) or an intermediate node in the tree.
Working Example: The working examples presented so far in the previous sections (on MAODV and BEMRP) are receiver-initiated.
Impact of Network Density: For a given group size, the number of links per tree for MAODV and NR-MLPBR is about 4-15%, 8-28% and 10-35% more than that incurred with BEMRP in networks of low, moderate and high density respectively.
For medium and large-sized multicast groups, the number of links per tree for both MAODV and NR-MLPBR is about 7-15%, 17-28% and 21-35% more than that incurred for BEMRP in low, medium and high-density networks respectively.
All the three multicast routing protocols MAODV, NR-MLPBR and R-MLPBR, incur almost the same average hop count per source-receiver and it is considerably lower than that incurred for BEMRP.
This is mainly observed in the case of the minimum-hop based MAODV, NR-MLPBR and R-MLPBR.
MAODV tends to be more unstable as the multicast group size is increased, owing to the minimum hop nature of the paths discovered and absence of any path prediction approach.
This is mainly observed for the minimum-hop based multicast protocols (especially MAODV and NR-MLPBR) which incur a reduced hop count per source-receiver path as we increase the network density.
For a given multicast group size and low node mobility, the time between successive tree discoveries in networks of high density (75 nodes) is 51-80% for MAODV and NR-MLPBR and for R-MLPBR and BEMRP is 70-90% of those obtained in networks of low-density.
For smaller group sizes, the time between successive broadcast tree discoveries for MAODV and BEMRP is respectively about 80%-90% and 85%-94% of that incurred for NR-MLPBR and R-MLPBR.
Impact of Network Density: As we increase the network density from 25 nodes to 50 nodes, we observe that the time between successive broadcast tree discoveries for MAODV, NR-MLPBR, R-MLPBR and BEMRP decreases by 13%, 9%, 6% and 6% respectively.
BEMRP incurs the least energy consumption per node and MAODV incurs the largest energy consumption per node.