Loading…
Opportunistic Relay Selection With Limited Feedback
Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Generally, relay selection algorithms require channel state information (CSI) feedback from all cooperating relays to make a selection decision. This requirement poses two important challenges, which...
Saved in:
Published in: | IEEE transactions on communications 2015-08, Vol.63 (8), p.2885-2898 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83 |
---|---|
cites | cdi_FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83 |
container_end_page | 2898 |
container_issue | 8 |
container_start_page | 2885 |
container_title | IEEE transactions on communications |
container_volume | 63 |
creator | Eltayeb, Mohammed E. Elkhalil, Khalil Bahrami, Hamid Reza Al-Naffouri, Tareq Y. |
description | Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Generally, relay selection algorithms require channel state information (CSI) feedback from all cooperating relays to make a selection decision. This requirement poses two important challenges, which are often neglected in the literature. Firstly, the fed back channel information is usually corrupted by additive noise. Secondly, CSI feedback generates a great deal of feedback overhead (air-time) that could result in significant performance hits. In this paper, we propose a compressive sensing (CS) based relay selection algorithm that reduces the feedback overhead of relay networks under the assumption of noisy feedback channels. The proposed algorithm exploits CS to first obtain the identity of a set of relays with favorable channel conditions. Following that, the CSI of the identified relays is estimated using least squares estimation without any additional feedback. Both single and multiple relay selection cases are considered. After deriving closed-form expressions for the asymptotic end-to-end SNR at the destination and the feedback load for different relaying protocols, we show that CS-based selection drastically reduces the feedback load and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback. |
doi_str_mv | 10.1109/TCOMM.2015.2451629 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TCOMM_2015_2451629</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7145411</ieee_id><sourcerecordid>3774265881</sourcerecordid><originalsourceid>FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83</originalsourceid><addsrcrecordid>eNpdkLFOwzAQhi0EEqXwArBEYmFJubPj2hlRRQGpVSUoYrRc-yJc0qTEydC3J6UVA7rhbvj-X6ePsWuEESLk98vJYj4fcUA54pnEMc9P2ACl1CloqU7ZACCHdKyUPmcXMa4BIAMhBkwsttu6absqxDa45JVKu0veqCTXhrpKPkL7mczCJrTkkymRX1n3dcnOCltGujruIXufPi4nz-ls8fQyeZilTnDdphK1ypUsCm-98Mop1CBBKNkf3ltnwRXkOXeEyq24yi05V3hOxEkRaTFkd4febVN_dxRbswnRUVnaiuouGlQCQGcKZY_e_kPXdddU_Xc9BaKfTO4L-YFyTR1jQ4XZNmFjm51BMHuP5tej2Xs0R4996OYQCkT0F1CYyQxR_ADqkm5A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1703030458</pqid></control><display><type>article</type><title>Opportunistic Relay Selection With Limited Feedback</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Eltayeb, Mohammed E. ; Elkhalil, Khalil ; Bahrami, Hamid Reza ; Al-Naffouri, Tareq Y.</creator><creatorcontrib>Eltayeb, Mohammed E. ; Elkhalil, Khalil ; Bahrami, Hamid Reza ; Al-Naffouri, Tareq Y.</creatorcontrib><description>Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Generally, relay selection algorithms require channel state information (CSI) feedback from all cooperating relays to make a selection decision. This requirement poses two important challenges, which are often neglected in the literature. Firstly, the fed back channel information is usually corrupted by additive noise. Secondly, CSI feedback generates a great deal of feedback overhead (air-time) that could result in significant performance hits. In this paper, we propose a compressive sensing (CS) based relay selection algorithm that reduces the feedback overhead of relay networks under the assumption of noisy feedback channels. The proposed algorithm exploits CS to first obtain the identity of a set of relays with favorable channel conditions. Following that, the CSI of the identified relays is estimated using least squares estimation without any additional feedback. Both single and multiple relay selection cases are considered. After deriving closed-form expressions for the asymptotic end-to-end SNR at the destination and the feedback load for different relaying protocols, we show that CS-based selection drastically reduces the feedback load and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2015.2451629</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Amplify-and-Forward ; Asymptotic properties ; Channels ; Communication channels ; Compressive Sensing ; Decode-and-Forward ; Estimation ; Feedback ; Feeds ; Full-Duplex ; Half-Duplex ; Least squares method ; Noise measurement ; Protocols ; Relay ; Relay networks ; Relaying ; Relays ; Signal to noise ratio</subject><ispartof>IEEE transactions on communications, 2015-08, Vol.63 (8), p.2885-2898</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83</citedby><cites>FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7145411$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Eltayeb, Mohammed E.</creatorcontrib><creatorcontrib>Elkhalil, Khalil</creatorcontrib><creatorcontrib>Bahrami, Hamid Reza</creatorcontrib><creatorcontrib>Al-Naffouri, Tareq Y.</creatorcontrib><title>Opportunistic Relay Selection With Limited Feedback</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Generally, relay selection algorithms require channel state information (CSI) feedback from all cooperating relays to make a selection decision. This requirement poses two important challenges, which are often neglected in the literature. Firstly, the fed back channel information is usually corrupted by additive noise. Secondly, CSI feedback generates a great deal of feedback overhead (air-time) that could result in significant performance hits. In this paper, we propose a compressive sensing (CS) based relay selection algorithm that reduces the feedback overhead of relay networks under the assumption of noisy feedback channels. The proposed algorithm exploits CS to first obtain the identity of a set of relays with favorable channel conditions. Following that, the CSI of the identified relays is estimated using least squares estimation without any additional feedback. Both single and multiple relay selection cases are considered. After deriving closed-form expressions for the asymptotic end-to-end SNR at the destination and the feedback load for different relaying protocols, we show that CS-based selection drastically reduces the feedback load and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback.</description><subject>Algorithms</subject><subject>Amplify-and-Forward</subject><subject>Asymptotic properties</subject><subject>Channels</subject><subject>Communication channels</subject><subject>Compressive Sensing</subject><subject>Decode-and-Forward</subject><subject>Estimation</subject><subject>Feedback</subject><subject>Feeds</subject><subject>Full-Duplex</subject><subject>Half-Duplex</subject><subject>Least squares method</subject><subject>Noise measurement</subject><subject>Protocols</subject><subject>Relay</subject><subject>Relay networks</subject><subject>Relaying</subject><subject>Relays</subject><subject>Signal to noise ratio</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNpdkLFOwzAQhi0EEqXwArBEYmFJubPj2hlRRQGpVSUoYrRc-yJc0qTEydC3J6UVA7rhbvj-X6ePsWuEESLk98vJYj4fcUA54pnEMc9P2ACl1CloqU7ZACCHdKyUPmcXMa4BIAMhBkwsttu6absqxDa45JVKu0veqCTXhrpKPkL7mczCJrTkkymRX1n3dcnOCltGujruIXufPi4nz-ls8fQyeZilTnDdphK1ypUsCm-98Mop1CBBKNkf3ltnwRXkOXeEyq24yi05V3hOxEkRaTFkd4febVN_dxRbswnRUVnaiuouGlQCQGcKZY_e_kPXdddU_Xc9BaKfTO4L-YFyTR1jQ4XZNmFjm51BMHuP5tej2Xs0R4996OYQCkT0F1CYyQxR_ADqkm5A</recordid><startdate>201508</startdate><enddate>201508</enddate><creator>Eltayeb, Mohammed E.</creator><creator>Elkhalil, Khalil</creator><creator>Bahrami, Hamid Reza</creator><creator>Al-Naffouri, Tareq Y.</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>201508</creationdate><title>Opportunistic Relay Selection With Limited Feedback</title><author>Eltayeb, Mohammed E. ; Elkhalil, Khalil ; Bahrami, Hamid Reza ; Al-Naffouri, Tareq Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Amplify-and-Forward</topic><topic>Asymptotic properties</topic><topic>Channels</topic><topic>Communication channels</topic><topic>Compressive Sensing</topic><topic>Decode-and-Forward</topic><topic>Estimation</topic><topic>Feedback</topic><topic>Feeds</topic><topic>Full-Duplex</topic><topic>Half-Duplex</topic><topic>Least squares method</topic><topic>Noise measurement</topic><topic>Protocols</topic><topic>Relay</topic><topic>Relay networks</topic><topic>Relaying</topic><topic>Relays</topic><topic>Signal to noise ratio</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Eltayeb, Mohammed E.</creatorcontrib><creatorcontrib>Elkhalil, Khalil</creatorcontrib><creatorcontrib>Bahrami, Hamid Reza</creatorcontrib><creatorcontrib>Al-Naffouri, Tareq Y.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</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 transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Eltayeb, Mohammed E.</au><au>Elkhalil, Khalil</au><au>Bahrami, Hamid Reza</au><au>Al-Naffouri, Tareq Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Opportunistic Relay Selection With Limited Feedback</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2015-08</date><risdate>2015</risdate><volume>63</volume><issue>8</issue><spage>2885</spage><epage>2898</epage><pages>2885-2898</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. Generally, relay selection algorithms require channel state information (CSI) feedback from all cooperating relays to make a selection decision. This requirement poses two important challenges, which are often neglected in the literature. Firstly, the fed back channel information is usually corrupted by additive noise. Secondly, CSI feedback generates a great deal of feedback overhead (air-time) that could result in significant performance hits. In this paper, we propose a compressive sensing (CS) based relay selection algorithm that reduces the feedback overhead of relay networks under the assumption of noisy feedback channels. The proposed algorithm exploits CS to first obtain the identity of a set of relays with favorable channel conditions. Following that, the CSI of the identified relays is estimated using least squares estimation without any additional feedback. Both single and multiple relay selection cases are considered. After deriving closed-form expressions for the asymptotic end-to-end SNR at the destination and the feedback load for different relaying protocols, we show that CS-based selection drastically reduces the feedback load and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2015.2451629</doi><tpages>14</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0090-6778 |
ispartof | IEEE transactions on communications, 2015-08, Vol.63 (8), p.2885-2898 |
issn | 0090-6778 1558-0857 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TCOMM_2015_2451629 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Algorithms Amplify-and-Forward Asymptotic properties Channels Communication channels Compressive Sensing Decode-and-Forward Estimation Feedback Feeds Full-Duplex Half-Duplex Least squares method Noise measurement Protocols Relay Relay networks Relaying Relays Signal to noise ratio |
title | Opportunistic Relay Selection With Limited Feedback |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T13%3A12%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Opportunistic%20Relay%20Selection%20With%20Limited%20Feedback&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Eltayeb,%20Mohammed%20E.&rft.date=2015-08&rft.volume=63&rft.issue=8&rft.spage=2885&rft.epage=2898&rft.pages=2885-2898&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2015.2451629&rft_dat=%3Cproquest_cross%3E3774265881%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c328t-5187975ffdad3d7c718050375718ddaca0cfed22ce17cb279aeccfd2ee2e7ee83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1703030458&rft_id=info:pmid/&rft_ieee_id=7145411&rfr_iscdi=true |