A Modified Priority Scheduling Algorithm with Link Adaptation for Wireless Multimedia Networks

Ju-Ya CHEN  Hsuan-Chang LEE  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E92-A   No.9   pp.2360-2365
Publication Date: 2009/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E92.A.2360
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Mobile Information Network and Personal Communications
Keyword: 
scheduling algorithm,  static priority,  link adaptation,  

Full Text: PDF(661.3KB)>>
Buy this Article




Summary: 
Scheduling algorithms are crucial in radio resource management especially for multimedia networks. Many scheduling algorithms are based on the assumption of error-free connections, which is not suitable for wireless networks. Therefore, a scheduling algorithm based on the modification of Static Priority (SP) algorithm and Earliest-Due-Date (EDD) algorithm is proposed for wireless multimedia networks with link adaptation in this paper. In the proposed algorithm, various quality of service requirements, such as delay, throughput, and packet loss ratio, are considered. Particularly, the influence of error tolerance of voice communications, which is usually ignored in most scheduling algorithms, is taken into account. Simulation results show that the proposed algorithm, compared with SP, EDD, and other scheduling algorithms, succeeds in meeting the delay and packet loss ratio (PLR) requirements at much heavier traffic load.