International Journal of Scientific & Engineering Research, Volume 5, Issue 5, May-2014 440

ISSN 2229-5518

Implementation of a Tree Based Multicast

Routing Protocol in MANET
G.Brindha, Mr.S.Jebakumar Gomer Rajadurai, Dr.K.Ramasamy

Abstract— The Mobile ad hoc network (MANET) is formed by mobile stations inside a restricted area which communicate without the need
of access point. In an ad hoc network the mobile nodes agree to serve as both routers and hosts. One of the main challenges of MANET is
the design of robust routing algorithms that adapt to the frequent and randomly changing the position of the node. Many type of on demand
routing protocols has been proposed and several have been extensively simulated. We proposed Multicast Ad hoc on demand Distance
Vector Routing Protocol. MAODV allows each node in the network to send out multicast data packets and the multicast data packets are
broadcast when propagating along the multicast group tree. Our main objective is to implement and analyze the MAODV protocol in terms
of the latency and the packet delivery ratio (PDR).

Index Terms— Latency, Manet, Multicast, MAODV, PDR, Routing, Tree based protocol.

——————————  ——————————

1 INTRODUCTION

A mobile ad-hoc network (MANET) is a self-configuring

network of mobile routers (and associated hosts) con-
nected by wireless links - the union of which form a ran-
of such ad hoc networks to offer novel multicast capabilities
which follow naturally from the way AODV establishes
unicast routes. AODV builds multicast trees as needed to con-
dom topology. The routers are free to move randomly and nect multicast set members. Control of the multicast tree is

IJSER
systematize themselves at random; thus, the wireless topology distributed so that there is no single point of failure. AODV
of network may change rapidly and randomly (and associated provides loopfree routes for both unicast and multicast, even
hosts) connected by wireless links - the union of which form a while repairing broken links.
random topology. Such a network may operate in an impartial Singh, Y. et.al[12] have proposed simulation based experi-
method, or may be connected to the superior Internet. With ments are performed to analyze the performance of On De-
the increase of portable devices as well as progress in wireless mand Multicast Routing Protocol by evaluating Packet Deliv-
communication, ad-hoc networking is more important with ery Ratio, End to End delay and average throughput. These
the rising number of extensive applications. Ad-hoc network- results are compared with AODV and FSR routing protocols
ing can be applied everywhere where there is little or no by varying number of nodes and mobility. The comparison
communication infrastructure or the existing infrastructure is shows that ODMRP for adhoc networks performs better as
expensive or difficult to use. Ad hoc networking allows the compared to AODV and FSR.
devices to maintain connections to the network as well as easi- Qabajeh, M.M. et.al[13] have proposed a model that search-
ly adding and removing devices to the network. The set of es for QoS paths from a single source to a set of destinations.
applications for MANET is miscellaneous, ranging from com- The physical area is partitioned into equal size hexagonal cells
prehensive, mobile, highly dynamic networks, to small, static and a leader and backup leader nodes is elected to maintain
networks that are inhibited by power sources. Besides the in- up-to-date information about the network topology. Efficient
heritance applications that move from traditional infra struc- routing is performed based on nodes positions to deliver data
tured environment into the ad hoc framework, a great deal of packets to all the receivers.when it is compared with ODMRP,
new services can and will be generated for the new environ- it gives less packet drop ratio with significant reduction in
ment. Typical applications include military battlefield, com- control overhead.
mercial sector, Personal Area Network (PAN) etc.
3 MULTICAST ROUTING PROTOCOLS FOR MANET
2 RELATED WORKS Ad hoc wireless networks find applications in civilian opera-
Elizabeth M.Royer et.al [6] extend Ad hoc On Demand Dis- tions emergency search and rescue, law enforcement, and war
tance Vector Routing (AODV), an algorithm for the operation fare situations, where setting up and maintaining a communi-
cation infrastructure may be difficult or costly. In all these ap-
———————————————— plications, communication and coordination among a given
• G.Brindha is currently pursuing masters degree program in computer and set of nodes are necessary. Routing protocols that find a path
communication engineering in P.S.R.Rengasamy College of Engineering
for Women, India, E-mail: [email protected]
to be followed by data packets from a source node to a desti-
• Mr.S.JebakumarGomerRajadurai is currently working as associative pro- nation node used in traditional wired networks cannot be di-
fessor in P.S.R.Rengasamy College of Engineering for women, India. rectly applied in ad hoc wireless networks due to their highly
E-mail: [email protected] animated topology, absence of established infrastructure for
• Dr.K.Ramasamy is cuurently working as principal and professor in
P.S.R.Rengasamy College of Engineering for women, centralized administration (e.g., base stations or access points),
India.E.mail: [email protected] and bandwidth –constrained wireless links and resource con-
strained nodes.
IJSER © 2014
http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 5, May-2014 441
ISSN 2229-5518
Based on the type of operation, multicast protocols for ad tained per source. The increase in the number of sources gives
hoc wireless networks are broadly classified into two types: rise to a proportional increase in the number of source trees.
 Source initiated protocols The main problem in a shared tree based multicast protocol
 Receiver initiated protocols is that it heavily depends on the core node, and hence, a single
