A novel optimization-based approach for minimum power multicast in wireless networks
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...
Saved in:
Published in | Journal of communications and networks Vol. 13; no. 1; pp. 26 - 31 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Séoul
Editorial Department of Journal of Communications and Networks
01.02.2011
Korean Institute of Communication Sciences 한국통신학회 |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | G704-000784.2011.13.1.010 |
ISSN: | 1229-2370 1976-5541 |
DOI: | 10.1109/JCN.2011.6157248 |