In this paper, we formulate the minimum power multicast problem in wireless networks as a mixed integer linear programming problem and then propose a Lagrangean relaxation based algorithm to solve this problem. By leveraging on the information from th...
In this paper, we formulate the minimum power multicast problem in wireless networks as a mixed integer linear programming problem and then propose a Lagrangean relaxation based algorithm to solve this problem. By leveraging on the information from the Lagrangean multiplier, we could construct more power efficient routing paths. Numerical results demonstrate that the proposed approach outperforms the existing approaches for broadcast, multicast, and unicast communications.