Throughput analysis in wireless networks with multiple users and multiple channels

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.

[1]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  M. Andrews,et al.  Scheduling Over Nonstationary Wireless Channels With Finite Rate Sets , 2006, IEEE/ACM Transactions on Networking.

[4]  Leandros Tassiulas,et al.  Exploiting wireless channel State information for throughput maximization , 2004, IEEE Trans. Inf. Theory.

[5]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[6]  Erol Gelenbe,et al.  The stability problem of broadcast packet switching computer networks , 1974, Acta Informatica.

[7]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[8]  Lisa Zhang,et al.  Scheduling over a time-varying user-dependent channel with applications to high speed wireless data , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[9]  Lisa Zhang,et al.  Scheduling over non-stationary wireless channels with finite rate sets , 2004, INFOCOM.

[10]  Branimir R. Vojcic,et al.  The Cdma2000 System for Mobile Communications: 3g Wireless Evolution , 2004 .

[11]  P. Spreij Probability and Measure , 1996 .

[12]  Erol Gelenbe,et al.  Stability and Optimal Control of the Packet Switching Broadcast Channel , 1977, JACM.

[13]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[14]  Robert W. Heath,et al.  Adaptive modulation and MIMO coding for broadband wireless data networks , 2002, IEEE Commun. Mag..