On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Scheduling Broadcasts in Wireless Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Comparison of Multicast Pull Models
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Goodput Analysis and Link Adaptation for IEEE 802.11a Wireless LANs
IEEE Transactions on Mobile Computing
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Improved approximation algorithms for broadcast scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On broadcast scheduling with limited energy
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Energy-efficient windows scheduling
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
| Hi-index | 0.00 |
We consider the problem of computing broadcast schedules for a speed-controlled channel minimizing overall energy consumption. Each request defines a strict deadline and we assume that sending at some speed s for t time units consumes energy tsα. For the case that the server holds a single message and the speed of a broadcast needs to be fixed when it is started, we present an $\mathcal{O}(2^{\alpha})$-competitive deterministic online algorithm and prove that this is asymptotically best possible even allowing randomization. For the multi-message case we prove that an extension of our algorithm is (4c–1)α-competitive if the lengths of requests vary by at most a factor of c. Allowing the speed of running broadcasts to be changed, we give lower bounds that are still exponential in α.