A heuristic scheduling algorithm for 1xEV-DO-like systems

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a simple heuristic scheduling algorithm for common shared channels for 1xEV-DO-like systems. The proposed scheme utilizes both information on the channel conditions of each user and information on queue status of base station. Through simulation results, we show that the performances of the proposed algorithm outperform those of conventional scheduling algorithms as the maximum tolerable delay is more lightened. For a fixed value of the maximum tolerable delay requirement, the proposed algorithm also can reinforce QoS guarantee ability such as average delay-outage probability specially in the light traffic load. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Koo, I., Shin, S., & Kim, K. (2004). A heuristic scheduling algorithm for 1xEV-DO-like systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3079, 885–893. https://doi.org/10.1007/978-3-540-25969-5_82

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