The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Les algorithmes de planification sont cruciaux dans la gestion des ressources radio, en particulier pour les réseaux multimédias. De nombreux algorithmes de planification reposent sur l’hypothèse de connexions sans erreur, ce qui n’est pas adapté aux réseaux sans fil. Par conséquent, un algorithme de planification basé sur la modification de l'algorithme de priorité statique (SP) et de l'algorithme de date d'échéance la plus précoce (EDD) est proposé pour les réseaux multimédia sans fil avec adaptation de liaison dans cet article. Dans l'algorithme proposé, diverses exigences de qualité de service, telles que le délai, le débit et le taux de perte de paquets, sont prises en compte. En particulier, l'influence de la tolérance aux erreurs des communications vocales, qui est généralement ignorée dans la plupart des algorithmes de planification, est prise en compte. Les résultats de la simulation montrent que l'algorithme proposé, comparé à SP, EDD et à d'autres algorithmes de planification, réussit à répondre aux exigences de délai et de taux de perte de paquets (PLR) avec une charge de trafic beaucoup plus importante.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Ju-Ya CHEN, Hsuan-Chang LEE, "A Modified Priority Scheduling Algorithm with Link Adaptation for Wireless Multimedia Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 9, pp. 2360-2365, September 2009, doi: 10.1587/transfun.E92.A.2360.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2360/_p
Copier
@ARTICLE{e92-a_9_2360,
author={Ju-Ya CHEN, Hsuan-Chang LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Modified Priority Scheduling Algorithm with Link Adaptation for Wireless Multimedia Networks},
year={2009},
volume={E92-A},
number={9},
pages={2360-2365},
abstract={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.},
keywords={},
doi={10.1587/transfun.E92.A.2360},
ISSN={1745-1337},
month={September},}
Copier
TY - JOUR
TI - A Modified Priority Scheduling Algorithm with Link Adaptation for Wireless Multimedia Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2360
EP - 2365
AU - Ju-Ya CHEN
AU - Hsuan-Chang LEE
PY - 2009
DO - 10.1587/transfun.E92.A.2360
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2009
AB - 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.
ER -