A novel scheduling scheme for finite buffer service in time-varying channels

Liu, Fei, Xiang, Wei, Zhao, Hui, Zheng, Kan, and Long, Hang (2012) A novel scheduling scheme for finite buffer service in time-varying channels. In: Proceedings of the 14th International Conference on Communication Technology, pp. 41-45. From: 2012 ICCT: IEEE 14th International Conference on Communication Technology, 9-11 November 2012, Chengdu, China.

[img] PDF (Pubished Version) - Published Version
Restricted to Repository staff only

View at Publisher Website: http://dx.doi.org/10.1109/ICCT.2012.6511...
 
1


Abstract

In this paper, a new scheduling scheme is proposed for finite buffer services in time-varying wireless channel environments. With the proportional fair (PF) principle, we propose the use of a time factor (TF) to guarantee the stability of the system as well as shortening the average user delay. The proposed PF-TF algorithm is parametrically adjustable that can be applied under different channel conditions. Simulation results suggest that the proposed scheme is able to achieve a shorter delay than conventional algorithms.

Item ID: 43259
Item Type: Conference Item (Refereed Research Paper - E1)
Keywords: finite buffer, proportional fair, scheduling
ISBN: 978-1-4673-2100-6
Funders: National Science Foundation for Postdoctoral Scientists of China (NSF)
Projects and Grants: NSF grant no. 20110490329
Date Deposited: 24 Feb 2016 07:47
FoR Codes: 09 ENGINEERING > 0906 Electrical and Electronic Engineering > 090699 Electrical and Electronic Engineering not elsewhere classified @ 100%
SEO Codes: 89 INFORMATION AND COMMUNICATION SERVICES > 8901 Communication Networks and Services > 890199 Communication Networks and Services not elsewhere classified @ 100%
Downloads: Total: 1
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page