Throughput analysis in wireless networks with multiple users and multiple channels

Authors:
Amrinder Arora;Fanchun Jin;Gokhan Sahin;Hosam Mahmoud;Hyeong-Ah Choi
Affiliations:
Department of Computer Science, George Washington University, 20052, Washington, DC, USA;Department of Computer Science, George Washington University, 20052, Washington, DC, USA;Electrical and Computer Engineering, Miami University, 45056, Oxford, OH, USA;Department of Statistics, George Washington University, 20052, Washington, DC, USA;Department of Computer Science, George Washington University, 20052, Washington, DC, USA
Venue:
Acta Informatica
Year:
2006

Citing 0
Cited 3

New Algorithms for Online Rectangle Filling with k-Lookahead

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Online rectangle filling

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
New algorithms for online rectangle filling with k-lookahead

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.