Date Added: Feb 2012
The authors study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner tree problem, and it has been widely studied before. They demonstrate in this paper, that for multi-hop wireless mesh networks, a Steiner tree does not offer the minimal bandwidth consumption, because it neglects the wireless multicast advantage. Thus, they re-formulate the problem in terms of minimizing the number of transmissions, rather than the edge cost of multicast trees. They show that the new problem is also NP-complete and they propose heuristics to compute good approximations for such bandwidth-optimal trees.