Please use this identifier to cite or link to this item:
Title: Proactive earliest due date packet scheduling in wireless networks
Keywords: Delay Upper Bound, Wireless Networks, Earliest Due Date, Packet Scheduling, Deadline Adjustment, Channel Knowledge Acquisition.
Issue Date: 1-Feb-2004
Citation: TEH KENG HOE (2004-02-01). Proactive earliest due date packet scheduling in wireless networks. ScholarBank@NUS Repository.
Abstract: This thesis aims to define, develop and study a novel scheduling policy to deliver real-time packets over wireless channels. Feasible earliest due date (FEDD) is reactive as it stops scheduling for a user after the channel quality turns bad. Proactive earliest due date (PEDD) that adjusts a packet's deadline in anticipation of an upcoming degradation in channel quality is proposed. Moreover, a realistic PEDD (R-PEDD) that uses a probing mechanism to acquire channel knowledge is designed. As probe packets consume bandwidth, R-PEDD+ that derives channel information from recent data packet transmissions is further proposed. Extensive simulations show that PEDD has about 30% higher system throughput and incurs about 45 times lower packet drop ratio compared to FEDD. Although R-PEDD and R-PEDD+ are only suitable when the channel changes are less rapid, simulation results indicate that both policies are capable of approximating the performance of PEDD in a realistic wireless channel.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
TehKH.pdf413.12 kBAdobe PDF



Page view(s)

checked on Oct 7, 2018


checked on Oct 7, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.