• 한국통신학회논문지
• /
• 제33권4A호
• /
• pp.361-370
• /
• 2008

Cooperative relaying permits one or more relay to transmit a signal from the source to the destination, thereby increasing network coverage and spectral efficiency. The performance of cooperative relaying is often measured as outage probability. However, appropriate measure for the channel quality is outage capacity. Although the outage probability for cooperative relaying protocol has been analyzed before, very little research has been addressed for the outage capacity. This paper is the first of its kind to derive a closed-form analytical solution of outage capacity using fixed decode and forward relaying and amplify and forward relaying in dissimilar Rayleigh fading channels, considering channel coefficients known to the receiver side. The analytical results show a tradeoff between the SNR and the number of relays for specific outage capacity. A comparison between decode and forward relaying and amplify and forward relaying shows that decode and forward relaying outperforms amplify and forward relaying for a large number of relays.

• Journal of Communications and Networks
• /
• 제10권2호
• /
• pp.156-162
• /
• 2008

Cooperative relays can provide spatial diversity and improve performance of wireless communications. In this paper, we study subcarrier power allocation at the relays for orthogonal frequency division multiplexing (OFDM)-based wireless systems. For cooperative relay with amplify-and-forward (AF) and decode-and-forward (DF) algorithms, we investigate the impact of power allocation to the mutual information between the source and destination. From our simulation results on word~error-rate (WER) performance, we find that the DF algorithm with power allocation provides better performance than that of AF algorithm in a single path relay network because the former is able to eliminate channel noise at each relay. For the multiple path relay network, however, the network structure is already resistant to noise and channel distortion, and AF approach is a more attractive choice due to its lower complexity.

• Journal of electromagnetic engineering and science
• /
• 제10권4호
• /
• pp.270-275
• /
• 2010

In a conventional opportunistic transmit (COT) cooperative relaying system, only the relays that receive signal-to-noise ratio (SNR) from the source and that exceed the threshold transmit to the destination. The COT system, however, only considers the SNR of the source-relay (S-R) path regardless that the SNR of the relay-destination (R-D) path is the opportunistic transmission condition. For that reason, it is not guaranteed that all the transmitted signals from relays exceed the threshold at the destination. Therefore we propose a double opportunistic transmit (DOT) cooperative relaying system - when both of the received SNR from a source and from a destination exceed the threshold, the relay transmits to the destination. It is shown that the proposed DOT system reduces power consumption by 6.9, 20.9, 32.4, and 41.4 % for K =3, 5, 7, and 9, respectively under the given condition of $P_{out}=1{\times}10^{-3}$ and $\overline{\gamma}_{SR}/\Gamma_{SR}$=30 dB, compared to the COT system. We noticed that the performance of the DOT system is superior to that of the COT system for the identical number of active transmit relays under the same condition of the normalized average SNR of $\overline{\gamma}_{RD}/\Gamma_{RD}$.

• 대한전자공학회논문지TC
• /
• 제44권5호
• /
• pp.85-91
• /
• 2007

본 논문에서는 위상 피드백을 사용하는 다중 사용자를 위한 증폭재전송 협동 다이버시티 기법을 소개한다. 시뮬레이션 결과는 위상 피드백을 사용하는 다중 사용자를 위한 증폭재전송 협동 다이버시티 기법이 기존 무선 통신 기법에 비해 향상된 성능을 제공할 뿐 아니라 협동에 참여하는 단말기 수에 따라 다이버시티 이득을 얻음을 보여준다. 제안된 기법은 적은 양의 피드백만으로도 완전한 피드백을 사용한 경우에 근접하는 성능을 제공한다.

• 대한전자공학회논문지TC
• /
• 제49권6호
• /
• pp.39-47
• /
• 2012