In the source initiated multicasting protocols, the source point failure at the core node affects the performance of the
uses flooding to search for paths to the receivers of the mul- multicast protocol.
ticast groups to which it belongs. Here hard or soft state
maintenance approaches are used for mesh or tree networks.
In soft state approach the source of the multicast group pe-
4 MULTICAST AD-HOC ON-DEMAND DISTANCE
riodically floods a JoinRequest packet throughout the net- VECTOR (MAODV)
work. This is a two pass protocol for establishing tree or mesh. Multicast Ad-Hoc On-Demand Distance Vector (MAODV) is
There is no explicit procedure for route repair.In the hard state routing protocol is implemented. It is used to identify mul-
approach there is an explicit route repair procedure that is ticast routes on demand using a broadcast route-discovery
initiated when a link break is detected. mechanism. A source node originates a Route Request (RREQ)
Multicast routing protocols play an important role in ad message when it desires to join a multicast group, or when it
hoc wireless networks to provide this communication. It is has data to launch to a multicast group but it does not have a
always, advantageous to use multicast rather than multiple route to that group. Only a member of the desired multicast
unicast, especially in the ad hoc environment, where band- group may respond to a join RREQ. If the RREQ is not a join
width comes at a premium. There are some issues in designing request, any node with a fresh enough route (based on group
multicast routing protocols known as Robustness, Efficiency, sequence number) to the multicast group may retort.
Control overhead, Bandwidth, Resource management and If an intermediate node receives a join RREQ for a multicast
Quality of service. Limited bandwidth availability, an error group of which it is not a member, or if it receives a RREQ and
prone shared broadcast channel, the mobility of nodes with it does not have a route to that group, it rebroadcasts the
limited energy resources, the hidden terminal problem and RREQ to its neighbors. As the RREQ is broadcast across the

IJSER
limited security make the design of a multicast routing proto- network, nodes set up pointers to establish the reverse route in
col for ad hoc networks a challenging one. their route tables. A node receiving a RREQ first updates its
In the receiver initiated multicasting protocols, the receiver route table to record the sequence number and the next hop
uses flooding to search for paths to the sources of the multicast information for the source node. This reverse route entry may
groups to which it belongs. Here also hard or soft state later be used to relay a response back to the source. For join
maintenance approaches are used for mesh or tree networks. RREQs, an additional entry is added to the multicast route
The tree construction is a three phase process. table. This entry is not activated unless the route is selected to
be part of the multicast tree. If a node receives a join RREQ for
3.1 Tree Based Routing Protocols a multicast group, it may reply if it is a member for the mul-
Wireless networks do not share the robust and high-speed ticast group’s tree and its recorded sequence number for the
links enjoyed by their wired counterparts. Wireless connec- multicast group is at least as great as that contained in the
tions have a small data carrying capacity, a relatively high RREQ. The responding node updates its route and multicast
error rate, and are unreliable when compared to traditional route tables by placing the requesting node’s next hop infor-
wired connections. Without a backbone network individual mation in the tables, and then unicasts a Request Response
host-routers must have the ability to maintain routes and for- (RREP) back to the source node. As nodes along the path to
ward data to downstream nodes. At last count, close to a doz- the source node receive the RREP, they add both a route table
en different MANET routing protocols have been proposed and a multicast route table entry for the node from which they
Depending on how the routes connect the multicast mem- received the RREP.
bers with each other, we can basically distinguish two major When a source node broadcasts a RREQ for a multicast
categories of protocols based on topology, known as tree group, it often receives more than one reply. The source node
based and mesh based protocols. In tree based multicast rout- keeps the received route with the greatest sequence number
ing protocols, there is only one path between a source-receiver and shortest hop count to the nearest member of the multicast
pair. The main drawback of these protocols is that they are not tree for a specified period of time, and disregards other routes.
robust enough to operate in highly mobile environ- At the end of this period, it enables the selected next hop in its
ments.There are two types in tree based multicast routing pro- multicast route table, and unicasts an activation message
tocols known as: (MACT) to this selected next hop. The next hop, on receiving
 Shared tree based protocol this message, enables the entry for the source node in its mul-
 Source tree based protocol ticast route table. If this node is a member of the multicast tree,
