Acta Informatica

, Volume 43, Issue 3, pp 147–164 | Cite as

Throughput analysis in wireless networks with multiple users and multiple channels

  • Amrinder Arora
  • Fanchun Jin
  • Gokhan Sahin
  • Hosam MahmoudEmail author
  • Hyeong-Ah Choi
Original Article


We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in multiple user and multiple channel environment under the practicable lookahead prediction of one time slot. Secondly, the presented algorithms and heuristics are shown to be competitive by deterministic and probabilistic analyses. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement.


Wireless Network Time Slot Mobile Station Competitive Ratio Online Algorithm 
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 symposium on foundations of computer science, pp. 293–302. Newyork: IEEE Computer Society (2002)Google Scholar
  2. 2.
    Andrews, M., Zhang, L.: Scheduling over non-stationary wireless channels with finite rate sets. In: IEEE INFOCOM 2004–The Conference on Computer Communications, vol. 23:1, pp. 1695–1705 (2004)Google Scholar
  3. 3.
    Arora, A., Choi, H.: Channel aware scheduling for throughput maximization. Submitted. Also available at Scholar
  4. 4.
    Billingsley P.(1986): Probability and Measure. New York, WileyzbMATHGoogle Scholar
  5. 5.
    Catreux S., Erceg V., Gesbert D., Heath R.(2002). Adaptive modulation and MIMO coding for broadband wireless data networks. IEEE Communications Magazine 40, 108–115CrossRefGoogle Scholar
  6. 6.
    Fayolle G., Gelenbe E., Labetoulle J.(1977). Stability and optimal control of the packet switching broadcast channel. Journal ACM 24(3): 375–386zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Fayolle G., Gelenbe E., Labetoulle J., Bastin D.(1974). The stability problem of broadcast packet switching networks. Acta Informatica 4, 49–53zbMATHCrossRefGoogle Scholar
  8. 8.
    Garey M., Johnson D. (1979). Computers and intractability–a guide to the theory of NP-completeness. San Francisco, FreemanzbMATHGoogle Scholar
  9. 9.
    Goldberg A.V., Tarjan R.E.(1988). A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921–940zbMATHMathSciNetGoogle Scholar
  10. 10.
    Hopcroft J.E., Karp R.M.(1973). An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4): 225–231zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting wireless channel state information for throughput maximization. In: Proceedings of IEEE Infocom ’03, pp. 301–310 (2003)Google Scholar
  12. 12.
    Vanghi V., Damnjanovic A., Vojcic B.(2004). The CDMA2000 system for mobile communication. Upper Saddle River, Prentince Hall PTRGoogle Scholar

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  • Amrinder Arora
    • 1
  • Fanchun Jin
    • 1
  • Gokhan Sahin
    • 2
  • Hosam Mahmoud
    • 3
    Email author
  • Hyeong-Ah Choi
    • 1
  1. 1.Department of Computer ScienceGeorge Washington UniversityWashingtonUSA
  2. 2.Electrical and Computer EngineeringMiami UniversityOxfordUSA
  3. 3.Department of StatisticsGeorge Washington UniversityWashingtonUSA

Personalised recommendations