Skip to Main Content
We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity O(n2) is an improvement of the existed multicast algorithms. At the end of the paper, we give an example to show the improvement on three representative algorithms by our LBGA.