In shared tree based protocol the state information is main- it does not propagate the message any further. However, if
tained per group. These are more scalable when compared to this node is not a member of the multicast tree, it will have
source tree based protocols. received one or more RREPs from its neighbors. It keeps the
In source tree based protocols the tree is routed at the best next hop for its route to the multicast group, unicasts
source whereas a shared tree based multicast protocols, a sin- MACT to that next hop, and enables the corresponding entry
gle tree is shared by all the sources within the multicast group. in its multicast route table. This process continues until the
In source tree based protocols a single multicast tree is main- node that originated the RREP (member of tree) is reached.
IJSER © 2014
http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 5, May-2014 442
ISSN 2229-5518
The activation message ensures that the multicast tree does the tree or when the node wants to transmit the message.
not have multiple paths to any tree node. Nodes only forward To predict the link breakage time of an active link in
data packets along activated routes in their multicast route the tree before the breakage actually happens, then a new
tables. connection is pro-actively constructed before the old one actu-
ally becomes unavailable, in order to avoid the loss of data
packets on that link.
R
1
5 EXPERIMENTAL SETUP AND ANALYSIS
The performance of MAODV is analyzed. The number of
senders increased as 1, 2, 5 and 10 and the number if receivers
are increased as 10, 20, 30, 40, and 50.The PDR (Packet Deliv-
R
S 2

ery Ratio) and Latency with no pause time for 0m/s mobility,
group member 1m/s mobility and 20m/s maximum speed are calculated.
Latency is the average delay for data transfer from a sender to
a receiver. The network simulator ns2.26 is used for imple-
Tree node

Control packets R
3
mentation. The simulation area is 1500 x 300 meters with 50
MACT nodes. The Physical/Mac Layer IEEE 802.11 at 2Mbps is used
RREQ
B
in 250 meter transmission range. All receivers join a single
RREP
multicast group at the beginning of the simulation. Only mul-
ticast traffic exists in the simulation. When the multicast group
Fig. 1. Tree Repair in MAODV size increased the number of control packets also increased. By
increasing the PDR the network throughput also increased.
The ratio of the data packets delivered to the destinations to

IJSER
The first element of the multicast group becomes the head those generated by the CBR sources is known as packet deliv-
for that group. The multicast group head is responsible for ery fraction.
maintaining the multicast group sequence number and dis- The following figures show the analysis results for Multicast
tributing this number to the multicast group. This is done Ad hoc on demand Distance Vector Routing protocol.
through a Group Hello message. The Group Hello contains
extensions that indicate the multicast group IP address and
sequence numbers (incremented every Group Hello) of all
multicast groups for which the node is the group head. Ele-
ments use the Group Hello information to update their re-
quest table.
Main objective is to reduce the latency, to increase the PDR
(Packet Delivery Ratio) and to reduce the bandwidth con-
sumption by reducing the number of forwarders for reducing
number of hosts in packet transmission. The same RREQ and
RREP messages used in AODV are adapted to be used for tree
construction in MAODV. The node creates an entry in its Mul-
ticast Route Table, and identifies itself as a group member, but
with an unknown group leader address, and without any up-
stream and downstream next hop. If a node in the tree but not
a group member wants to become a group member, it simply Fig. 2. PDR for no Mobility
changes its identity recorded in its Multicast Route Table,
from a router to a group member. Multicast Route Activation
(MACT), message is used for grafting a branch to the tree.
For single sender the PDR will be high, when the number of
4.1 Proactive Approach sender increased to 10 the PDR is decreased. That is when the
We add the reactive connection maintenance feature to the number senders increased the PDR will be decreased.
tree maintenance in MAODV implementation. A route is es- For the single sender the latency is low, when there are 2
tablished only when it is required by a source node for trans- senders the delay is increased. As a result when the number of
mitting data packets. It employs destination sequence num- senders increased the delay (Latency) is also increased.
bers to identify the most recent path.
In an on-demand routing protocol, the source node floods
the RouteRequest packet in the network when a route is not
available for the desired destination. It may obtain multiple
routes to different destinations from a single RouteRequest.
That is, the route is established when the node wants to join
IJSER © 2014
http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 5, May-2014 443
ISSN 2229-5518

Fig. 3. Latency for no Mobility.

Fig.6. PDR for 20m/s Maximum speed.

In fig.5 the and fig.7 the latency for 1m/s and 2m/s is cal-
culated and the graph is ploted.

