Online computation and competitive analysis
Online computation and competitive analysis
Wireless Communications and Networks
Wireless Communications and Networks
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Scheduling resource allocation with timeslot penalty for changeover
Theoretical Computer Science
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Adaptive modulation and MIMO coding for broadband wireless data networks
IEEE Communications Magazine
An improved algorithm for online rectangle filling
Theoretical Computer Science
Semi-online scheduling with two GoS levels and unit processing time
Theoretical Computer Science
| Hi-index | 0.00 |
We study the online rectangle filling problem which arises in channel aware scheduling of wireless networks, and present deterministic and randomized results for algorithms that are allowed a k-lookahead for k驴2. Our main result is a deterministic min驴{1.848,1+2/(k驴1)}-competitive online algorithm. This is the first algorithm for this problem with a competitive ratio approaching 1 as k approaches +驴. The previous best-known solution for this problem has a competitive ratio of 2 for any k驴2. We also present a randomized online algorithm with a competitive ratio of 1+1/(k+1). Our final result is a closely matching lower bound (also proved in this paper) of $1+1/(\sqrt{k+2}+\sqrt{k+1})^{2}1+1/(4(k+2))$ on the competitive ratio of any randomized online algorithm against an oblivious adversary. These are the first known results for randomized algorithms for this problem.