DocumentCode
390308
Title
A wireless fair scheduling algorithm supporting CoS
Author
Song, Jian ; Li, Lemin ; Han, James J.
Author_Institution
Inst. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Volume
1
fYear
2002
fDate
29 June-1 July 2002
Firstpage
428
Abstract
Fair packet scheduling in the wireless networks poses significant challenges due to unique issues in the wireless channel such as limited bandwidth, location-dependent and bursty and high channel errors. We propose a fair scheduling algorithm called CoSB-WFS (class of service based wireless fair scheduling) to support QoS demands of different classes of services in wireless networks. It uses the CoS index to distinguish different application level services and can use different queueing strategies for each CoS. We propose a compensation strategy in the algorithm to achieve wireless fair services. We build a simple model of the algorithm in OPNET and present simulation results to show the performance improvements.
Keywords
bandwidth allocation; land mobile radio; packet radio networks; quality of service; queueing theory; telecommunication traffic; 2.5G technology; 3G technology; CoS; OPNET; QoS; bandwidth allocating policy; bursty channel errors; class of service; compensation strategy; fair packet scheduling; high channel errors; limited bandwidth; location-dependent channel errors; packet switched wireless networks; queueing; simulation results; wireless channel; wireless fair scheduling algorithm; Bluetooth; Cellular networks; IP networks; Job shop scheduling; Quality of service; Scheduling algorithm; Telecommunication traffic; Telephone sets; Web and internet services; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on
Print_ISBN
0-7803-7547-5
Type
conf
DOI
10.1109/ICCCAS.2002.1180653
Filename
1180653
Link To Document