International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014

ISSN: 2231-2803 http://www.ijcttjournal.org Page267

Tree Based Multicast Routing Protocols for Ad Hoc Networks
M.Helen
M Tech in Software engineering
Institute Of Aeronautical Engineering,
Dundigal, Hyderabad-43





Dr.N.Chandra Shekar
Reddy
Proff & Head of the Dept,
Computer science &
Engineering
Institute Of Aeronautical
Engineering,
Dundigal, Hyderabad-43

Bashwanth
Professor, CSE Dept.,
Institute of Aeronautical
Engineering,
Dundigal, Hyderabad-43




Abstract: The very important dispute in Multicast routing protocols for Manets below host quality and information measure
restraint is generating multi-hop routing. In Manets Multicast routing features a very important half. a range of multicast routing
protocols possessing distinctive characteristics are introduced within the previous few years. during this paper we tend to have
talked regarding the current state of affairs of the art in advancement of tree based mostly multicast routing protocols for
complete perceptive of multicast routing protocols planned for the long run investigation.
Keywords: Mobile Ad hoc Networks, Multicast Routing, QoS
Introduction:
Apart from disaster relief and military, Mobile unintended
network have perform in an exceedingly wide selection of
elements. One several| to several} or several to abundant
communication square measure needed in many things. Few
networks need solely multicast routing wherever as uncast
routing isn't needed. In these networks multicasting protocol is
taken into account as an important issue. Multicasting protocol
provides a high packet delivery magnitude relation even in
acute things that is taken into account essential in networks. At
an equivalent time low overhead is equally needed for these
protocols, as these networks should have information measure
and battery that square measure vital.
Variety of multicast routing protocols have been predictable
for ad hoc networks in the recent years[6, 7, 8, 9, 10, 11, 12,
13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28 and
29]. The factors and elements of the Tree based Multicast
routing models for Manet have been discovered in this
conversation.

