Minimum Energy Cost Broadcasting in Wireless Networks

[1]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[2]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[3]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[4]  Stéphane Pérennes,et al.  Improved Approximation Results for the Minimum Energy Broadcasting Problem , 2004, DIALM-POMC '04.

[5]  Peng-Jun Wan,et al.  Minimum-power multicast routing in static ad hoc wireless networks , 2004, IEEE/ACM Transactions on Networking.

[6]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[7]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[8]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[10]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Suresh Singh,et al.  Power-Aware Broadcasting in Mobile Ad Hoc Networks∗ , 1999 .

[12]  C. Raghavendra,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[13]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[14]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[15]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .