• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3967-3983
• /
• 2014

The performance of an partial relay selection on the decode-and-forward (DF) mode cognitive radio (CR) relay networks is studied, with some important factors, including the outage probability, the bit error ratio (BER), and the average channel capacity being analyzed. Different from the conventional relay selection schemes, the impact of spectrum sensing process as well as the spectrum utilization efficiency of primary users on the performance of DF-based CR relaying networks has been taken into consideration. In particular, the exact closed-form expressions for the figures of merit such as outage probability, BER, and average channel capacity over independent and identically distributed (i.i.d.) Rayleigh fading channels, have been derived in this paper. The validity of the proposed analysis is proven by simulation, which showed that the numerical results are consistent with the theoretical analysis in terms of the outage probability, the BER and the average channel capacity. It is also shown that the full spatial diversity order can always be obtained at the signal-to-noise ratio (SNR) range of [0dB, 15dB] in the presence of multiple potential relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• 한국통신학회논문지
• /
• 제34권12A호
• /
• pp.949-961
• /
• 2009

본 논문에서는 하이브리드 복호 후 전달(HDF)기법을 이용하는 2홉 무선 통신 네트워크의 BER(Bit Error Rate) 성능을 분석한다. 기존의 HDF 기법은 릴레이에서 복호된 데이터의 전달유무를 수신되는 신호 대 잡음비(SNR)를 기준으로 한다. 반면 본 논문에서는 SNR 기준 방식 대신 대수 우도비(Log Likelihood Ratio, LLR) 분석 기법을 제안한다. 제안한 새로운 HDF 기법의 근사적 BER 표현식을 유도하며, Monte-Carlo 시뮬레이션으로 검증한다. 또한 HDF 기법을 위한 최적의 임계값을 계산한다. 다양한 수식으로 인한 결론은 본 논문에서 제안하는 LLR기반 HDF가 기존의 SNR기반 HDF보다 레일리 페이딩채널과 AWGN환경에서 어떠한 임계값과 어떠한 릴레이 위치에도 뛰어난 성능을 보임을 증명한다.

• ETRI Journal
• /
• 제33권2호
• /
• pp.287-290
• /
• 2011

We consider a two-hop multiple-relay network implemented with opportunistic decode-and-forward cooperative strategy, where the first hop and second hop links experience different fading (Rayleigh and Rician). We derive the exact expressions of end-to-end outage probability and analyze the approximate results in high signal-to-noise ratio region. The analysis shows that the same diversity order can be achieved even in different mixed fading environments. Simulation results are provided to verify our analysis.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.352-363
• /
• 2012

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

• Journal of Communications and Networks
• /
• 제11권5호
• /
• pp.445-454
• /
• 2009

Cooperative transmission protocols are always designed to achieve the largest diversity gain and the network capacity simultaneously. The concept of diversity-multiplexing tradeoff (DMT) in multiple input multiple output (MIMO) systems has been extended to this field. However, DMT constrains a better understanding of the asymptotic interplay between transmission rate, outage probability (OP) and signal-to-noise ratio. Another formulation called the throughput-reliability tradeoff (TRT) was then proposed to avoid such a limitation. By this new rule, Azarian and Gamal well elucidated the asymptotic trends exhibited by the OP curves in block-fading MIMO channels. Meanwhile they doubted whether the new rule can be used in more general channels and protocols. In this paper, we will prove that it does hold true in decode-and-forward cooperative protocols. We deduce the theoretic OP curves predicted by TRT and demonstrate by simulations that the OP curves will asymptotically overlap with the theoretic curves predicted by TRT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2047-2066
• /
• 2016

In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

• ETRI Journal
• /
• 제36권1호
• /
• pp.22-30
• /
• 2014

Recently, efficient partial relay selection (e-PRS) was proposed as an enhanced version of PRS. In comparing e-PRS, PRS, and the best relay selection (BRS), there is a tradeoff between complexity and performance; that is, the complexity for PRS, e-PRS, and BRS is low to high, respectively, but vice versa for performance. In this paper, we study the outage probability for e-PRS in decode-and-forward (DF) relaying systems over non-identical Nakagami-m fading channels, where the fading parameter m is an integer. In particular, we provide closed-form expressions of the exact outage probability and asymptotic outage probability for e-PRS in DF relaying systems. Numerical results show that e-PRS achieves similar outage performance to that of BRS for a low or medium signal-to-noise ratio, a high fading parameter, a small number of relays, and a large difference between the average channel powers for the first and the second hops.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.677-687
• /
• 2016

Multi-way relay networks (MWRNs) allow multiple users to exchange information with each other through a single relay terminal. MWRNs are often incorporated with capacity achieving lattice codes to enable the benefits of high-rate signal constellations to be extracted. In this paper, we analytically characterize the symbol error rate (SER) performance of a functional decode and forward (FDF) MWRN in the presence of channel estimation errors. Considering M-ary quadrature amplitude modulation (QAM) with square constellations as an important special case of lattice codes, we obtain asymptotic expressions for the average SER for a user in FDF MWRN. The accuracy of the analysis at high signal-to-noise ratio is validated by comparison with the simulation results. The analysis shows that when a user decodes other users with better channel conditions than itself, the decoding user experiences better error performance. The analytical results allow system designers to accurately assess the non-trivial impact of channel estimation errors and the users' channel conditions on the SER performance of a FDF MWRN with M-QAM modulation.

• 방송공학회논문지
• /
• 제15권6호
• /
• pp.783-790
• /
• 2010

양방향 중계 네트워크는 중계기에 중첩 부호화 또는 네트워크 부호화를 적용함으로써 기존의 단방향 중계 네트워크에 비해 향상된 주파수 효율을 제공한다. 한편, OFDMA 네트워크는 사용자에게 부반송파, 파워 등의 자원을 적응적으로 할당하여 네트워크의 성능향상을 얻을 수 있다. 본 논문에서는 복호후재전송을 사용하는 양방향 OFDMA 중계 네트워크에서 다중사용자를 위한 적응적 부반송파 할당 알고리즘을 제안한다. 제안된 알고리즘은 각 사용자 쌍의 최소 전송속도를 보장하며 모든 사용자 쌍에 대한 달성 합 전송속도를 최대화하기 위해 부반송파를 사용자 쌍과 중계기에 적응적으로 할당한다. 모의실험을 통해 제안된 알고리즘이 정적 알고리즘, 그리디 알고리즘 보다 우수한 성능을 보임을 확인한다.