Fig 1: Taxonomy of Multicast Routing properties
To send data from suppliers to receivers of a multicast group a
shared multicast routing tree or multiple source-based
multicast routing trees (one for each group) are created and
retained in tree-based multicast routing protocol. Multicast ad
hoc on-demand distance vector protocol (MAODV) [19] and
the adaptive demand-driven multicast routing protocol
(ADMR [10] are latest patterns of tree-based multicast routing
approaches. A mesh containing attached parts of the network
including all the receivers of a group is preserved in a mesh-
based multicast routing protocol. Core assisted mesh protocol
(CAMP) [13] and the on-demand multicast routing protocol
(ODMRP) [24] are the recent and famous examples of mesh-
based multicast routing protocols.
In the paper below we have discussed about the desired
properties of the multicast routing in segment II and in
segment III the current state of the art in development of tree
based multicast routing protocols for Manets have been
discussed.
II. Affirm properties of the well crafted multicast
routing protocols:
1. The server disadvantages like packet dropping,
robustness in adapting node mobility and unwarned
alterations in typology with partial command
overhead must be the quality of multicast routing
protocols can be ignored. In topologies with
restricted or low energy stages the command
overhead minimization is important.
2. The control packets that are to be transferred to their
destination must be restricted and associated with the
exact quantity of data packets.
3. The tools that are to be considered are energy saving
which aspire at lowering the entire power use of all
nodes in multicast group (reducing the use of nodes
number for creating multicast connectivity, reducing
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page268

the count of overhead controls) and increasing the
multicast life span.
4. To obtain QOS necessities like delay, capacity, delay
jitter and pocket loss, multicast routing protocols
must try to storediverse network resources.
5. Manets are weak at listening in, hindrance, spoofing
and so forth because of ad-hoc infrastructure,
wireless medium and broadcast nature. Including
multicast routing other routing techniques must also
be offered with safety.
6. Irrespective of node number and infrastructure
restrictions and deviations, regularity in firmness also
known as scalability must be at its greatest position.
Tree Based Multicast routing in Manet: Current State of
The art
Tree based Approaches: Tree-based protocols construct a
tree through which multicast data is promoted which happens
only in fixed (non-mobile) multicast routing. Though tree
based strategies are bandwidth-competent but they have few
drawbacks like mobility prone to link failure and they do not
provide adequate robustness.
1. Source-Tree-based approach: Under this approach
every supply node generates a distinct multicast tree
having all the members in a set on both the sides and
the distance linking the source and every individual
not being that short.
2. Shared-Tree based approach: Under this approach
for multicast group containing every source nodes a
single multicast tree is generated, the core node is
referred to the root of tree at the node.This tree is
used to commence a multicast by every source.The
shortest distance for routing is not regarded though it
believes in only point of disappointment which
preserves further routing data that guides to overhead
under this approach. More over during the network
the traffic is combined on shared tree instead on
evenly distributed providing throughput which is
short.
Multicast Ad Hoc On-Demand Distance Vector
(MAODV): The extension of AODV [35] protocol is
MAODV [19]. For every multicast group which has only
receivers and relays, a shared tree is retained. With the help of
broadcast route discovery mechanism a multicast route is
established on requirement. The leader of the group is the one
who is the first person. The order number of the multicast
group must be preserved and given out to the multicast group
by the leader who is liable for this and using a group HELLO
message this can be finished. Request table of nodes is
updated by utilizing the group HELLO data. To preserve the
multicast tree MAODV use an expanding ring search (ERS).
To renovate a not working link which is identified among the
two nodes, the downstream node is liable for commencing it.
By utilizing an ERS an RREQ packet is broadcasted by the
downstream node. The node can reply only if the signified
assessment in the RREQ packet is greater than or equal to the
hop count to the multicast group leader. If a respond is not
obtained by the downstream node it indicates a separation in
the multicast tree. The downstream node that is involved in the
multicast separation, suits to be the fresh multicast group
leader. The separation of the multicast tree continues till the
two parts of the network are fixed.
Observation: stretched postponement and high overheads that
are related with combining not working links in situations of
large mobility and traffic load are the major downsides of
MAODV.In situations of large mobility, huge group of
persons or large traffic load there is a small ratio of packet
delivery. MADOV is not bendable as it is reliable on
AODV.Lastly the main drawback is that it lacks at multicast
group leader.
Multicast Routing Protocol Based on Zone Routing
(MZRP):The combination of reactive and proactive routing
approaches of a source-commenced multicast protocol is
known as MZRP [21].Routing sector is present in all nodes.
Within the zone proactive approach is applied and outside the
zone reactive approach is applied. A multicast tree is built
within the routing zone and then across the zone the tree is
expanded (the entire network). The category of a multicast
advancing node transforms to multicast group member when
the node desires to unite with multicast group. A multicast
route request (MRREQ) message is launched by the other
node. According to the data the source node has MRREQ is
divided into two categories unicast or broadcast. A unicast
MRREQ is sent down the route to the multicast tree and
remains until a multicast route reply MRREQ, if the source
node has a suitable route to all nodes on the tree and wishes to
join that group. Unicast MRREQ is promoted and invalidate
ways are located in the multicast routing tables by the
transitional nodes. MRREP is responded by the target when
the MRREQ is obtained. A border cast MRREQ is
commenced which is mailed through the border cast tree of
the source if the unicast MRREQ is not successful or there is
no convincing route to that group by the source.On obtaining
the border cast MRREQ, the secondary nodes will verify
whether a suitable route to the multicast group or group leader
is present or not. In place of border cast MRREQs, unicast
MRREQs are mailed and till the MRREPs are received they
remain like that, or else through the border cast tree of the
secondary nodes the MRREQs are mailed. Between the
channel nodes reverse ways are built. If the multicast group
consists of a multicast tree and on obtaining an MRREQ for a
multicast group, the end node mails an MRREP to the supply
and to start the fresh division of the multicast tree, they stay
till they obtain an MRACT letter from the supply node.
Through the reverse way the MRREP is mailed to the supply
source.
Observation:various group dimensions are ranged properly
by MZRP. Since the MZRP runs entirely above the Zone
Routing Protocol (ZRP) [32], implies they both can transfer
the data concluding that ODMRP has more power overhead
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page269

than MZRP.A node external to the supply routing zone must
remain still for a substantial period to unite with the group
which is the major problem of this protocol.On evaluating,
MZRP has more potential to produce many situations at nodes
which are a part of many groups each having variety of
sources with the Shared-Tree-based approach.
Mobile Multicast Agent (MMA):To become the virtual
backbone of an ad hoc network mobile multicast agents
(MMAs) are utilized by MMA [20].Since the MMA multicast
structure is dependent on AODV [35] so it supplies multicast
tree discovery and multicast tree protection. In a hierarchy
there are two stages, here a subdivision of network nodes
becomes spine and acts as a virtual backbone on the high of a
clustered pattern. Spine nodes are also named as MMAs,
which are liable for multicast tree invention and protection.
We can transfer nodes using MMAs where the multicast tree
consists of a dispatcher, MMAs and multicast group persons.
An RREQ sachet is mailed to MMA when a mobile wishes to
mail a sachet to multicast group. The MMA responds with an
RREP sachet only when the data for routing to multicast group
is preserved in the MMA or else the appeal for route method
must be commenced by the dispatcher. To lower the size of
RREQ sachets an RREQ sachet is processed if the sachet has
been witnessed previously by an MMA. In symmetric link ad
hoc networks, a distributor MMA can mail RREP sachet on
the opposite direction of the RREQ sachet, where as in
asymmetric link ad hoc networks, a distributor MMA should
begin the test route inventing to the MMA of the dispatcher
node and respond back to the new route appeal of RREP
sachet. There can be easy transmission of data sachets to the
beside hop from the dispatcher down the multicast routing tree
only if the proper structure of the multicast routing tree is
invented.
Observation: As per strategy the MMAs are utilized to
deliver direct data and redeliver sachets, implying decrease in
control overhead and battery control and raise in throughput of
the network.In MMAs data related to route is preserved by
helping them in reducing wastage of time by providing
accurate multicast tree and the data related to routing for a
dispatcher node. MMA nodes must have large storage space
when compared to other nodes as MMAs are required to
achieve all the goals.
Multicast Core Extraction Distributed Ad Hoc Routing
(MCEDAR): A Source-Tree-based multicast protocol is
MCEDAR [18]. To generate competence the Tree-based
protocol and the Mesh-based protocol are combined
together.To built mesh CEDAR [33] is utilized. Mgraph is
utilized as a multicast routing transport, where mgraph is a
MCEDAR that uses a mesh structure. By utilizing core
calculating structureCEDAR produces a lowest dominating set
(MDS) of core nodes. A supply tree is created by CEDAR
which generates a method for core broadcast on consistent
unicast.A core node is selected as its dominator node from
among the nonmember node placed 1 hop left from core
nodes.When the dispatcher of noncore node R1 wishes to
unite with multicast group the dominator core node should be
sent a request of joining. The join action is executed by core
broadcasting a JoinRequest(MA, joinID), it includes the area
of the group in which the nodes wants to unite and the
presentjoinID of the node is equivalent to the multicast group.
A letter is promoted to the surrounded core nodes if a node
who is non member of the multicast group gets a JoinReq.If
present MA person gets the JoinReq then the person with short
JoinID is selected among the present and requested person is
sent with a Join-Ack(MA, joinID),the joinID is promoted for
further process and in reverse situation the nonmember
promotes the request. The Join-Ack letter responded to the
node represents the joinID of the responding node. Depending
on the robustness element (R) a distributor node who gets
Join-Ack letter on the opposite route traveled it chooses
whether to agree or not. The parent group and the child group
are retained by every mgraph person. It is the distributor node
that chooses not to agree with Join-Ack However, when the
intermediate node decides to reject a Join-Ack, as it contains
the Join-Ack and executes a clear leave from the upstream
node implying removal of ID from the child set of upstream
node. The robustness element (R)directs the size of agreeing
Join- Ack sachets at the dominator node (core 5).
Observation: As the end user has multiple paths to a multiple
tree so MCEDAR is considered as tough and competent. If
MCEDAR is utilized with short and lightly dispensed groups,
it results to less competency and highly costly because of
bandwidth limitations, network topology dynamics and more
distributor cost of assessment. To enhance control overhead in
a free movement environment nodes are required to alter their
cores regularly. On comparing with other multicast routing
protocols (Tree-based and Mesh-based) MCEDAR is even
more difficult.
Associatively-Based Ad Hoc Multicast (ABAM): ABAM
[11] is in boom now with the supply found multicast routing
protocol falling in the IPMR group. Depending on the
collection of stability a multicast tree rooted at the multicast
sender is setup for each multicast conference. A Multicast
Broadcast Query (MBQ) letteris transmitted all over the
network by a multicast dispatcher to begin the multicast
conference. Before rebroadcasting the MBQ letter, nodes on
obtaining the MBQ message they will add information and
their addresses (route relaying load, associatively ticks, signal
strength, power life). As promoted further each MBQ letter
gathers data about the distance covered .In order to unite with
a multicast group the multicast end users must gather all the
MBQ messages.A multicast dispatcher obtains various MBQ-
Reply letters, one from each multicast end user, through which
the multicast dispatcher can evaluate a stable multicast tree
resulting in shared links and to create a multicast tree an MC-
Setup letteris created.Figure 2 illustrates the tree construction
part.Upstream node is utilized to discover failed link and then
repair it.
Whenever the upstream node finds any link breakage it
immediately passes a local packet that goes finding
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page270

downstream. And when this node finds the breakage it sends a
local query packet reply and thereby returns to the group. And
if it fails to find the node in the below stream then it is taken
over by the higher upstream node which looks after the tear
about of the link. This helps the join of several receivers. Next
a join packet is relieved to match up with the multicast group.
And as stated earlier when a receiver has to leave a group it
has to mail a leave message which gives information about the
nodes and group. When a number of receivers are multiple
then for all receivers that want to leave the group the tree shall
be pruned increasingly. If the source acts as multicast sender
the tree can be deleted totally, which could be done simply by
informing a message to delete the entire tree.

Fig 2: Tree establishment in ABAM
Observation:On evaluating ODMRP [24] with ABAM, the
later establishes low overhead control traffic and acquires a
high packet delivery ratio because of the constancy of way
among the supply and nodes of end user. Sometimes it may
happen that the distance may not be short as a result few
problems may arise. Measuring the problems is the main
drawback of ABAM.
Bandwidth-Efficient Multicast Routing (BEMRP): The main
objective of BEMRP [12] is to construct a multicast routing
protocol by proper utilization of bandwidth by building a
receiver-commenced tree-based multicast supply. For
broadcasting Join requests BEMRP locates the nodes for
promoting the surrounded group persons instead of locating
the smallest distance among the supply and the end user,
resulting in decrease of communication of data sachets.The
nodes laying in this way turn out to be the promoting
nodes.By utilizing route optimization the waste promoting
nodes are discarded resulting in the decrease of transfer of
data sachets and also reduces bandwidth size.The route setup
in BEMRP is shown in Figure 3. To retain the topology
BEMRP tracks the Hard- State method.When the link smashes
a node transmits the acquired control packet to reunite with
the multicast group.

Figure 3: Route setup in BEMRP
APPLICATION LAYER MULTICAST
ALGORITHM(ALMA):ALMA[45] creates a multicast tree
that generates a logical link among the group members by a
method of Round Trip Time(RTT).This technique measures
the node mobility for example :for when the parent crosses the
threshold a node performs the reconfiguration analogy
depending on the delivery tree. Every edge acts like a logic
that supports a network link. Every group in the receiver finds
the parent node by itself after which it decides on the count of
children to be facilitated.The parent node receives the data
first then it makes a number of copies of that packet data
which is to be forwarded to the children. It is the responsibility
of all the member nodes to maintain the communication with
the parent nodes. With the help of join messages the new
members can create a link with the parent node. However until
and unless the existing members accept the joining of new
members, the new members cannot link a new network.
During this process if a single new node receives a number of
replies, the one which replied first is picked up.to leave a
group a separate leave message shall be delivered separately to
the parent and its children. The parent node thereby accepts
the application and deletes its name from the children list
associated with it.
OBSERVATION: ALMA has some salient features that make
it stand different like: application layer protocol advantage of
simplicity in deployment, no relation with lower layer
protocols and also the salient feature of extracting the
reliability and security provided by lower layers. ERS [35] is
used to find the neighbours that contribute to congestion in the
network contradicting the fact that ALMA is more accurate
then PASTM as stated by simulations performed.
ADAPTIVE DEMAND DRIVEN MULTICAST ROUTING
(ADMR):
ADMR [10] takes the responsibility of maintaining the source
multicast pair. The tree packets periodically flood the tree
which keeps it running. All groups associated with at least one
active sender and one receiver associated with it.For senders
need not put a notification for joining or leaving a group to
which they want to communicate data. The receivers quickly
accept the changes in senders pattern and understand the
mobility in the network.ADMR also portrays all high network
phases to determine high efficiency maintenance of routing
state. Also flooding is made to revert for small durations
whenever the low mobility phase is detected. All the breaks in
the link are identified with the help of ADMR.For all the local
repairs are used to patch the link breakages and some global
repairs where in the local repairs fail.
OBSERVATION: whenever a new load is added ADMR
quickly adapts with it to reduce the redundancy. The drawback
being the storage of large amount of data storage at each node
of group source.to join a group it is an expensive process
which includes the following steps: receiver sending the flood
to the source and then it awaits for the reply from the sources,
and then once confirmed, the receiver starts sharing through
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page271

links provided there are no breaks. Receiver when it tries
joining the group when the tree is broken it becomes a costlier
process.
PROBABILISTIC PREDICTIVE MULTICAST
ALGORITHM (PPMA):
PPMA [29] figures out the relative track position changes of
the node to determine a position that could be useful to exploit
stable links.PPMA continuously makes a note of all the
network state that helps it determine the link cost in terms of
distance, energy, node duration and makes maximum efforts
to keep all the nodes running. The estimated network state is
thereby analyzed in figures of residual energy, link vacancies
and mobility forecasts to improve the life time of the tree. This
PPMA algorithm is a combination of centralized and
distributed methodology. For using the centralized method we
can determine the set of high potential parent nodes.to those
having other children nodes the priority is set as high since
they could help in broadcasting well. The near ones are used
for efficient transmission. However the distributed method
looks for the shortest path in combination of public cost that
supports a node to combine with a tree. Each new receiver
looks for least public cost path before it joins any tree. The
term cost relates to energy consumption and for those potential
nodes that are near are hence forth chosen for power efficient
transmissions.
Observation: PPMA overcomes the balancing of factors that
exists between the bandwidth efficiency to set up a multicast
tree and strength of the tree is based on node energy
consumption and mobility. PPMA exploits the
nondeterministic nature of ad hoc networks. In order to
maximize the multicast tree lifetime estimated network state
evolution in terms of residual node energy, link availability,
and the node mobility forecast are taken into account. As the
path between nodes is not the shortest, so a significant control
overhead will be subjected to maintain the path at different
nodes and the end-to-end delay will also be increased.
On-Demand Overlay Multicast Protocol (ODOMP):
ODOMP [47] is a reactive protocol which creates an overlay
among the group members. This overlay serves as a source-
rooted tree which connects the group members via IP-in-IP
tunnels. If the source node does not have a valid overlay to
send multicast data packet, it buffers the packet and initiates
the overlay creation by broadcasting a JREQ message to its
neighbors. If neighbor node receives a non-duplicate JREQ, it
stores the last Member (the address of the last group member
that has forwarded this JREQ) as its upstream member for this
group only if the node is a group member. It also sets the last
Member field of the JREQ to its own address and the dist. Last
Member field (containing the distance to this member) to zero.
After that, it Unit-casts a JREP message touts upstream
member and immediately forwards the JREQ because the dist.
Last Member field is zero, but if a non-group member receives
a non-duplicate JREQ,the value of the dist. Last Member field
is increased by one, and it waits before it rebroadcasts the
JREQ to its neighbors. This process continues and eventually
source-rooted tree is created. . If a source still has multicast
data packets to send, and does not have a valid overlay, it
creates a new overlay in the same way. A link failure is
formed when a group member fails or leaves and it will be
corrected during the next recreation of the overlay multicast
tree.
Observation: When anon group member waits for a period of
time before rebroadcasting a JREQ is called delayed
forwarding. The effect of this mechanism is that the JREQs
offer away group members are suppressed by the faster
JREQs of closer group members and the probability is very
high that the last Member in the first JREQreceived by a node
is the closest member of the group. ODOMP creates a
temporarily less efficient overlay if the last Member is not the
closest group member. Receiver-initiated join mechanism or a
periodic copy of the JREP to the upstream member is
ineffective way to deal with link failure.
Fireworks:
It is a hybrid 2-tier multicast/ broadcast protocol that adapts to
maintain performance, given the dynamics of the network
topology and group density. It creates acohort of broadcast
(lower tier) distribution in areas with many members, and it
develops a multicast backbone (upper tier) to interconnect
these dense pockets.
Observation: Fireworks reduce the protocol overhead by
exploiting the broadcast nature of the mobile ad hocnetwork in
the area with many group members. Since it employs
broadcasting within a cohort, the inherent redundancy
provides reliability and packet delivery performance that is
comparable with that of ODMRP. Fireworks develops
multicast backbone to interconnect the dense pocket, which
means that a link failure could affect multiple paths and it
reduce the packet delivery ratio and introduce more overhead
especially in a high dynamic environment. Another
disadvantage is that Fireworks depends on the 2- hop local
topology information during the decision phase, so in the case
of packet loss, a reduction in the accuracy of the topology
information could affect the performance of Fireworks.

Protocol Routing Scheme Initialization Approach Topology Maintenance Approach
MAODV Reactive Receiver initiated Shared Tree Hard State Reactive
MZRP Hybrid Source initiated Source Tree Soft State Proactive
AMRIS Reactive Source initiated Shared Tree Hard State Reactive
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page272

PLBM Proactive Receiver initiated Source Tree Hard State Reactive
DDM Reactive Receiver initiated Source Tree +Stateless Soft State Proactive
WBM Reactive Receiver initiated Source Tree Hard State Proactive
MMAs Reactive Receiver initiated Shared Tree Hard State Reactive
ITAMAR Reactive Source initiated Source Tree Soft State Proactive
MCEDAR Proactive Hybrid Source Tree Hard State Reactive
ABAM Reactive Source initiated Source Tree Hard State Reactive
BEMRP Reactive Receiver initiated Source Tree Hard State Reactive
ALMA Proactive Receiver initiated Source Tree Soft State Proactive
ADMR Reactive Source initiated Source Tree Hard State Reactive
PPMA Reactive Source initiated Source Tree Hard State Reactive
ODOMP Reactive Source initiated Source Tree Soft State Proactive
Fireworks Reactive Receiver initiated Source Tree Soft State Proactive
Table 1: Tabular representation of the Tree based multicast routing protocols and their properties
Conclusion:
In this article we offer descriptions of several tree based
multicast routing schemes proposed for spontaneous mobile
networks, classification of those schemes, in line with network
layer, topology used, initiation strategy and maintenance
strategy. Its not clear that any particular algorithm or class of
algorithm is that the best for all scenarios and that they have
definite advantages and drawbacks, and is similar
temperament surely situations. the sector of spontaneous
mobile networks is rapidly growing and changing, and still
there ar several challenges that require tube met.
References:
[1] H. Deng, W. Li, and D. P. Agrawal, Routing security in wireless ado
networks, IEEE Communication... Mag., vol. 40, no. 10, pp. 7075, Oct.
2002.
[2] M. Younis and S. Z. Ozer, Wireless ad-hoc networks: Technologies and
challenges, Wireless Commun. Mobile Computing, vol. 6, no. 7, pp. 889
892, Nov. 2006.
[3] S. Guo and O. Yang, Energy-aware multicasting in wireless ad-hoc
networks: A survey and discussion, Computer Commun., vol. 30, no. 9, pp.
21292148, June 2007.
[4] X. Chen and J. Wu, Multicasting techniques in mobile ad-hoc networks,
The Handbook of Ad-hoc Wireless Networks, pp. 2540, 2003.
[5] L. Junhai and Y. Danxia, et al., Research on routing security in
MANET, Application Research of Computers, vol. 25, no. 1, pp. 243 245,
Jan. 2008.
[6] C.-C. Chiang, M. Gerla, and L. Zhang, Adaptive shared tree multicast in
mobile wireless networks, in Proceedings of the IEEE Global
Telecommunications Conference (GLOBECOM 98), vol. 3, pp. 18171822,
1998.
[7] C.-C. Shen and C. Jaikaeo, Ad hoc multicast routing algorithm with
swarm intelligence, Mobile Networks and Applications, vol. 10, no. 1, pp.
4759, 2005.
[8] C.W.Wu, Y. C. Tay, and C.-K. Toh, Ad hocMulticast Routing protocol
utilizing Increasing id-numberS (AMRIS), draftietf- manet-amris-spec-00.txt,
2000.
[9] S. Park and D. Park, Adaptive core multicast routing protocol,
Wireless Networks, vol. 10, no. 1, pp. 5360, 2004.
[10 J. G. Jetcheva and D. B. Johnson, Adaptive demand-driven multicast
routing in multi-hop wireless ad hoc networks, in Proceedings of the 2nd
ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc 01), pp. 3344, 2001.
[11] C.-K. Toh, G. Guichal, and S. Bunchua, ABAM: on-demand
associativity-based multicast routing for ad hoc mobile networks, in
Proceedings of the IEEE Vehicular Technology Conference (VTC 00), vol. 3,
pp. 987993, 2000.
[12] T. Ozaki, J. B. Kim, and T. Suda, Bandwidth-efficient multicast routing
for multihop, ad-hoc wireless networks, in Proceedings of the 20th Annual
Joint Conference of the IEEE Computer and Communications Societies
(INFOCOM01), vol. 2, pp. 11821191, 2001.
[13] J. J. Garcia-Luna-Aceves and E. L. Madruga, The coreassisted mesh
protocol, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8,
pp. 13801394, 1999.
[14] L. Ji and M. S. Corson, Differential destination multicasta MANET
multicast routing protocol for small groups, in Proceedings of the 20th
Annual Joint Conference of the IEEE Computer and Communications
Societies (INFOCOM01), vol. 2, pp. 11921201, 2001.
[15] S. K. Das, B. S. Manoj, and C. S. R. Murthy, A dynamic core based
multicast routing protocol for ad hoc wireless networks, in Proceedings of
the International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc 02), pp. 2435, 2002.
[16] C.-C. Chiang, M. Gerla, and L. Zhang, Forwarding Group Multicast
Protocol (FGMP) for multihop, mobile wireless networks, ACM-Baltzer
Journal of Cluster Computing, vol. 1, no. 2, pp. 187196, 1998.
[17] Sajama and Z. J. Haas, Independent-tree ad hoc multicast routing
(ITAMAR), Mobile Networks and Applications, vol. 8, no. 5, pp. 551566,
2003.
[18] R. S. PrasunSinha and V. Bharghavan, MCEDAR: multicast core-
extraction distributed ad hoc routing, in Proceedings of the Wireless
Communications and Networking Conference, vol. 3, pp. 13131317, 1999.
[19] E. M. Royer and C. E. Perkins, Multicast ad hoc on demand distance
vector (MAODV) routing, Internet-Draft, draft-ietfdraft- maodv-00.txt, 2000.
[20] X. Wang, F. Li, S. Ishihara, and T. Mizuno, A multicast routing
algorithm based on mobile multicast agents in ad-hoc networks, IEICE
Transactions on Communications, vol. E84-B, no. 8, pp. 20872094, 2001.
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page273

