Advertisement

Optimized Channel Utilization in Multi-carrier Wireless Mobile Networks

  • Amrinder Arora
  • Fanchun Jin
  • Hyeong-Ah Choi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)

Abstract

This paper considers the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. The contributions of this paper are the following. We explicitly consider the time-penalty induced by the transmission-mode changes in wireless networks. We study the trade-offs between the channel-state prediction quality and the throughput. We provide sound offline problem analysis, with optimal or approximate solutions to the extent possible. We consider online version of the wireless channel scheduling problem, and provide a lower bound and propose algorithms that guarantee competitive ratios. We also extend our algorithms to accommodate the model when the actual channel capacity is different from as predicted earlier. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement, with only marginal gains through further enhancement of the prediction quality.

Keywords

Wireless networks link adaptation throughput maximization offline optimal algorithm online scheduling competitive ratio predictive scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Catreux, S., Erceg, V., Gesbert, D., Heath, R.W.: Adaptive modulation and MIMO coding for broadband wireless data networks. IEEE Communications Magazine 40, 108–115 (2002)CrossRefGoogle Scholar
  2. 2.
    Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting wireless channel state information for throughput maximization. In: Proceedings of IEEE Infocom 2003, April 2003, pp. 301–310 (2003)Google Scholar
  3. 3.
    Kulkarni, S., Rosenberg, C.: Opportunistic scheduling policies for wireless systems with short term fairness constraints. In: Proceedings of Globecom 2003, December 1992, pp. 533–537 (1992)Google Scholar
  4. 4.
    Liu, X., Chong, E.K.P., Shroff, N.: Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE JSAC 19(10), 2053–2064 (2001)Google Scholar
  5. 5.
    Keller, T., Hanzo, L.: Adaptive multicarrier modulation: a convenient framework for time-frequency processing in wireless communications. In: Proceedings of the IEEE, vol. 88, pp. 1369–1394 (1990)Google Scholar
  6. 6.
    Arora, A., Choi, H.A.: Channel aware scheduling in wireless networks,Tech. Rep. 002, The George Washington University (2006)Google Scholar
  7. 7.
    Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225–231 (1973)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Amrinder Arora
    • 1
  • Fanchun Jin
    • 1
  • Hyeong-Ah Choi
    • 1
  1. 1.Dept. of Computer ScienceGeorge Washington UniversityWashington DCUSA

Personalised recommendations