IJSER
Fig. 4. PDR for 1m/s maximum speed.
Fig. 7. Latency for 1m/s Maximum speed.

6 CONCLUSION AND FUTURE WORK

Many of the proposed multicast routing protocols have been
simulated using ns/2. Because of the data forwarding prob-
lem, such metrics as throughput, end-to-end delay and the
percentage of received packets are difficult to measure. In or-
der to improve the packet delivery ratio and to decrease the
latency MAODV protocol is used. When the multicast group
size is increased (in the form of more multicast senders) the
packet delivery ratio is decreased. The average packet latency
will be remarkably constant across all scenarios. Since band-
width and power are limited in MANETs, they should be tak-
en into consideration in routing/multicasting protocols. The
development of a simulation for the ns/2 simulation would be
extremely useful. In future it is planned to construct the
Fig. 5. Latency for 1m/s Maximum speed. bandwidth efficient multicast trees in MANET with the objec-
tive of minimizing the number of forwarders.

REFERENCES
[1] Broch, J.; Maltz, D. A.; Johnson, D. B.; Hu, Y.-C. and Jetcheva. J.; .A Perfor-
IJSER © 2014
http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 5, May-2014 444
ISSN 2229-5518
mance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Proto-
cols., Proceedings of the 4th Annual ACM/IEEE International Conference on
Mobile Computing and Networking (MOBICOM.98), Dallas, TX, USA, Octo-
ber 1998, pages 85-97.
[2] Cheng. E.; .On-Demand Multicast Routing in Mobile Ad Hoc Net-
works., M. Eng. Thesis, School of Computer Science, Carleton Uni-
versity, January 2001.
[3] Kunz, T.; "Reliable multicasting in MANETs", Contractor Report,
Communications Research Centre, Ottawa, Canada, July 2003
[4] Perkins, C. E. and Royer, E. M.; "Ad-hoc On-Demand Distance Vector
Routing", Proceedings of the 2nd IEEE Workshop on Mobile Compu-
ting Systems and Applications (WMCSA.99), New Orleans, LA, USA,
February 1999, pages 90-100
[5] Royer, E. M. and Perkins, C. E.; "Multicast Operation of the Ad-hoc
On-Demand Distance Vector Routing Protocol", Proceedings of the
5th Annual ACM/IEEE International Conference on Mobile Compu-
ting and Networking (MOBICOM.99), Seattle, WA, USA, August
1999, pages 207-218.
[6] Royer, E. M. and Perkins, C. E.; "Multicast Ad hoc On-Demand Dis-
tance Vector (MAODV) Routing", IETF, Intemet Draft: draft- ietf-
manet-maodv-00.txt, 2000.
[7] Zhu, Y.; .Pro-active Connection Maintenance in AODV and
MAODV., M. Sc. Thesis, Department of Systems and Computer En-
gineering, Carleton University, August 2002.

IJSER
[8] R. Bagrodia, M. Gerla, J. Hsu, W. Su, and S.-J. Lee. “A performance
comparison study of ad hoc wireless multicast protocols”, Proc. of
the 19th Annual Joint Conf. of the IEEE Computer and Communica-
tions Societies, March 2000, pages 565 –574.
[9] E. Cheng, "On-demand multicast routing in mobile ad hoc networks”,
M.Eng. thesis, Carleton University, Department of Systems and Com-
puter Engineering, 2001.
[10] T. Kunz, "Multicasting: From fixed networks to ad-hoc networks", to
appear in the Handbook of Wireless Networks and Mobile Compu-
ting, John Wiley & Sons.
[11] Singh, Y. Chaba, Y. ; Jain, M. ; Rani, P.” Performance Evaluation of
On-demand Multicasting Routing Protocols in Mobile Adhoc Net-
works”proceedings of the IEEE conference on March 2010.
[12] Qabajeh, M.M., Abdalla, A.H. ; Khalifa, O. ; Qabajeh, L.K.”A tree-
based QoS multicast routing protocol for MANETs” on 4th inter-
naional conference on may 2011.
[13] H. Lim and C. Kim. “Multicast tree construction and flooding in wireless ad
hoc networks”, Proc. Of the 3rd ACM Int. Workshop on Modeling, Analy-
sis and Simulation of Wireless and Mobile Systems,
[14] S. Paul. “Multicasting on the Internet and its Applications”, Kluwer Aca-
demic Publishers, ISBN 0792382005, June 1998.
[15] E. Royer and C. E. Perkins. "Transmission Range Effects on AODV
Multicast Communication." To appear in ACM Mobile Networks and
Applications, special issue on Multipoint Communication in Wireless
Mobile Networks.

IJSER © 2014
http://www.ijser.org