[21] X. Zhang and L. Jacob, MZRP: an extension of the zone routing
protocol for multicasting in MANETs, Journal of Information Science and
Engineering, vol. 20, no. 3, pp. 535 551, 2004.
[22] S. Lee and C. Kim, Neighbor supporting ad hoc multicast routing
protocol, in Proceedings of the ACM International Symposium on Mobile Ad
Hoc Networking and Computing (MobiHoc 00), pp. 3744, 2000.
[23] C.-C. Hu, E. H.-K. Wu, and G.-H. Chen, OGHAM: ondemand global
hosts for mobile ad-hocmulticast services, Ad Hoc Networks, vol. 4, no. 6,
pp. 709723, 2006.
[24] S.-J. Lee,W. Su, andM. Gerla, On-demand multicast routing protocol in
multihop wireless mobile networks, Mobile Networks and Applications, vol.
7, no. 6, pp. 441453, 2002.
[25] R. S. Sisodia, I. Karthigeyan, B. S. Manoj, and C. S. R. Murthy, A
preferred link based multicast protocol for wireless mobile ad hoc networks,
in Proceedings of the IEEE International Conference on Communications
(ICC 03), vol. 3, pp. 2213 2217, 2003.
[26] R. Vaishampayan and J. J. Garcia-Luna-Aceves, Protocol for unified
multicasting through announcements (PUMA), in Proceedings of the IEEE
International Conference onMobile Ad- Hoc and Sensor Systems (MASS 04),
2004.
[27] H. Moustafa and H. Labiod, SRMP: a mesh-based protocol for
multicast communication in ad hoc networks, in Proceedings of the
International Conference on Third Generation Wireless and Beyond
3Gwireless, pp. 4348, May 2002.
[28] S. K. Das, B. S. Manoj, and C. S. R. Murthy, Weight based multicast
routing protocol for ad hoc wireless networks, in Proceedings of the IEEE
Global Telecommunications Conference (GLOBECOM 02), vol. 1, pp. 117
121, 2002.
[29] D. Pompili and M. Vittucci, PPMA, a probabilistic predictive multicast
algorithm for ad hoc networks, Ad Hoc Networks, vol. 4, no. 6, pp. 724748,
2006.
[30] K. Chen and K.Nahrstedt, Effective location-guided tree construction
algorithms for small group multicast in MANET, in Proceedings of the
Annual Joint Conference of the IEEE Computer and Communications
Societies (INFOCOM02), vol. 3, pp. 11801189, 2002.
[31] C. Gui and P. Mohapatra, Scalable multicasting in mobile ad hoc
networks, in Proceedings of the Annual Joint Conference of the IEEE
Computer and Communications Societies (INFOCOM 04), vol. 3, pp. 2119
2129, 2004.
[32] Z. J. Haas and M. R. Pearlman, The Zone Routing Protocol (ZRP) for
Ad Hoc Networks, draft-zone-routing-protocol- 00.txt, 1997.
[33] R. Sivakumar, P. Sinha, and V. Bharghavan, CEDAR: a
coreextractiondistributed ad hoc routing algorithm, IEEE Journal on
Selected Areas in Communications, vol. 17, no. 8, pp. 1454 1465, 1999.
[34] R. S. Sisodia, B. S. Manoj, and C. S. R. Murthy, A preferred link based
routing protocol for wireless ad hoc networks, Journal of Communications
and Networks, vol. 4, no. 1, pp. 14 21, 2002.
[35] C. E. Perkins, Ad Hoc On Demand Distance Vector (AODV) Routing,
Internet-Draft, draft-ietf-manet-aodv-00.txt, 1997.
[36] X. Xiong, U. T. Nguyen, and H. L. Nguyen, Preemptive multicast
routing in mobile ad-hoc networks, in Proceedings of the International
Conference on Networking, International Conference on Systems and
International Conference on Mobile Communications and Learning
Technologies (ICN/ICONS/MCL06), pp. 6874, 2006.
[37] T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT),
ACM SIGCOMM Computer Communication Review, vol. 23, pp. 8595, 1993.
[38] D. B. Johnson and D. A. Maltz, Dynamic source routing in ad hoc
wireless networks, in Mobile Computing, T. Imielinski and H. Korth, Eds.,
vol. 5, pp. 153181, 1996.
[39] L. K. Law, S. V. Krishnamurthy, and M. Faloutsos, A novel adaptive
protocol for lightweight efficient multicasting in ad hoc networks,
ComputerNetworks, vol. 51, no. 3, pp. 823834, 2007.
[40] S. S. Manvi and M. S. Kakkasageri, Multicast routing in mobile ad hoc
networks by using a multiagent system, Information Sciences, vol. 178, no. 6,
pp. 16111628, 2008.
[41] A. B. Mnaouer, L. Chen, C. H. Foh, and J. W. Tantra, OPHMR: an
optimized polymorphic hybrid multicast routing protocol for MANET, IEEE
Transactions on Mobile Computing, vol. 6, no. 5, pp. 503514, 2007.
[42] P. Jacquet, P. Minet, A. Laouiti, L. Viennot, T. Clausen, and C. Adjih,
Multicast optimized link state routing, Internet Draft, draft-ietf-manet-olsr-
molsr-01.txt, 2002.
[43] J. Xie, R. R. Talpade, A. McAuley, and M. Liu, AMRoute: ad hoc
multicast routing protocol, Mobile Networks and Applications, vol. 7, no. 6,
pp. 429439, 2002.
[44] J. Biswas and S. K. Nandy, Application layer multicasting for mobile
ad-hoc networks with network layer support, in Proceedings of the 29th
Annual IEEE International Conference on Local Computer Networks (LCN
04), pp. 2431, 2004.
[45] M. Ge, S. V. Krishnamurthy, and M. Faloutsos, Application versus
network layer multicasting in ad hoc networks: the ALMA routing protocol,
Ad Hoc Networks, vol. 4, no. 2, pp. 283300, 2006.
[46] C. Gui and P. Mohapatra, Efficient overlay multicast for mobile ad hoc
networks, in Proceedings of the IEEE Wireless Communications and
Networking Conference (WCNC 03), vol. 2, pp. 11181123, 2003.
[47] O. Stanze and M. Zitterbart, On-demand overlay multicast in mobile ad
hoc networks, in Proceedings of the IEEEWireless Communications and
Networking Conference (WCNC 05), vol. 4, pp. 21552161, 2005.
[48] K.-I. Kim and S.-H. Kim, DESIRE: density aware heterogenous overlay
multicast forwarding scheme in mobile ad hoc networks, IEICE Transactions
on Communications, vol. E88- B, no. 9, pp. 35793586, 2005.
[49] K.-D. Kim, J.-H.Park, K. Lee, H.-Y.Kim, and S.-H. Kim, A scalable
location-based application layer multicast protocol in manet, in Proceedings
of the IASTED International Conference on Wireless Networks and Emerging
Technologies, Part of the 6th IASTED International Multi-Conference on
Wireless and Optical Communications, 2006.
[50] S. Jain and S. R. Das, MAC layer multicast in wireless multihop
networks, in Proceedings of the 1st International Conference on
Communication System Software and Middleware (Comsware 06), pp. 110,
2006.
[51] M.-T. Sun, L. Huang, S. Wang, A. Arora, and T.-H. Lai, Reliable MAC
layer multicast in IEEE 802.11 wireless networks, Wireless Communications
and Mobile Computing, vol. 3, no. 4, pp. 439453, 2003.
[52] K. Tang and M. Gerla, MAC reliable broadcast in ad hoc networks, in
Proceedings of the IEEEMilitary Communications Conference (MILCOM
01), vol. 2, pp. 10081013, 2001.
[53] W. Si and C. Li, RMAC: a reliablemulticast MAC protocol for wireless
ad hoc networks, in Proceedings of the International Conference on Parallel
Processing (ICPP 04), pp. 494501, 2004.
International Journal of Computer Trends and Technology (IJCTT) volume 10 number 5 Apr 2014
ISSN: 2231-2803 http://www.ijcttjournal.org Page274

