This paper presents an extension of the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol to support multicast communication. AODV is a routing protocol for ad-hoc networks that allows nodes to communicate without a centralized access point. The protocol supports unicast, broadcast, and multicast communication. Multicast communication is achieved by building multicast trees on demand, which are distributed and have no single point of failure. AODV provides loop-free routes for both unicast and multicast, even while repairing broken links. The paper describes the multicast algorithm, which uses the same RREQ/RREP messages as unicast, with an additional MACT message for multicast tree activation. The algorithm also includes mechanisms for pruning and repairing broken links in the multicast tree. Simulation results show that AODV can efficiently route data packets between multicast group members. The simulations were conducted using a packet-level simulator called PARSEC. The results show that AODV's multicast performance is comparable to its unicast performance. The goodput ratio, which is the number of data packets received compared to the number of data packets sent, is slightly lower in multicast simulations due to the increased likelihood of collisions. The control overhead, which is the number of control packets generated during the simulations, is also higher in multicast simulations due to the need to maintain more routes. The paper concludes that AODV is a viable protocol for multicast communication in ad-hoc networks.This paper presents an extension of the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol to support multicast communication. AODV is a routing protocol for ad-hoc networks that allows nodes to communicate without a centralized access point. The protocol supports unicast, broadcast, and multicast communication. Multicast communication is achieved by building multicast trees on demand, which are distributed and have no single point of failure. AODV provides loop-free routes for both unicast and multicast, even while repairing broken links. The paper describes the multicast algorithm, which uses the same RREQ/RREP messages as unicast, with an additional MACT message for multicast tree activation. The algorithm also includes mechanisms for pruning and repairing broken links in the multicast tree. Simulation results show that AODV can efficiently route data packets between multicast group members. The simulations were conducted using a packet-level simulator called PARSEC. The results show that AODV's multicast performance is comparable to its unicast performance. The goodput ratio, which is the number of data packets received compared to the number of data packets sent, is slightly lower in multicast simulations due to the increased likelihood of collisions. The control overhead, which is the number of control packets generated during the simulations, is also higher in multicast simulations due to the need to maintain more routes. The paper concludes that AODV is a viable protocol for multicast communication in ad-hoc networks.