차세대 무선통신 시스템에서 다중 경로 페이딩의 영향을 효율적으로 감소시키기 위한 방법으로 최근 협력통신 시스템이 각광을 받고 있다. 협력통신 시스템은 정보를 전송하기 위해서 다양한 페이딩 계수를 가지고 있는 협력 릴레이를 사용하기 때문에, 모든 릴레이를 협력통신에 참여 시키는 것은 자원의 낭비를 초래한다. 그러므로 무선자원을 효율적으로 사용하기 위해서는 최적의 릴레이를 선택적으로 사용할 필요가 있다. 본 논문에서는 무선 협력통신 네트워크에서 발생하는 이러한 문제를 해결하기 위하여 Q-Learning 알고리즘을 이용한 협력 릴레이 선택 기법을 제안한다. Q-Learning에서는 자가 학습을 위해서 상태, 행동, 그리고 보상에 대한 파라미터를 정의한다. 이러한 파라미터가 잘 정의 될 때 Q-Learning을 이용하여 우수한 통신 성능을 얻을 수 있다. Q-Learning 알고리즘의 우수성을 보이기 위해서, 수학적인 분석을 통해서 최적의 협력 릴레이를 얻는 기법과 통신 성능을 비교하였다. 모의실험 결과, 제안된 기법에서 Q-Learning 알고리즘 내의 보상을 주는 방식에 따라, 비교 기법과 유사한 심벌오율 성능을 얻으면서 보다 더 적은 협력 릴레이를 선택하는 것을 보였다. 따라서 본 논문에서 제안된 기법은 다수의 릴레이를 사용하는 차세대 무선통신 시스템의 성능 향상을 위한 좋은 접근 방식의 하나로 판단된다.

• 한국인터넷방송통신학회논문지
• /
• 제11권6호
• /
• pp.15-21
• /
• 2011

애드혹 네트워크에서는 협동 다이버시티를 적용하여 네트워크의 전력소모를 줄이고, 통달거리의 확장 및 시스템의 성능을 향상시키고 있다. 그러나 가장 큰 신호 대 잡음비(SNR, Signal-to-noise ratio)을 갖는 릴레이를 선택하여 송신하는 선택 릴레이 협동 다이버시티 방식은 느린 페이딩 채널에서 특정 릴레이가 계속 송신하므로 네트워크의 생존시간을 줄이게 된다. 그러므로 최근에 네트워크의 생존 시간을 늘이기 위하여 균일전력 릴레이 선택방식이 연구되었다. 본 논문에서는 소스-릴레이 및 릴레이-목적지간의 수신 신호 대 잡음비가 일정수준 이상이 되는 릴레이를 선택하여 송신할 수 있는 하는 이중 기회전송 협동 다이버시티(DOT, Double opportunistic cooperative diversity) 시스템에 균일전력 릴레이 선택방식을 적용하고 시스템의 성능을 유도하였다. 유도한 결과는 선택결합(SC, Selection combining) 방식과 최대비 합성결합(MRC, Maximal ratio combining) 방식과 비교하였다. 균일전력 릴레이 방식을 사용하였을 때 다른 방식에 비해서 시스템의 성능저하가 있었는데, 이는 네트워크의 생존 시간을 늘이기 위해서 릴레이에 균일한 송신기회를 주었기 때문으로 해석되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2416-2432
• /
• 2017

In this paper, we investigate the security performance for cooperative networks over Nakagami-m fading channels. Based on whether the channel state information (CSI) of wiretap link is available or not, optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes are considered. Also, multiple relays combining (MRC) scheme is considered for comparison purpose. The exact and asymptotic closed-form expressions for secrecy outage probability (SOP) are derived and simulations are presented to validate the accuracy of our proposed analytical results. The numerical results illustrate that the ORS is the best scheme and SRS scheme is better than MRC scheme in some special scenarios such as when the destination is far away from the relays. Furthermore, through asymptotic analysis, we obtain the closed-form expressions for the secrecy diversity order and secrecy array gain for the three different selection schemes. The secrecy diversity order is closely related to the number of relays and fading parameter between relay and destination.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5335-5353
• /
• 2019

The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.

• Journal of electromagnetic engineering and science
• /
• 제11권2호
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.94-98
• /
• 2009

In this paper, we propose a new channel estimation scheme for amplify and forward cooperative diversity with relay selection. In order to select best relay, it is necessary to know channel state information (CSI) at the destination. Most of the previous works, however, assume that perfect CSI is available at the destination. In addition, when the number of relay is increased it is difficult to estimate CSI through all relays within coherence time of a channel because of the large amount of frame overhead for channel estimation. In a proposed channel estimation scheme, each terminal has distinct pilot signal which is orthogonal each other. By using orthogonal property of pilot signals, CSI is estimated over two pilot signal transmission phases so that frame overhead is reduced significantly. Due to the orthogonal property among pilot signals, estimation error does not depend on the number of relays. Simulation result shows that the proposed channel estimation scheme provides accurate CSI at the destination.