Resource allocation for the AF Multiple Access Relay Channel with OFDMA
This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to b...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 491 |
|---|---|
| container_issue | |
| container_start_page | 486 |
| container_title | |
| container_volume | |
| creator | Schedler, S. Angierski, A. Kuehn, V. |
| description | This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared. |
| doi_str_mv | 10.1109/WCNC.2012.6214415 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6214415</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6214415</ieee_id><sourcerecordid>6214415</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e72493b9a9531963bc5e830b1c57b2665271d3df8a2694b0c9fc434645bb54a83</originalsourceid><addsrcrecordid>eNo1kF1LwzAYRuMXuM39APEmf6A1b5I3bS5LtVPYHAzFy5FkKa3EdjQdsn-v4rw6Dxx4Lg4ht8BSAKbv38uXMuUMeKo4SAl4RqYgVSaYFMjPyQQQ84Qr4BdkrrP836n88tdxTAQCXJNpjB-McYZSTshi42N_GJynJoTembHtO1r3Ax0bT4uKrg5hbPfhZzvnY6QbH8yRlo3pOh_oVzs2dF09rIobclWbEP38xBl5qx5fy6dkuV48l8UyaSHDMfEZl1pYbTQK0EpYhz4XzILDzHKlkGewE7s6N1xpaZnTtZNCKonWojS5mJG7v9_We7_dD-2nGY7bUxDxDbH7TcQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Resource allocation for the AF Multiple Access Relay Channel with OFDMA</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Schedler, S. ; Angierski, A. ; Kuehn, V.</creator><creatorcontrib>Schedler, S. ; Angierski, A. ; Kuehn, V.</creatorcontrib><description>This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 9781467304368</identifier><identifier>ISBN: 1467304360</identifier><identifier>EISSN: 1558-2612</identifier><identifier>EISBN: 1467304352</identifier><identifier>EISBN: 9781467304351</identifier><identifier>EISBN: 9781467304375</identifier><identifier>EISBN: 1467304379</identifier><identifier>DOI: 10.1109/WCNC.2012.6214415</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Complexity theory ; Joints ; OFDM ; Optimization ; Relays ; Resource management</subject><ispartof>2012 IEEE Wireless Communications and Networking Conference (WCNC), 2012, p.486-491</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6214415$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6214415$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Schedler, S.</creatorcontrib><creatorcontrib>Angierski, A.</creatorcontrib><creatorcontrib>Kuehn, V.</creatorcontrib><title>Resource allocation for the AF Multiple Access Relay Channel with OFDMA</title><title>2012 IEEE Wireless Communications and Networking Conference (WCNC)</title><addtitle>WCNC</addtitle><description>This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.</description><subject>Algorithm design and analysis</subject><subject>Complexity theory</subject><subject>Joints</subject><subject>OFDM</subject><subject>Optimization</subject><subject>Relays</subject><subject>Resource management</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>9781467304368</isbn><isbn>1467304360</isbn><isbn>1467304352</isbn><isbn>9781467304351</isbn><isbn>9781467304375</isbn><isbn>1467304379</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kF1LwzAYRuMXuM39APEmf6A1b5I3bS5LtVPYHAzFy5FkKa3EdjQdsn-v4rw6Dxx4Lg4ht8BSAKbv38uXMuUMeKo4SAl4RqYgVSaYFMjPyQQQ84Qr4BdkrrP836n88tdxTAQCXJNpjB-McYZSTshi42N_GJynJoTembHtO1r3Ax0bT4uKrg5hbPfhZzvnY6QbH8yRlo3pOh_oVzs2dF09rIobclWbEP38xBl5qx5fy6dkuV48l8UyaSHDMfEZl1pYbTQK0EpYhz4XzILDzHKlkGewE7s6N1xpaZnTtZNCKonWojS5mJG7v9_We7_dD-2nGY7bUxDxDbH7TcQ</recordid><startdate>201204</startdate><enddate>201204</enddate><creator>Schedler, S.</creator><creator>Angierski, A.</creator><creator>Kuehn, V.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201204</creationdate><title>Resource allocation for the AF Multiple Access Relay Channel with OFDMA</title><author>Schedler, S. ; Angierski, A. ; Kuehn, V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e72493b9a9531963bc5e830b1c57b2665271d3df8a2694b0c9fc434645bb54a83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>Complexity theory</topic><topic>Joints</topic><topic>OFDM</topic><topic>Optimization</topic><topic>Relays</topic><topic>Resource management</topic><toplevel>online_resources</toplevel><creatorcontrib>Schedler, S.</creatorcontrib><creatorcontrib>Angierski, A.</creatorcontrib><creatorcontrib>Kuehn, V.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Schedler, S.</au><au>Angierski, A.</au><au>Kuehn, V.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Resource allocation for the AF Multiple Access Relay Channel with OFDMA</atitle><btitle>2012 IEEE Wireless Communications and Networking Conference (WCNC)</btitle><stitle>WCNC</stitle><date>2012-04</date><risdate>2012</risdate><spage>486</spage><epage>491</epage><pages>486-491</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>9781467304368</isbn><isbn>1467304360</isbn><eisbn>1467304352</eisbn><eisbn>9781467304351</eisbn><eisbn>9781467304375</eisbn><eisbn>1467304379</eisbn><abstract>This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.</abstract><pub>IEEE</pub><doi>10.1109/WCNC.2012.6214415</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1525-3511 |
| ispartof | 2012 IEEE Wireless Communications and Networking Conference (WCNC), 2012, p.486-491 |
| issn | 1525-3511 1558-2612 |
| language | eng |
| recordid | cdi_ieee_primary_6214415 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Complexity theory Joints OFDM Optimization Relays Resource management |
| title | Resource allocation for the AF Multiple Access Relay Channel with OFDMA |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T09%3A49%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Resource%20allocation%20for%20the%20AF%20Multiple%20Access%20Relay%20Channel%20with%20OFDMA&rft.btitle=2012%20IEEE%20Wireless%20Communications%20and%20Networking%20Conference%20(WCNC)&rft.au=Schedler,%20S.&rft.date=2012-04&rft.spage=486&rft.epage=491&rft.pages=486-491&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=9781467304368&rft.isbn_list=1467304360&rft_id=info:doi/10.1109/WCNC.2012.6214415&rft_dat=%3Cieee_6IE%3E6214415%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1467304352&rft.eisbn_list=9781467304351&rft.eisbn_list=9781467304375&rft.eisbn_list=1467304379&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6214415&rfr_iscdi=true |