An efficient scheduling for diverse QoS requirements in WiMAX

WiMAX is one of the most important broadband wireless technologies and is anticipated to be a viable alternative to traditional wired broadband techniques due to its cost efficiency. Being an emerging technology, WiMAX supports multimedia applications such as voice over IP (VoIP), voice conference a...

Full description

Bibliographic Details
Main Author: Xiaojing, Meng
Format: Others
Language:en
Published: 2007
Subjects:
Online Access:http://hdl.handle.net/10012/2736
id ndltd-LACETR-oai-collectionscanada.gc.ca-OWTU.10012-2736
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-OWTU.10012-27362013-10-04T04:07:46ZXiaojing, Meng2007-02-22T15:11:56Z2007-02-22T15:11:56Z2007-02-22T15:11:56Z2007http://hdl.handle.net/10012/2736WiMAX is one of the most important broadband wireless technologies and is anticipated to be a viable alternative to traditional wired broadband techniques due to its cost efficiency. Being an emerging technology, WiMAX supports multimedia applications such as voice over IP (VoIP), voice conference and online gaming. It is necessary to provide Quality of Service (QoS) guaranteed with different characteristics, quite challenging, however, for Broadband Wireless Access (BWA) networks. Therefore, an effective scheduling is critical for the WiMAX system. Many traffic scheduling algorithms are available for wireless networks, e.g. Round Robin, Proportional Fairness (PF) scheme and Integrated Cross-layer scheme (ICL). Among these conventional schemes, some cannot differentiate services, while some can fulfill the service differentiation with a high-complexity implementation. This thesis proposes a novel scheduling algorithm for Orthogonal Frequency Division Multiplex/Time Division Multiple Access (OFDM/TDMA)-based systems, which extends the PF scheme to multiple service types with diverse QoS requirements. The design objective is to provide differentiated services according to their QoS requirements, while the objective can be achieved by adjusting only one unique parameter, the time window for evaluating the average throughput. By extensive simulation, it is shown that the proposed scheduling algorithm exploits the advantage of the PF scheme, enhancing the throughput, and distinguishes the services in terms of the average delay. Afterward, we prove the superiority of the new scheme over the conventional ones by showing simulation results.446279 bytesapplication/pdfenAn efficient scheduling for diverse QoS requirements in WiMAXThesis or DissertationElectrical and Computer EngineeringMaster of Applied ScienceElectrical and Computer Engineering
collection NDLTD
language en
format Others
sources NDLTD
topic Electrical and Computer Engineering
spellingShingle Electrical and Computer Engineering
Xiaojing, Meng
An efficient scheduling for diverse QoS requirements in WiMAX
description WiMAX is one of the most important broadband wireless technologies and is anticipated to be a viable alternative to traditional wired broadband techniques due to its cost efficiency. Being an emerging technology, WiMAX supports multimedia applications such as voice over IP (VoIP), voice conference and online gaming. It is necessary to provide Quality of Service (QoS) guaranteed with different characteristics, quite challenging, however, for Broadband Wireless Access (BWA) networks. Therefore, an effective scheduling is critical for the WiMAX system. Many traffic scheduling algorithms are available for wireless networks, e.g. Round Robin, Proportional Fairness (PF) scheme and Integrated Cross-layer scheme (ICL). Among these conventional schemes, some cannot differentiate services, while some can fulfill the service differentiation with a high-complexity implementation. This thesis proposes a novel scheduling algorithm for Orthogonal Frequency Division Multiplex/Time Division Multiple Access (OFDM/TDMA)-based systems, which extends the PF scheme to multiple service types with diverse QoS requirements. The design objective is to provide differentiated services according to their QoS requirements, while the objective can be achieved by adjusting only one unique parameter, the time window for evaluating the average throughput. By extensive simulation, it is shown that the proposed scheduling algorithm exploits the advantage of the PF scheme, enhancing the throughput, and distinguishes the services in terms of the average delay. Afterward, we prove the superiority of the new scheme over the conventional ones by showing simulation results.
author Xiaojing, Meng
author_facet Xiaojing, Meng
author_sort Xiaojing, Meng
title An efficient scheduling for diverse QoS requirements in WiMAX
title_short An efficient scheduling for diverse QoS requirements in WiMAX
title_full An efficient scheduling for diverse QoS requirements in WiMAX
title_fullStr An efficient scheduling for diverse QoS requirements in WiMAX
title_full_unstemmed An efficient scheduling for diverse QoS requirements in WiMAX
title_sort efficient scheduling for diverse qos requirements in wimax
publishDate 2007
url http://hdl.handle.net/10012/2736
work_keys_str_mv AT xiaojingmeng anefficientschedulingfordiverseqosrequirementsinwimax
AT xiaojingmeng efficientschedulingfordiverseqosrequirementsinwimax
_version_ 1716599626259234816