[54] H. Gossain, N. Nandiraju, K. Anand, and D. P. Agrawal, Supporting
MAC layer multicast in IEEE 802.11 based MANETs: issues and solutions,
in Proceedings of the Conference on Local Computer Networks (LCN 04),
pp. 172179, 2004.
[55] K. Tang and M. Gerla, Congestion control multicast in wireless ad hoc
networks, Computer Communications, vol. 26, no. 3, pp. 278288, 2003.
[56] K. Tang and M. Gerla, Random access MAC for efficient broadcast
support in ad hoc networks, in Proceedings of the IEEE Wireless
Communications and Networking Conference (WCNC 00), vol. 1, pp. 454
459, 2000.
[57] A. Chen, D. Lee, G. Chandrasekaran, and P. Sinha, HIMAC: high
throughput MAC layer multicasting in wireless networks, in Proceedings of
the IEEE International Conference on Mobile Ad Hoc and Sensor Systems
(MASS 07), pp. 4150, 2007.
[58] K. S. Lau and D. Pao, Multicast medium access control in wireless ad
hoc network, in Proceedings of the IEEE Wireless Communications and
Networking Conference (WCNC 04), vol. 3, pp. 19031908, 2004.
[59] F. A. Tobagi and L. Kleinrock, Packet switching in radio channels
part II: the hidden terminal problem in carrier sense multiple-access and the
busy-tone solution, IEEE Transactions on Communications, vol. 23, no. 12,
pp. 1417 1433, 1975.