Resource Allocation for the Parallel Relay Channel with Multiple Relays
A cooperative network where the transmission between two nodes is assisted by many half-duplex relays over parallel Gaussian channels is considered. The parallel channel model is suitable for a broadband system, such as orthogonal frequency division multiplexing or a block fading channel. For the de...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on wireless communications 2011-03, Vol.10 (3), p.792-802 |
|---|---|
| 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 | 802 |
|---|---|
| container_issue | 3 |
| container_start_page | 792 |
| container_title | IEEE transactions on wireless communications |
| container_volume | 10 |
| creator | Bakanoğlu, K Tomasin, S Erkip, E |
| description | A cooperative network where the transmission between two nodes is assisted by many half-duplex relays over parallel Gaussian channels is considered. The parallel channel model is suitable for a broadband system, such as orthogonal frequency division multiplexing or a block fading channel. For the decode-and-forward protocol, an optimization problem for joint power, time and subchannel allocation under per-node power constraints is formulated to maximize the total transmission rate between the source and the destination. To solve this optimization problem, first the optimal power allocation for a given subchannel allocation is found. Then a greedy algorithm that jointly allocates subchannels and power is described. Finally, the time allocation is optimized by a numerical search procedure. The limiting case where the number of subchannels goes to infinity is also studied. Numerical results reveal that the achieved rate for the infinite number of subchannels is an upper bound for the finite subchannel case and the proposed greedy algorithm results in rates close to those for infinite number of subchannels when the number of subchannels is sufficiently large. Furthermore, most of the cooperative gains can be achieved by the use of a small number of relays. |
| doi_str_mv | 10.1109/TWC.2011.011111.091682 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_RIE</sourceid><recordid>TN_cdi_ieee_primary_5692982</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5692982</ieee_id><sourcerecordid>24707543</sourcerecordid><originalsourceid>FETCH-LOGICAL-c305t-94fac45936e3bdc8d351c393ba9bbcd7d4e4aabdfb29e1ca78af7ceb5995359a3</originalsourceid><addsrcrecordid>eNo9kE9Lw0AQxRdRsFY_gSC5eEzdP9ls9liCVqGilIrHZbKZpZE1Kbsp0m_fhEgPw5vhvTeHHyEPjC4Yo_pp-10uOGVsMQwbRbO84BdkxqQsUs6z4nLcRZ4yrvJrchPjD6VM5VLOyGqDsTsEi8nS-85C33Rt4rqQ9DtMPiGA9-iTDXo4JuUO2na4_pp-l7wffN_sPU5evCVXDnzEu3-dk6-X5235mq4_Vm_lcp1aQWWf6syBzaQWOYqqtkUtJLNCiwp0Vdla1RlmAFXtKq6RWVAFOGWxklpLITWIOcmnvzZ0MQZ0Zh-aXwhHw6gZcZgBhxlxmAmHmXAMxcepuIdowbsArW3iuc0zRZXMxJC7n3INIp5tmWuuhy8ncBhqYQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Resource Allocation for the Parallel Relay Channel with Multiple Relays</title><source>IEEE Electronic Library (IEL)</source><creator>Bakanoğlu, K ; Tomasin, S ; Erkip, E</creator><creatorcontrib>Bakanoğlu, K ; Tomasin, S ; Erkip, E</creatorcontrib><description>A cooperative network where the transmission between two nodes is assisted by many half-duplex relays over parallel Gaussian channels is considered. The parallel channel model is suitable for a broadband system, such as orthogonal frequency division multiplexing or a block fading channel. For the decode-and-forward protocol, an optimization problem for joint power, time and subchannel allocation under per-node power constraints is formulated to maximize the total transmission rate between the source and the destination. To solve this optimization problem, first the optimal power allocation for a given subchannel allocation is found. Then a greedy algorithm that jointly allocates subchannels and power is described. Finally, the time allocation is optimized by a numerical search procedure. The limiting case where the number of subchannels goes to infinity is also studied. Numerical results reveal that the achieved rate for the infinite number of subchannels is an upper bound for the finite subchannel case and the proposed greedy algorithm results in rates close to those for infinite number of subchannels when the number of subchannels is sufficiently large. Furthermore, most of the cooperative gains can be achieved by the use of a small number of relays.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2011.011111.091682</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Access methods and protocols, osi model ; Applied sciences ; Broadband communication ; Detection, estimation, filtering, equalization, prediction ; Exact sciences and technology ; Fading ; Greedy algorithms ; Information, signal and communications theory ; Multiplexing ; OFDM ; Optimization ; parallel relay channel ; Relays ; Resource allocation ; Resource management ; Signal and communications theory ; Signal, noise ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Transmission and modulation (techniques and equipments) ; user cooperation</subject><ispartof>IEEE transactions on wireless communications, 2011-03, Vol.10 (3), p.792-802</ispartof><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c305t-94fac45936e3bdc8d351c393ba9bbcd7d4e4aabdfb29e1ca78af7ceb5995359a3</citedby><cites>FETCH-LOGICAL-c305t-94fac45936e3bdc8d351c393ba9bbcd7d4e4aabdfb29e1ca78af7ceb5995359a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5692982$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5692982$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24707543$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bakanoğlu, K</creatorcontrib><creatorcontrib>Tomasin, S</creatorcontrib><creatorcontrib>Erkip, E</creatorcontrib><title>Resource Allocation for the Parallel Relay Channel with Multiple Relays</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>A cooperative network where the transmission between two nodes is assisted by many half-duplex relays over parallel Gaussian channels is considered. The parallel channel model is suitable for a broadband system, such as orthogonal frequency division multiplexing or a block fading channel. For the decode-and-forward protocol, an optimization problem for joint power, time and subchannel allocation under per-node power constraints is formulated to maximize the total transmission rate between the source and the destination. To solve this optimization problem, first the optimal power allocation for a given subchannel allocation is found. Then a greedy algorithm that jointly allocates subchannels and power is described. Finally, the time allocation is optimized by a numerical search procedure. The limiting case where the number of subchannels goes to infinity is also studied. Numerical results reveal that the achieved rate for the infinite number of subchannels is an upper bound for the finite subchannel case and the proposed greedy algorithm results in rates close to those for infinite number of subchannels when the number of subchannels is sufficiently large. Furthermore, most of the cooperative gains can be achieved by the use of a small number of relays.</description><subject>Access methods and protocols, osi model</subject><subject>Applied sciences</subject><subject>Broadband communication</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Exact sciences and technology</subject><subject>Fading</subject><subject>Greedy algorithms</subject><subject>Information, signal and communications theory</subject><subject>Multiplexing</subject><subject>OFDM</subject><subject>Optimization</subject><subject>parallel relay channel</subject><subject>Relays</subject><subject>Resource allocation</subject><subject>Resource management</subject><subject>Signal and communications theory</subject><subject>Signal, noise</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>user cooperation</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE9Lw0AQxRdRsFY_gSC5eEzdP9ls9liCVqGilIrHZbKZpZE1Kbsp0m_fhEgPw5vhvTeHHyEPjC4Yo_pp-10uOGVsMQwbRbO84BdkxqQsUs6z4nLcRZ4yrvJrchPjD6VM5VLOyGqDsTsEi8nS-85C33Rt4rqQ9DtMPiGA9-iTDXo4JuUO2na4_pp-l7wffN_sPU5evCVXDnzEu3-dk6-X5235mq4_Vm_lcp1aQWWf6syBzaQWOYqqtkUtJLNCiwp0Vdla1RlmAFXtKq6RWVAFOGWxklpLITWIOcmnvzZ0MQZ0Zh-aXwhHw6gZcZgBhxlxmAmHmXAMxcepuIdowbsArW3iuc0zRZXMxJC7n3INIp5tmWuuhy8ncBhqYQ</recordid><startdate>20110301</startdate><enddate>20110301</enddate><creator>Bakanoğlu, K</creator><creator>Tomasin, S</creator><creator>Erkip, E</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20110301</creationdate><title>Resource Allocation for the Parallel Relay Channel with Multiple Relays</title><author>Bakanoğlu, K ; Tomasin, S ; Erkip, E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c305t-94fac45936e3bdc8d351c393ba9bbcd7d4e4aabdfb29e1ca78af7ceb5995359a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Access methods and protocols, osi model</topic><topic>Applied sciences</topic><topic>Broadband communication</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Exact sciences and technology</topic><topic>Fading</topic><topic>Greedy algorithms</topic><topic>Information, signal and communications theory</topic><topic>Multiplexing</topic><topic>OFDM</topic><topic>Optimization</topic><topic>parallel relay channel</topic><topic>Relays</topic><topic>Resource allocation</topic><topic>Resource management</topic><topic>Signal and communications theory</topic><topic>Signal, noise</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>user cooperation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bakanoğlu, K</creatorcontrib><creatorcontrib>Tomasin, S</creatorcontrib><creatorcontrib>Erkip, E</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>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bakanoğlu, K</au><au>Tomasin, S</au><au>Erkip, E</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Resource Allocation for the Parallel Relay Channel with Multiple Relays</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2011-03-01</date><risdate>2011</risdate><volume>10</volume><issue>3</issue><spage>792</spage><epage>802</epage><pages>792-802</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>A cooperative network where the transmission between two nodes is assisted by many half-duplex relays over parallel Gaussian channels is considered. The parallel channel model is suitable for a broadband system, such as orthogonal frequency division multiplexing or a block fading channel. For the decode-and-forward protocol, an optimization problem for joint power, time and subchannel allocation under per-node power constraints is formulated to maximize the total transmission rate between the source and the destination. To solve this optimization problem, first the optimal power allocation for a given subchannel allocation is found. Then a greedy algorithm that jointly allocates subchannels and power is described. Finally, the time allocation is optimized by a numerical search procedure. The limiting case where the number of subchannels goes to infinity is also studied. Numerical results reveal that the achieved rate for the infinite number of subchannels is an upper bound for the finite subchannel case and the proposed greedy algorithm results in rates close to those for infinite number of subchannels when the number of subchannels is sufficiently large. Furthermore, most of the cooperative gains can be achieved by the use of a small number of relays.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TWC.2011.011111.091682</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1276 |
| ispartof | IEEE transactions on wireless communications, 2011-03, Vol.10 (3), p.792-802 |
| issn | 1536-1276 1558-2248 |
| language | eng |
| recordid | cdi_ieee_primary_5692982 |
| source | IEEE Electronic Library (IEL) |
| subjects | Access methods and protocols, osi model Applied sciences Broadband communication Detection, estimation, filtering, equalization, prediction Exact sciences and technology Fading Greedy algorithms Information, signal and communications theory Multiplexing OFDM Optimization parallel relay channel Relays Resource allocation Resource management Signal and communications theory Signal, noise Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Transmission and modulation (techniques and equipments) user cooperation |
| title | Resource Allocation for the Parallel Relay Channel with Multiple Relays |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T17%3A19%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Resource%20Allocation%20for%20the%20Parallel%20Relay%20Channel%20with%20Multiple%20Relays&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Bakanog%CC%86lu,%20K&rft.date=2011-03-01&rft.volume=10&rft.issue=3&rft.spage=792&rft.epage=802&rft.pages=792-802&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2011.011111.091682&rft_dat=%3Cpascalfrancis_RIE%3E24707543%3C/pascalfrancis_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5692982&rfr_iscdi=true |