Abstract
We study the online rectangle filling problem which arises in channel aware scheduling of wireless networks, and present improved deterministic and first known 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. 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 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.
This research was supported in part by NSF under Grant CCF-0515203.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andrews, M., Zhang, L.: Scheduling over a Time-varying User-dependent Channel with Applications to High Speed Wireless Data. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 293–302 (2002)
Arora, A., Choi, H.: Channel Aware Scheduling in Wireless Networks. Technical Report 002, George Washington University (2006)
Arora, A., Jin, F., Choi, H.: Scheduling Resource Allocation with Timeslot Penalty for Changeover. Theoretical Computer Science 369(1-3), 323–337 (2006)
Arora, A., Jin, F., Sahin, G., Mahmoud, H., Choi, H.: Throughput Analysis in Wireless Networks with Multiple Users and Multiple Channels. Acta Informatica 43(3), 147–164 (2006)
Borodin, A., EI-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Borst, S.: User-level Performance of Channel-aware Scheduling Algorithms in Wireless Data Networks. In: Proceedings of IEEE INFOCOM 2003, pp. 321–331 (2003)
Catreux, S., Erceg, V., Gesbert, D., Heath, R.: Adaptive Modulation and MIMO Coding for Broadband Wireless Data Networks. IEEE Communications Magazine 40, 108–115 (2002)
Sahin, G., Jin, F., Arora, A., Choi, H.: Predictive Scheduling in Multi-carrier Wireless Networks with Link Adaptation. In: Proceedings of 60th Vehicular Technology Conference (VTC2004-Fall), vol. 7, pp. 5015–5020 (2004)
Stallings, W.: Wireless Communication & Networks. 1st edn. Prentice Hall, Englewood Cliffs (2001)
Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting Wireless Channel State Information for Throughput Maximization. In: Proceedings of IEEE INFOCOM 2003, pp. 301–310 (2003)
Wang, H., Chaudhary, A., Chen, D.Z.: Online Rectangle Filling. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 274–287. Springer, Heidelberg (2008)
Wang, H., Chaudhary, A., Chen, D.Z.: New Algorithms for Online Rectangle Filling with k-Lookahead (2008) (manuscript)
Yao, A.: Probabilistic Computations: Toward a Unified Measure of Complexity. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227 (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Chaudhary, A., Chen, D.Z. (2008). New Algorithms for Online Rectangle Filling with k-Lookahead. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)