Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay Networks
In this paper, an efficient algorithm for selecting a route in a multihop amplify-and-forward (AF) relay network is presented. In particular, a route selection strategy that minimizes the outage probability of the network is proposed. By providing a recursive method to calculate the outage probabili...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2013-05, Vol.17 (5), p.932-935 |
|---|---|
| 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 | 935 |
|---|---|
| container_issue | 5 |
| container_start_page | 932 |
| container_title | IEEE communications letters |
| container_volume | 17 |
| creator | Yue Wang Bocus, M. Z. Coon, J. P. |
| description | In this paper, an efficient algorithm for selecting a route in a multihop amplify-and-forward (AF) relay network is presented. In particular, a route selection strategy that minimizes the outage probability of the network is proposed. By providing a recursive method to calculate the outage probability, we demonstrate how the algorithm can be implemented based on a dynamic programming approach wherein the relays compute and compare path metrics on a hop-by-hop basis. Simulation results are provided to verify the performance and efficiency of the proposed method relative to other existing approaches. |
| doi_str_mv | 10.1109/LCOMM.2013.040213.130145 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_1372657281</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6496998</ieee_id><sourcerecordid>1372657281</sourcerecordid><originalsourceid>FETCH-LOGICAL-c370t-ce1450b6a1f37baef76acf2dc122ae0f9dfb0654007da0c027896e146d209a5e3</originalsourceid><addsrcrecordid>eNpdkE1v1DAQhiMEEqX0F3CxhJC4ZBk7iT-O1cK2SLsUtXCOZp1xcUnixU5U9t_XJVUPXDyW_bwzo6coGIcV52A-bddXu91KAK9WUIPIhVfA6-ZFccKbRpciHy_zHbQplTL6dfEmpTsA0KLhJwV-Po44eMu-x3AbcRj8eMtciOw6zBOxG-rJTj6MzI9sN_eT_xUObOP_UscuML-dD4feu2OJY1duQrzH2LFr6vHIvtF0H-Lv9LZ45bBPdPZUT4ufmy8_1pfl9uri6_p8W9pKwVRaykvDXiJ3ldojOSXROtFZLgQSONO5PcimBlAdggWhtJE5IzsBBhuqTouPS99DDH9mSlM7-GSp73GkMKeWV0rIRgnNM_r-P_QuzHHM22WqkSbblCJTeqFsDClFcu0h-gHjseXQPrpv_7lvH923i_t2cZ-jH54GYLLYu4ij9ek5L1Sta83rzL1bOE9Ez9-yNtIYXT0ATFaNbQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1356920162</pqid></control><display><type>article</type><title>Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Yue Wang ; Bocus, M. Z. ; Coon, J. P.</creator><creatorcontrib>Yue Wang ; Bocus, M. Z. ; Coon, J. P.</creatorcontrib><description>In this paper, an efficient algorithm for selecting a route in a multihop amplify-and-forward (AF) relay network is presented. In particular, a route selection strategy that minimizes the outage probability of the network is proposed. By providing a recursive method to calculate the outage probability, we demonstrate how the algorithm can be implemented based on a dynamic programming approach wherein the relays compute and compare path metrics on a hop-by-hop basis. Simulation results are provided to verify the performance and efficiency of the proposed method relative to other existing approaches.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2013.040213.130145</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Access methods and protocols, osi model ; Algorithms ; Amplification ; amplify-and-forward ; Applied sciences ; Complexity theory ; Computational efficiency ; Dynamic programming ; Exact sciences and technology ; Measurement ; outage probability ; Outages ; Relay networks ; Relays ; Route selection ; Routing ; Signal to noise ratio ; Spread spectrum communication ; Strategy ; Switching and signalling ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Viterbi algorithm</subject><ispartof>IEEE communications letters, 2013-05, Vol.17 (5), p.932-935</ispartof><rights>2014 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c370t-ce1450b6a1f37baef76acf2dc122ae0f9dfb0654007da0c027896e146d209a5e3</citedby><cites>FETCH-LOGICAL-c370t-ce1450b6a1f37baef76acf2dc122ae0f9dfb0654007da0c027896e146d209a5e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6496998$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27907,27908,54741</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6496998$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27484814$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yue Wang</creatorcontrib><creatorcontrib>Bocus, M. Z.</creatorcontrib><creatorcontrib>Coon, J. P.</creatorcontrib><title>Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay Networks</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>In this paper, an efficient algorithm for selecting a route in a multihop amplify-and-forward (AF) relay network is presented. In particular, a route selection strategy that minimizes the outage probability of the network is proposed. By providing a recursive method to calculate the outage probability, we demonstrate how the algorithm can be implemented based on a dynamic programming approach wherein the relays compute and compare path metrics on a hop-by-hop basis. Simulation results are provided to verify the performance and efficiency of the proposed method relative to other existing approaches.</description><subject>Access methods and protocols, osi model</subject><subject>Algorithms</subject><subject>Amplification</subject><subject>amplify-and-forward</subject><subject>Applied sciences</subject><subject>Complexity theory</subject><subject>Computational efficiency</subject><subject>Dynamic programming</subject><subject>Exact sciences and technology</subject><subject>Measurement</subject><subject>outage probability</subject><subject>Outages</subject><subject>Relay networks</subject><subject>Relays</subject><subject>Route selection</subject><subject>Routing</subject><subject>Signal to noise ratio</subject><subject>Spread spectrum communication</subject><subject>Strategy</subject><subject>Switching and signalling</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Viterbi algorithm</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE1v1DAQhiMEEqX0F3CxhJC4ZBk7iT-O1cK2SLsUtXCOZp1xcUnixU5U9t_XJVUPXDyW_bwzo6coGIcV52A-bddXu91KAK9WUIPIhVfA6-ZFccKbRpciHy_zHbQplTL6dfEmpTsA0KLhJwV-Po44eMu-x3AbcRj8eMtciOw6zBOxG-rJTj6MzI9sN_eT_xUObOP_UscuML-dD4feu2OJY1duQrzH2LFr6vHIvtF0H-Lv9LZ45bBPdPZUT4ufmy8_1pfl9uri6_p8W9pKwVRaykvDXiJ3ldojOSXROtFZLgQSONO5PcimBlAdggWhtJE5IzsBBhuqTouPS99DDH9mSlM7-GSp73GkMKeWV0rIRgnNM_r-P_QuzHHM22WqkSbblCJTeqFsDClFcu0h-gHjseXQPrpv_7lvH923i_t2cZ-jH54GYLLYu4ij9ek5L1Sta83rzL1bOE9Ez9-yNtIYXT0ATFaNbQ</recordid><startdate>20130501</startdate><enddate>20130501</enddate><creator>Yue Wang</creator><creator>Bocus, M. Z.</creator><creator>Coon, J. P.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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>20130501</creationdate><title>Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay Networks</title><author>Yue Wang ; Bocus, M. Z. ; Coon, J. P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c370t-ce1450b6a1f37baef76acf2dc122ae0f9dfb0654007da0c027896e146d209a5e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Access methods and protocols, osi model</topic><topic>Algorithms</topic><topic>Amplification</topic><topic>amplify-and-forward</topic><topic>Applied sciences</topic><topic>Complexity theory</topic><topic>Computational efficiency</topic><topic>Dynamic programming</topic><topic>Exact sciences and technology</topic><topic>Measurement</topic><topic>outage probability</topic><topic>Outages</topic><topic>Relay networks</topic><topic>Relays</topic><topic>Route selection</topic><topic>Routing</topic><topic>Signal to noise ratio</topic><topic>Spread spectrum communication</topic><topic>Strategy</topic><topic>Switching and signalling</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Viterbi algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yue Wang</creatorcontrib><creatorcontrib>Bocus, M. Z.</creatorcontrib><creatorcontrib>Coon, J. P.</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><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 communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yue Wang</au><au>Bocus, M. Z.</au><au>Coon, J. P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay Networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2013-05-01</date><risdate>2013</risdate><volume>17</volume><issue>5</issue><spage>932</spage><epage>935</epage><pages>932-935</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>In this paper, an efficient algorithm for selecting a route in a multihop amplify-and-forward (AF) relay network is presented. In particular, a route selection strategy that minimizes the outage probability of the network is proposed. By providing a recursive method to calculate the outage probability, we demonstrate how the algorithm can be implemented based on a dynamic programming approach wherein the relays compute and compare path metrics on a hop-by-hop basis. Simulation results are provided to verify the performance and efficiency of the proposed method relative to other existing approaches.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2013.040213.130145</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2013-05, Vol.17 (5), p.932-935 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1372657281 |
| source | IEEE Electronic Library (IEL) |
| subjects | Access methods and protocols, osi model Algorithms Amplification amplify-and-forward Applied sciences Complexity theory Computational efficiency Dynamic programming Exact sciences and technology Measurement outage probability Outages Relay networks Relays Route selection Routing Signal to noise ratio Spread spectrum communication Strategy Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Viterbi algorithm |
| title | Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay 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-17T00%3A03%3A13IST&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=Dynamic%20Programming%20for%20Route%20Selection%20in%20Multihop%20Fixed%20Gain%20Amplify-and-Forward%20Relay%20Networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Yue%20Wang&rft.date=2013-05-01&rft.volume=17&rft.issue=5&rft.spage=932&rft.epage=935&rft.pages=932-935&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2013.040213.130145&rft_dat=%3Cproquest_RIE%3E1372657281%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=1356920162&rft_id=info:pmid/&rft_ieee_id=6496998&rfr_iscdi=true |