Abstract
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.
Similar content being viewed by others
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 symposium on foundations of computer science, pp. 293–302. Newyork: IEEE Computer Society (2002)
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)
Arora, A., Choi, H.: Channel aware scheduling for throughput maximization. Submitted. Also available at http://www.seas.gwu.edu/~hchoi/publication/wireless.htm
Billingsley P.(1986): Probability and Measure. New York, Wiley
Catreux S., Erceg V., Gesbert D., Heath R.(2002). Adaptive modulation and MIMO coding for broadband wireless data networks. IEEE Communications Magazine 40, 108–115
Fayolle G., Gelenbe E., Labetoulle J.(1977). Stability and optimal control of the packet switching broadcast channel. Journal ACM 24(3): 375–386
Fayolle G., Gelenbe E., Labetoulle J., Bastin D.(1974). The stability problem of broadcast packet switching networks. Acta Informatica 4, 49–53
Garey M., Johnson D. (1979). Computers and intractability–a guide to the theory of NP-completeness. San Francisco, Freeman
Goldberg A.V., Tarjan R.E.(1988). A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921–940
Hopcroft J.E., Karp R.M.(1973). An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4): 225–231
Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting wireless channel state information for throughput maximization. In: Proceedings of IEEE Infocom ’03, pp. 301–310 (2003)
Vanghi V., Damnjanovic A., Vojcic B.(2004). The CDMA2000 system for mobile communication. Upper Saddle River, Prentince Hall PTR
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Arora, A., Jin, F., Sahin, G. et al. Throughput analysis in wireless networks with multiple users and multiple channels. Acta Informatica 43, 147–164 (2006). https://doi.org/10.1007/s00236-006-0012-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-006-0012-1