• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.307-314
• /
• 2010

In this paper, a receive diversity combining technique is proposed for single-carrier frequency division multiple access (SC-FDMA)-based cooperative relay systems when discrete Fourier transform (DFT) spreading sizes for mobile station (MS) and relay station (RS) are different. The proposed technique is composed of a DFT spreading size adjustment block, a phase rotation compensation block, a channel phase compensation block, and a receive diversity combining block. The proposed technique is robust to multipath channels and can be operated with a relatively small computational complexity because receive diversity combining is performed with scalar operations in the frequency-domain. It is shown by computer simulation that the proposed receive diversity combining techniques achieve a performance gain over the conventional maximal ratio combining (MRC) techniques for SC-FDMA-based cooperative relay systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.75-80
• /
• 2011

In the cooperative communication, The relay that transmit signal to destination can achieve diversity gain. But transmitter and relay must have own frequency to transmit signal to destination. If Relay is secondary user and does not have own frequency, relay can't transmit signal to destination. So, To analysis performance of cognitive radio We need to consider detection probability of secondary user. In the paper we propose cooperative communication system considering detection probability. And to compare proposed system and conventional, we also simulate incremental cooperative communication. Through the simulation result, we can know that BER performance of proposed scheme is better than incremental relaying in the cognitive radio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.479-486
• /
• 2010

In this paper, we propose a novel low-complexity Alamouti coded orthogonal frequency division multiplexing (OFDM) scheme for asynchronous cooperative communications. Exploiting the combination of OFDM symbols at the source node and simple operations including sign change and complex product at the relay node, the proposed scheme can achieve cooperative diversity gain without use of time-reversion and shifting operations that the conventional scheme proposed by Li and Xia needs. In addition, by using the cyclic prefix (CP) removal and insertion operations at the relay node, the proposed scheme does not suffer from a considerable degradation of bit-error-rate (BER) performance even though perfect timing synchronization is not achieved at the relay node. From the simulation results, it is demonstrated that the BER performance of the proposed scheme is much superior to that of the conventional scheme in the presence of timing synchronization error at the relay node. It is also shown that the proposed scheme obtains two times higher diversity gain compared with the conventional scheme at the cost of half reduction in transmission efficiency.

• Journal of information and communication convergence engineering
• /
• v.11 no.4
• /
• pp.229-234
• /
• 2013

Diversity-multiplexing tradeoff (DMT) characterizes the fundamental relationship between the diversity gain in terms of outage probability and the multiplexing gain as the normalized rate parameter r, where the limiting transmission rate is give by rlog SNR (here, SNR denote the received signal-to-noise ratio). In this paper, we analyze the DMT and performance of an underwater network with a cooperative relay. Since over an acoustic channel, the propagation delay is commonly considerably higher than the processing delay, the existing transmission protocols need to be explained accordingly. For this underwater network, we briefly describe two well-known relay transmissions: decode-and-forward (DF) and amplify-and-forward (AF). As our main result, we then show that an instantaneous DF relay scheme achieves the same DMT curve as that of multiple-input single-output channels and thus guarantees the DMT optimality, while using an instantaneous AF relay leads at most only to the DMT for the direct transmission with no cooperation. To validate our analysis, computer simulations are performed in terms of outage probability.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.446-460
• /
• 2024

In this paper, we mathematically investigate a downlink non-orthogonal multiple access (NOMA) system for short-packet communications (SPC) in which the near users are used as full-duplex (FD) relays to forward intended signals from the source to a far user. In addition, partial relay selection is employed to enhance the performance of the FD relays under the impact of imperfect interference cancellation. At the far user, selection combining (SC) or maximal ratio combining (MRC) is employed to combine the signals received from the source and the selected FD relay. The analytical expressions for the average block error rate (BLER) of two users over flat Rayleigh fading channels are derived. Furthermore, closed-form asymptotic expressions of the average BLERs at the near and far users in high signal-to-noise ratio (SNR) regimes are obtained. The numerical results show that the analytical BLERs of the near user and far user closely match the simulation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.7-12
• /
• 2014

The data forwarding transmission is an important function of the relay in cooperative communication in wireless communication systems. However, additional relay cause the waste of power consumption and cost. Therefore, in this paper, we consider how to use the user mobile devices in stead of relays to deal with this problem. In this paper, we proposed the protocol that divide each relay into two states of idle and non-idle. The receiver has two functions of base station and user mobile device. In this case, it is possible that no additional cost, and improve the spectral efficiency and network capacity. We verified BER performance for the proposed protocol over Rayleigh fading through Monte-Carlo simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.215-223
• /
• 2008

Retransmission signals from relays to destination when the destination fails to decode received signal from the source in Automatic Repeat Request (ARQ) protocol make the destination receive signals more reliably. With using omni -direction antenna in the practical system, in communication range of both the source antenna and the destination antenna, there are some relays that can be used to transmit signal to the destination. However, using all relays to transmit signal consume power and bandwidth. In this paper, we propose a new protocol in which the best relays are chosen based on threshold of distance from the source to the relay and the relay to the destination when the relays use decode- and forward (DF) protocol. Simulation results prove the efficiency of the protocol when we compare using only the best relays with using all relays to transmit signal to the destination.

• ETRI Journal
• /
• v.40 no.6
• /
• pp.714-725
• /
• 2018

Destination-assisted jamming (DAJ) is usually used to protect confidential information against untrusted relays and eavesdroppers in wireless networks. In this paper, a DAJ-based untrusted relay network with multiple antennas installed is presented. To increase the secrecy, a joint optimization of beamforming and power allocation at the source and destination is studied. A matched-filter precoder is introduced to maximize the cooperative jamming signal by directing cooperative jamming signals toward untrusted relays. Then, based on generalized singular-value decomposition (GSVD), a novel transmitted precoder for confidential signals is devised to align the signal into the subspace corresponding to the confidential transmission channel. To decouple the precoder design and optimal power allocation, an iterative algorithm is proposed to jointly optimize the above parameters. Numerical results validate the effectiveness of the proposed scheme. Compared with other schemes, the proposed scheme shows significant improvement in terms of security performance.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.758-768
• /
• 2021

In this work, the secrecy of a typical wireless cooperative dual-hop non-orthogonal multiple access (NOMA)-enabled decode-and-forward (DF) relay network is investigated with the impact of collaborative and non-collaborative eavesdropping. The system model consists of a source that broadcasts the multiplexed signal to two NOMA users via a DF relay, and information security against the eavesdropper nodes is provided by a helpful jammer. The performance metric is secrecy rate and ergodic secrecy capacity is approximated analytically. In addition, a differential evolution algorithm-based power allocation scheme is proposed to find the optimal power allocation factors for relay, jammer, and NOMA users by employing different jamming schemes. Furthermore, the secrecy rate analysis is validated at the NOMA users by adopting different jamming schemes such as without jamming (WJ) or conventional relaying, jamming (J), and with control jamming (CJ). Simulation results demonstrate the superiority of CJ over the J and WJ schemes. Finally, the proposed power allocation outperforms the fixed power allocation under all conditions considered in this work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.803-809
• /
• 2014

In this paper, we investigate physical layer security in a cooperative cognitive radio networks (CRN) with a relay selection in the presence of a primary user and an eavesdropper. To protect the CRN from wiretapping by the eavesdropper, we propose employing an opportunistic relay selection scheme and multiple antennas at the destination that work based on the availability of channel state information at the receivers. Under these configurations, we derive an exact closed-form expression for the secrecy outage probability of the CRN, and also derive an asymptotic probability. Numerical results will be presented to verify the analysis.