File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TVT.2008.2009874
- Scopus: eid_2-s2.0-66449111610
- WOS: WOS:000267436200010
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A low-complexity QoS-aware proportional fair multicarrier scheduling algorithm for OFDM systems
Title | A low-complexity QoS-aware proportional fair multicarrier scheduling algorithm for OFDM systems |
---|---|
Authors | |
Keywords | Cross-Layer Design Orthogonal Frequency-Division Multiplexing (Ofdm) Systems Packet Scheduling Proportional Fairness (Pf) Quality Of Service (Qos) |
Issue Date | 2009 |
Publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25 |
Citation | Ieee Transactions On Vehicular Technology, 2009, v. 58 n. 5, p. 2225-2235 How to Cite? |
Abstract | Orthogonal frequency-division multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judicious packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM systems, the applicability and performance of traditional wireless packet-scheduling algorithms, which are usually designed for single-carrier systems, are largely unknown. In this paper, we propose a new quality-of-service (QoS)-aware proportional fairness (QPF) packet-scheduling policy with low complexity for the downlink of multiuser OFDM systems to allocate radio resources among users. Our proposed algorithm is based on a cross-layer design in that the scheduler is aware of both the channel (i.e., physical layer) and the queue state (i.e., data link layer) information to achieve proportional fairness while maximizing each user's packet-level QoS performance. The simulation results show that the proposed QPF algorithm is efficient in terms of average system throughput, packet-dropping probability, and packet delay, while maintaining adequate fairness among users with relatively low scheduling overhead. © 2009 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/155520 |
ISSN | 2023 Impact Factor: 6.1 2023 SCImago Journal Rankings: 2.714 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kong, Z | en_US |
dc.contributor.author | Kwok, YK | en_US |
dc.contributor.author | Wang, J | en_US |
dc.date.accessioned | 2012-08-08T08:33:54Z | - |
dc.date.available | 2012-08-08T08:33:54Z | - |
dc.date.issued | 2009 | en_US |
dc.identifier.citation | Ieee Transactions On Vehicular Technology, 2009, v. 58 n. 5, p. 2225-2235 | en_US |
dc.identifier.issn | 0018-9545 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155520 | - |
dc.description.abstract | Orthogonal frequency-division multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judicious packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM systems, the applicability and performance of traditional wireless packet-scheduling algorithms, which are usually designed for single-carrier systems, are largely unknown. In this paper, we propose a new quality-of-service (QoS)-aware proportional fairness (QPF) packet-scheduling policy with low complexity for the downlink of multiuser OFDM systems to allocate radio resources among users. Our proposed algorithm is based on a cross-layer design in that the scheduler is aware of both the channel (i.e., physical layer) and the queue state (i.e., data link layer) information to achieve proportional fairness while maximizing each user's packet-level QoS performance. The simulation results show that the proposed QPF algorithm is efficient in terms of average system throughput, packet-dropping probability, and packet delay, while maintaining adequate fairness among users with relatively low scheduling overhead. © 2009 IEEE. | en_US |
dc.language | eng | en_US |
dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25 | en_US |
dc.relation.ispartof | IEEE Transactions on Vehicular Technology | en_US |
dc.rights | ©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Cross-Layer Design | en_US |
dc.subject | Orthogonal Frequency-Division Multiplexing (Ofdm) Systems | en_US |
dc.subject | Packet Scheduling | en_US |
dc.subject | Proportional Fairness (Pf) | en_US |
dc.subject | Quality Of Service (Qos) | en_US |
dc.title | A low-complexity QoS-aware proportional fair multicarrier scheduling algorithm for OFDM systems | en_US |
dc.type | Article | en_US |
dc.identifier.email | Kwok, YK:ykwok@eee.hku.hk | en_US |
dc.identifier.authority | Kwok, YK=rp00128 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/TVT.2008.2009874 | en_US |
dc.identifier.scopus | eid_2-s2.0-66449111610 | en_US |
dc.identifier.hkuros | 161702 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-66449111610&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 58 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.spage | 2225 | en_US |
dc.identifier.epage | 2235 | en_US |
dc.identifier.isi | WOS:000267436200010 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Kong, Z=7006536683 | en_US |
dc.identifier.scopusauthorid | Kwok, YK=7101857718 | en_US |
dc.identifier.scopusauthorid | Wang, J=11439898400 | en_US |
dc.identifier.issnl | 0018-9545 | - |