No Detail Found!

Link Aware Earliest Deadline Scheduling Algorithm for WiMAX

Author(s)
D. S. Shu’aibu Department of Radio Communication, Faculty of Electrical Engineering, Universiti Teknologi Malaysia
S. K. Syed-Yusof Department of Radio Communication, Faculty of Electrical Engineering, Universiti Teknologi Malaysia
Abstract
Allocating slots dynamically to the service flows in heterogeneous wireless network is highly complex and non-linear. Since the link quality is continuously changing, a wireless network employing adaptive modulation like WiMAX, allocating slot in such network is based on the link quality. In this paper, we present link aware packet scheduling algorithm using packet’s earliest deadline and buffer status called LAEDF, the proposed algorithm is suitable for service flows in WiMAX. The wireless link is estimated based on computed total path loss between the subscriber station (SS) and the base station for each scheduling packet. The simulation shows that the proposed algorithm has achieved higher throughput with fairness among service flows when compared with fixed modulation earliest deadline scheduling algorithm (FMEDF).
Publication Details
Page(s) 83-88
DOI DOI not available
Published Journal: International Journal of Communication Networks and Information Security, Volume: 3, Issue: 1, Year: 2011

Request the full text from PASTIC

0

Citations

0

Downloads

60

Views