A new and efficient adaptive scheduling packets for the uplink traffic in WiMAX networks

13Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this article, an adaptive scheduling packets algorithm for the uplink traffic in WiMAX networks is proposed. The proposed algorithm is designed to be completely dynamic, mainly in networks that use various modulation and coding schemes (MCSs). Using a cross-layer approach and the states of the uplink virtual queues in the base station, it was defined a new deadlines-based scheme, aiming at limiting the maximum delay to the real-time applications. Moreover, a method which interacts with the polling mechanisms of the base station was developed. This method controls the periodicity of sending unicast polling to the real-time and non-real-time service classes, in accordance with the quality of service requirements of the applications. The proposed algorithm was evaluated by means of modeling and simulation in environments where various MCSs were used and also in an environment where only one type of MCS was used. The simulations showed satisfactory results in both environments.

Cite

CITATION STYLE

APA

Teixeira, M. A., & Guardieiro, P. R. (2011). A new and efficient adaptive scheduling packets for the uplink traffic in WiMAX networks. Eurasip Journal on Wireless Communications and Networking, 2011(1). https://doi.org/10.1186/1687-1499-2011-113

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free