Date Added: Oct 2009
In this paper, the authors study the problem of join routing and scheduling of multi-team data flows multicasting in wireless multirate multi-hop networks with the objective of minimizing the time required to complete the transmission transactions. They prove in this paper that the optimal join routing and scheduling problem is NP-hard. Instead of trying to solve the optimization problem, they reformulate the problem into an intuitive form which provides intuitions to achieve optimal solution. Base on these observations, they propose a heuristic algorithm that locally optimally chooses multicast relays and multicast rates. The aim is to locally minimize the schedule time length within two-hop range so that the total transmission time approaches optimal.