The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Power consumption in packet radio networks
Theoretical Computer Science
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
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
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Sharing the cost of multicast transmissions in wireless networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree
Mobile Networks and Applications
A framework for assessing residual energy in wireless sensor network
International Journal of Sensor Networks
Hi-index | 0.89 |
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.