Modified priority scheduling algorithm with link adaptation for wireless network

The scheduling algorithm is crucial in radio resource management, especially for multimedia networks. There are many different traffic types in multimedia networks; each traffic type needs various quality of service (QoS) requirements. Several scheduling algorithms for wired and wireless networks are based on the assumption of error-free connections. However, few scheduling algorithms consider the effect of link adaptation. A scheduling algorithm with link adaptation is proposed in this paper, based on the modification of the static priority (SP) algorithm and earliest-due-date (EDD) algorithm. Results show that the proposed algorithm, compared to the SP and EDD algorithms, succeeds in meeting the delay and packet loss ratio (PLR) requirements at a much heavier traffic load.