Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Power consumption in packet radio networks
Theoretical Computer Science
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Maximum Lifetime Broadcasting in Wireless Networks
IEEE Transactions on Computers
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science
3-Dimensional minimum energy broadcasting problem
Ad Hoc Networks
On construction of minimum energy k-fault resistant topologies
Ad Hoc Networks
OPAIMS: open architecture precision agriculture information monitoring system
CASES '09 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
3-D minimum energy broadcasting
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node-Weighted Connected Dominating Set. We also show that an important special instance of the problem can be solved in polynomial time, solving an open problem of Clementi et al. [2].