Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks
Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated,...
Gespeichert in:
Veröffentlicht in: | IEEE journal on selected areas in communications 2009-02, Vol.27 (2), p.226-234 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 234 |
---|---|
container_issue | 2 |
container_start_page | 226 |
container_title | IEEE journal on selected areas in communications |
container_volume | 27 |
creator | Huang, J. Subramanian, V.G. Agrawal, R. Berry, R. |
description | Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations. |
doi_str_mv | 10.1109/JSAC.2009.090213 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_JSAC_2009_090213</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4769397</ieee_id><sourcerecordid>875033834</sourcerecordid><originalsourceid>FETCH-LOGICAL-c428t-6bdc166d7ed4b4316b5b9c41152ac62b436e063ef1152cf500dfe4579f24c7353</originalsourceid><addsrcrecordid>eNp90U1P3DAQBmALtVK3lHslLhYH2kuW8Xd8RFtoi0AcaM-W40xKIBsvdiLEv8fRVj30wGmk0fNa8ryEfGawZgzs2dXd-WbNAewaLHAmDsiKKVVXAFC_IyswQlS1YfoD-ZjzAwCTsuYr0l3FfpxoDvfYzkM__qF-bGnCHOcUkPphiMFPfRxpP9J5V8Qjvb38dkPzS55wm2kXE21S9G2zBJ_7hAPmTH0Iyxhxeo7pMX8i7zs_ZDz6Ow_J78uLX5sf1fXt95-b8-sqSF5PlW7awLRuDbaykYLpRjU2SMYU90HzstIIWmC3bEKnANoOpTK24zIYocQh-bJ_d5fi04x5cts-BxwGP2Kcs6uNAiFqIYs8fVMKqUBKKwr8-iZk2jDOLdNQ6Ml_9KGccSwfdrUyUphy8oJgj0KKOSfs3C71W59eHAO3VOmWKt1SpdtXWSLH-0iPiP-4NNoKa8Qrg_KZsg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>857437482</pqid></control><display><type>article</type><title>Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks</title><source>IEEE Electronic Library (IEL)</source><creator>Huang, J. ; Subramanian, V.G. ; Agrawal, R. ; Berry, R.</creator><creatorcontrib>Huang, J. ; Subramanian, V.G. ; Agrawal, R. ; Berry, R.</creatorcontrib><description>Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2009.090213</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Bandwidth ; Broadband ; Complexity ; dual decomposition ; Dynamic scheduling ; Dynamical systems ; Dynamics ; Heuristic ; Long Term Evolution ; Mathematical models ; OFDM ; optimization ; Orthogonal Frequency Division Multiplexing ; Orthogonal Frequency Division Multiplexing (OFDM) ; Physical layer ; Power system modeling ; Quality of service ; Resource allocation ; Resource management ; Scheduling ; Studies ; uplink communications ; WiMAX ; Wireless networks</subject><ispartof>IEEE journal on selected areas in communications, 2009-02, Vol.27 (2), p.226-234</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c428t-6bdc166d7ed4b4316b5b9c41152ac62b436e063ef1152cf500dfe4579f24c7353</citedby><cites>FETCH-LOGICAL-c428t-6bdc166d7ed4b4316b5b9c41152ac62b436e063ef1152cf500dfe4579f24c7353</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4769397$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4769397$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Huang, J.</creatorcontrib><creatorcontrib>Subramanian, V.G.</creatorcontrib><creatorcontrib>Agrawal, R.</creatorcontrib><creatorcontrib>Berry, R.</creatorcontrib><title>Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.</description><subject>Algorithms</subject><subject>Bandwidth</subject><subject>Broadband</subject><subject>Complexity</subject><subject>dual decomposition</subject><subject>Dynamic scheduling</subject><subject>Dynamical systems</subject><subject>Dynamics</subject><subject>Heuristic</subject><subject>Long Term Evolution</subject><subject>Mathematical models</subject><subject>OFDM</subject><subject>optimization</subject><subject>Orthogonal Frequency Division Multiplexing</subject><subject>Orthogonal Frequency Division Multiplexing (OFDM)</subject><subject>Physical layer</subject><subject>Power system modeling</subject><subject>Quality of service</subject><subject>Resource allocation</subject><subject>Resource management</subject><subject>Scheduling</subject><subject>Studies</subject><subject>uplink communications</subject><subject>WiMAX</subject><subject>Wireless networks</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90U1P3DAQBmALtVK3lHslLhYH2kuW8Xd8RFtoi0AcaM-W40xKIBsvdiLEv8fRVj30wGmk0fNa8ryEfGawZgzs2dXd-WbNAewaLHAmDsiKKVVXAFC_IyswQlS1YfoD-ZjzAwCTsuYr0l3FfpxoDvfYzkM__qF-bGnCHOcUkPphiMFPfRxpP9J5V8Qjvb38dkPzS55wm2kXE21S9G2zBJ_7hAPmTH0Iyxhxeo7pMX8i7zs_ZDz6Ow_J78uLX5sf1fXt95-b8-sqSF5PlW7awLRuDbaykYLpRjU2SMYU90HzstIIWmC3bEKnANoOpTK24zIYocQh-bJ_d5fi04x5cts-BxwGP2Kcs6uNAiFqIYs8fVMKqUBKKwr8-iZk2jDOLdNQ6Ml_9KGccSwfdrUyUphy8oJgj0KKOSfs3C71W59eHAO3VOmWKt1SpdtXWSLH-0iPiP-4NNoKa8Qrg_KZsg</recordid><startdate>20090201</startdate><enddate>20090201</enddate><creator>Huang, J.</creator><creator>Subramanian, V.G.</creator><creator>Agrawal, R.</creator><creator>Berry, R.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20090201</creationdate><title>Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks</title><author>Huang, J. ; Subramanian, V.G. ; Agrawal, R. ; Berry, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c428t-6bdc166d7ed4b4316b5b9c41152ac62b436e063ef1152cf500dfe4579f24c7353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Bandwidth</topic><topic>Broadband</topic><topic>Complexity</topic><topic>dual decomposition</topic><topic>Dynamic scheduling</topic><topic>Dynamical systems</topic><topic>Dynamics</topic><topic>Heuristic</topic><topic>Long Term Evolution</topic><topic>Mathematical models</topic><topic>OFDM</topic><topic>optimization</topic><topic>Orthogonal Frequency Division Multiplexing</topic><topic>Orthogonal Frequency Division Multiplexing (OFDM)</topic><topic>Physical layer</topic><topic>Power system modeling</topic><topic>Quality of service</topic><topic>Resource allocation</topic><topic>Resource management</topic><topic>Scheduling</topic><topic>Studies</topic><topic>uplink communications</topic><topic>WiMAX</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huang, J.</creatorcontrib><creatorcontrib>Subramanian, V.G.</creatorcontrib><creatorcontrib>Agrawal, R.</creatorcontrib><creatorcontrib>Berry, R.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Huang, J.</au><au>Subramanian, V.G.</au><au>Agrawal, R.</au><au>Berry, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2009-02-01</date><risdate>2009</risdate><volume>27</volume><issue>2</issue><spage>226</spage><epage>234</epage><pages>226-234</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2009.090213</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0733-8716 |
ispartof | IEEE journal on selected areas in communications, 2009-02, Vol.27 (2), p.226-234 |
issn | 0733-8716 1558-0008 |
language | eng |
recordid | cdi_crossref_primary_10_1109_JSAC_2009_090213 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Bandwidth Broadband Complexity dual decomposition Dynamic scheduling Dynamical systems Dynamics Heuristic Long Term Evolution Mathematical models OFDM optimization Orthogonal Frequency Division Multiplexing Orthogonal Frequency Division Multiplexing (OFDM) Physical layer Power system modeling Quality of service Resource allocation Resource management Scheduling Studies uplink communications WiMAX Wireless networks |
title | Joint scheduling and resource allocation in uplink OFDM systems for broadband wireless access networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T18%3A19%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20scheduling%20and%20resource%20allocation%20in%20uplink%20OFDM%20systems%20for%20broadband%20wireless%20access%20networks&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Huang,%20J.&rft.date=2009-02-01&rft.volume=27&rft.issue=2&rft.spage=226&rft.epage=234&rft.pages=226-234&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2009.090213&rft_dat=%3Cproquest_RIE%3E875033834%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=857437482&rft_id=info:pmid/&rft_ieee_id=4769397&rfr_iscdi=true |