New Algorithms for Online Rectangle Filling with k-Lookahead

  • Haitao Wang
  • Amitabh Chaudhary
  • Danny Z. Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)


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.


Channel Capacity Competitive Ratio Online Algorithm Zero Column Partition Column 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Arora, A., Choi, H.: Channel Aware Scheduling in Wireless Networks. Technical Report 002, George Washington University (2006)Google Scholar
  3. 3.
    Arora, A., Jin, F., Choi, H.: Scheduling Resource Allocation with Timeslot Penalty for Changeover. Theoretical Computer Science 369(1-3), 323–337 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Borodin, A., EI-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  6. 6.
    Borst, S.: User-level Performance of Channel-aware Scheduling Algorithms in Wireless Data Networks. In: Proceedings of IEEE INFOCOM 2003, pp. 321–331 (2003)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Stallings, W.: Wireless Communication & Networks. 1st edn. Prentice Hall, Englewood Cliffs (2001)Google Scholar
  10. 10.
    Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting Wireless Channel State Information for Throughput Maximization. In: Proceedings of IEEE INFOCOM 2003, pp. 301–310 (2003)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Wang, H., Chaudhary, A., Chen, D.Z.: New Algorithms for Online Rectangle Filling with k-Lookahead (2008) (manuscript)Google Scholar
  13. 13.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Haitao Wang
    • 1
  • Amitabh Chaudhary
    • 1
  • Danny Z. Chen
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Notre DameNotre DameUSA

Personalised recommendations