Date Added: Aug 2010
Efficiently transmitting data in wireless networks requires joint optimization of routing, scheduling, and power control. Also, transmitting data to multiple destinations (multicasting) in an optimal way typically involves the solution of difficult combinatorial optimization problems. To avoid such difficulties, the authors use the concept of network coding to design an optimization problem for the problem of transmitting multiple multicast messages through a time-slotted multi-hop wireless network whilst allowing multipath routing. Apart from the mathematical model, they introduce a block co-ordinate descent algorithm that uses information about active constraints and the decoupled nature of the problem, and prove its convergence to a global optimum under certain assumptions.