Multicast operation of the ad-hoc on-demand distance vector routing protocol

摘要: An ad-hoc network is the cooperative engagement of a collection (typically wireless) mobile nodes without required intervention any centralized access point or existing infrastructure. To provide optimal communication ability, routing protocol for such dynamic self-starting must be capable unicast, broadcast, and multicast. In this paper we extend Ad-hoc On-Demand Distance Vector Routing (AODV), an algorithm operation networks, to offer novel multicast capabilities which follow naturally from way AODV establishes unicast routes. builds trees as needed (i.e., on-demand) connect group members. Control tree distributed so that there no single failure. provides loop-free routes both multicast, even while repairing broken links. We include evaluation methodology simulation results validate correct efficient algorithm.