By Topic

A novel optimization-based approach for minimum power multicast in wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hong-Hsu Yen ; Dept. of Inf. Manage., Shih-Hsin Univ., Taipei, Taiwan ; Lee, S.S.W. ; Yap, F.G.H.

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 pro- posed approach outperforms the existing approaches for broadcast, multicast, and unicast communications.

Published in:

Communications and Networks, Journal of  (Volume:13 ,  Issue: 1 )