Link Aware Earliest Deadline Scheduling Algorithm for WiMAX
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, the author’s present link aware packet scheduling algorithm using packet’s earliest deadline and buffer status called LAEDF (Link Aware Earliest Deadline First scheduling algorithm), 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.
Subscribe to the Developer Insider Newsletter
From the hottest programming languages to commentary on the Linux OS, get the developer and open source news and tips you need to know. Delivered Tuesdays and Thursdays