DocumentCode
1606275
Title
Proactive earliest due-date scheduling in wireless packet networks
Author
Teh, Keng-Hoe ; Kong, Peng-Yong ; Jiang, Shengming
Author_Institution
Inst. forCommun. Res., Tele Tech Park, Singapore
Volume
2
fYear
2003
Firstpage
816
Abstract
Providing deadline-based scheduling in wireless networks is a challenging problem because the medium suffers from location-dependent errors. In this paper, we propose a new scheduling policy called proactive earliest due-date (PEDD) that proactively modifies the packets´ deadline depending on the upcoming changes in the channel states. This policy gives a higher priority to packets that will see bad channel states so that they can be scheduled before their channels turn bad. Simulation results using OPNET show that our scheme can achieve lower average packet drop ratio and higher average system throughput compared to feasible earliest due-date (FEDD). Although its average system delay is higher, it still provides delay bound guarantee that is vital for scheduling real-time traffic. The performance improvements of PEDD over FEDD will depend on how well the channel knowledge is obtained.
Keywords
packet radio networks; scheduling; telecommunication channels; telecommunication traffic; FEDD scheduling; OPNET; PEDD scheduling; average packet drop ratio; average system throughput; channel knowledge; channel state prediction scheme; deadline adjustment; delay bound guarantee; feasible earliest due-date; proactive earliest due-date; real-time traffic; wireless packet networks; Channel state information; Delay systems; Explosives; Intelligent networks; Queueing analysis; Real time systems; Telecommunication traffic; Throughput; Traffic control; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Technology Proceedings, 2003. ICCT 2003. International Conference on
Print_ISBN
7-5635-0686-1
Type
conf
DOI
10.1109/ICCT.2003.1209659
Filename
1209659
Link To Document