6. Conclusions and Future Work

In this paper, we consider the minimum power multicasting problem in ad hoc wireless networks with delay bound constraints. A combinatorial search algorithm FBS is developed and benchmarked against a modified version of a well-known heuristic developed originally for minimum power broadcasting. Our initial computational results are promising for FBS.

The performance of our search algorithm depends critically on a local priority rule, and we plan to devise more effective rules. In addition, power consumption for reception and processing may be incorporated for a more realistic model as we indicate in Sect. 3. Other important extensions include designing a distributed algorithm and exploring the trade off between transmission rates and delays.