Abstract
Energy efficient multicast routing has been a blooming research field in wireless networks. However, this kind of multicast routing only addresses the transmission radius coverage might not be able to meet the bandwidth requirement of the users. In this paper, for the first time, we address the bandwidth aware minimum power multicast routing problem in wireless networks. We first formulate this problem as a mixed integer linear programming problem and then propose a Lagrangean relaxation based algorithm to solve this problem. Numerical results demonstrate that the proposed approach outperforms the existing pure power efficient multicast routing approaches under all tested cases, especially in large bandwidth request and fine radius granularity.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
