Opportunistic Decode-and-Forward Relaying with Interferences at Relays
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sung-Il | - |
dc.contributor.author | Kim, Saejoon | - |
dc.contributor.author | Kim, Joon Tae | - |
dc.contributor.author | Heo, Jun | - |
dc.date.accessioned | 2021-09-06T05:31:05Z | - |
dc.date.available | 2021-09-06T05:31:05Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2013-01 | - |
dc.identifier.issn | 0929-6212 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/104247 | - |
dc.description.abstract | In this paper, a decode-and-forward cooperative interference-limited multiple relay network is considered. An efficient relay selection strategy and its performance analysis are proposed, where only the relay nodes are affected by multiple interferences. In the proposed relay selection scheme, the selected relay is not always used, depending on the power of interferences and the channel state information of all links, while the direct path between source and destination is always used. For analytical tractability the distribution of interference-limited channel is approximated as an exponential distribution with high accuracy. Analysis of cooperative networks with interference-limited relays can be performed using the approximate exponential distribution by the same methods which have been used without interferences. We derive the bit error probability and outage probability of the proposed opportunistic max-min relay selection (OMRS) scheme in independent non-identically distributed Rayleigh fading channels. Numerical results present the superiority of OMRS over the conventional relay selection scheme which always uses the selected relay path. The exactness of the approximate analysis for interference-limited relays is also shown in numerical results. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | USER COOPERATION DIVERSITY | - |
dc.subject | PERFORMANCE ANALYSIS | - |
dc.subject | OUTAGE PROBABILITY | - |
dc.subject | ERROR-PROBABILITY | - |
dc.subject | SELECTION | - |
dc.subject | SYSTEMS | - |
dc.subject | NETWORKS | - |
dc.subject | SCHEMES | - |
dc.title | Opportunistic Decode-and-Forward Relaying with Interferences at Relays | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Heo, Jun | - |
dc.identifier.doi | 10.1007/s11277-011-0449-6 | - |
dc.identifier.scopusid | 2-s2.0-84872313157 | - |
dc.identifier.wosid | 000313804600001 | - |
dc.identifier.bibliographicCitation | WIRELESS PERSONAL COMMUNICATIONS, v.68, no.2, pp.247 - 264 | - |
dc.relation.isPartOf | WIRELESS PERSONAL COMMUNICATIONS | - |
dc.citation.title | WIRELESS PERSONAL COMMUNICATIONS | - |
dc.citation.volume | 68 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 247 | - |
dc.citation.endPage | 264 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | USER COOPERATION DIVERSITY | - |
dc.subject.keywordPlus | PERFORMANCE ANALYSIS | - |
dc.subject.keywordPlus | OUTAGE PROBABILITY | - |
dc.subject.keywordPlus | ERROR-PROBABILITY | - |
dc.subject.keywordPlus | SELECTION | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordPlus | SCHEMES | - |
dc.subject.keywordAuthor | Decode-and-forward (DF) relaying | - |
dc.subject.keywordAuthor | Max-min selection | - |
dc.subject.keywordAuthor | Multiple interferences | - |
dc.subject.keywordAuthor | Bit error probability | - |
dc.subject.keywordAuthor | Outage probability | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.