Bhattacharya, RuplaEphremides, Anthonyﲍulticasting refers to the transmission of the same information to several destinations. In this paper we are addressing the issue of multicast routing in a wireless network that consists of an arbitrarily large number of nodes, each of which is mobile in an unpredictable manner. Most existing multicast algorithms have been developed for non-wireless, stationary networks in which there is an abundance of bandwidth and where intended destinations initiate their connection to the multicast tree. In the Digital Battlefield of the future, bandwidth may be limited if not scarce and, in addition to destination-initiated connections, there will be purely source-initiated multicasts that correspond to typical command or reconnaissance messages. In this paper, we establish the beginnings of a complete multicast algorithm that is capable of adapting to topological changes. More importantly, the algorithm is combined with dynamic channel allocation procedures that are capable of reassigning bandwidth resources on an as-needed basis throughout the network. Power control is applied to tradeoff between routing delays and number of connection requests satisfied. The goal of the algorithm is to establish and maintain the maximum number of connection requests while making efficient use of available bandwidth and avoiding congestion which might lead to network collapse.en-USmulticastroutingpower contentionfrequencyIntelligent Signal ProcessingCommunications SystemsTechnical Report