MAODVMulticast Ad-Hoc On-Demand Distance Vector
Copyright 1988-2018, All rights reserved.
References in periodicals archive ?
One new field (i.e., average trust value, ATV) is added to the original RREP messages (i.e., Table 3) of MAODV. Assume that a selected routing path contains n nodes, and then the average trust value can be calculated using the following equation:
The traditional MAODV protocol stipulates that the shortest one is selected as a priority [32].
We use the NS-2.35 simulator [33] to estimate the performance of MAODV [29], MTAODV, LWT-MAODV [20] and RBTM-MAODV [26] under different scenarios.
LMRSC has only one type of control message, as opposed to two in ODMRP, and three in MAODV. A mesh structure is formed from each mobile node, which is located in the stable routes between any receiver and the core.
The difference in end-to-end delay between DCEEMR and MAODV is significant.
Figures 6(a) and 6(b) show that energy consumption of constructing multicast tree with using DCEEMR and MAODV, respectively.
Tree-based routing Location-based routing Strengths Small data packet No distributed routing overhead control overhead, less path encoding and decoding overhead than source-based Weaknesses Stateful, large Large packet size control overhead (location information of destinations), large forwarding computation Examples MAODV, ADMR, ODMRP, PBM, LGT, GMR, DDM, RDG AM-Route, AMRIS Source-based routing Strengths No distributed routing control overhead, relatively smaller forwarding computation than location-based Weaknesses Large packet size (path), path encoding and decoding overhead Examples DSM TABLE 3: Power consumption ratio.
MAODV [15] is the multicast extension of the AODV unieast routing protocol.
Tree Formation (Expansion) Phase: In MAODV, a receiver node joins the multicast tree through a member node that lies on the minimum hop path to the source.
Working Example: In Figure 2, we illustrate tree formation (expansion) under the MAODV protocol using an example.
We investigate the minimum-hop based Multicast Ad hoc On-demand Distance Vector (MAODV) routing protocol [18], the minimum-link based Bandwidth-Efficient Multicast Routing Protocol (BEMRP) [16] and our recently proposed non-receiver aware and receiver aware multicast extensions to the Location Prediction Based Routing protocol [9], referred to as NR-MLPBR and R-MLPBR protocols [10] respectively.
In this section, we discuss the working of the MANET multicast routing protocols (MAODV, BEMRP, NR-MLPBR and R-MLPBR) whose performance under DMEF and default flooding is studied through simulations in this paper.