• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.257-265
• /
• 2011

In this paper, a cooperative relaying protocol called soft-decision-and-forward (SDF) with multiple antennas in each node is introduced. SDF protocol exploits the soft decision source symbol values from the received signal at the relay node. For orthogonal transmission (OT), orthogonal codes including Alamouti code are used and for non-orthogonal transmission (NT), distributed space-time codes are designed by using a quasi-orthogonal space-time block code. The optimal maximum likelihood (ML) decoders for the proposed protocol with low decoding complexity are proposed. For OT, the ML decoders are derived as symbolwise decoders while for NT, the ML decoders are derived as pairwise decoders. It can be seen through simulations that SDF protocol outperforms AF protocol for both OT and NT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1026-1040
• /
• 2012

For a single relay channel, we compare the capacity of two different amplify-and-forward (AF) protocols, which are orthogonal AF (OAF) and non-orthogonal AF (NAF). The NAF protocol has been proposed to overcome a significant loss of performance of OAF in the high spectral efficiency region, and it was also theoretically proved that NAF performs better than OAF in terms of the diversity-multiplexing tradeoff. However, existing results have been evaluated at the asymptotically high signal to noise ratio (SNR), thus the power allocation problem between the source and the relay was neglected. We examine which protocol has better performance in a practical system operating at a finite SNR. We also study where a relay should be located if we consider the power allocation problem. A notable conclusion is that the capacity performance depends on both SNR and power allocation ratio, which indicates OAF may perform better than NAF in a certain environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5862-5887
• /
• 2019

In this paper, we propose a two-way relaying scheme using non-orthogonal multiple access (NOMA) technology. In this scheme, two sources transmit packets with each other under the assistance of the decode-and-forward (DF) relays, called as a TWDFNOMA protocol. The cooperative relays exploit successive interference cancellation (SIC) technique to decode sequentially the data packets from received summation signals, and then use the digital network coding (DNC) technique to encrypt received data from two sources. A max-min criterion of end-to-end signal-to-interference-plus-noise ratios (SINRs) is used to select a best relay in the proposed TWDFNOMA protocol. Outage probabilities are analyzed to achieve exact closed-form expressions and then, the system performance of the proposed TWDFNOMA protocol is evaluated by these probabilities. Simulation and analysis results discover that the system performance of the proposed TWDFNOMA protocol is improved when compared with a conventional three-timeslot two-way relaying scheme using DNC (denoted as a TWDNC protocol), a four-timeslot two-way relaying scheme without using DNC (denoted as a TWNDNC protocol) and a two-timeslot two-way relaying scheme with amplify-and-forward operations (denoted as a TWANC protocol). Particularly, the proposed TWDFNOMA protocol achieves best performances at two optimal locations of the best relay whereas the midpoint one is the optimal location of the TWDNC and TWNDNC protocols. Finally, the probability analyses are justified by executing Monte Carlo simulations.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.597-602
• /
• 2007

In conventional cooperative communication data rate is 1/2 than non cooperative protocols. In this paper, we propose a full data rate DF (Decode and Forward) cooperative transmission scheme. Proposed scheme is based on time division multiplexing (TDM) channel access. When DF protocol has full data rate, it can not obtain diversity gain under the pairwise error probability (PEP) view point. If it increases time slot to obtain diversity gain, then data rate is reduced. The proposed algorithm uses orthogonal frequency and constellation rotation to obtain both full data rate and diversity order 2. Moreover, performance is analyzed according to distance and optimized components that affect the system performance by using computer simulation. The simulation results revealed that the cooperation can save the network power up to 7dB over direct transmission and 5dB over multi-hop transmission at BER of $10^{-2}$. Besides, it can improve date rate of system compared with the conventional DF protocol.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.499-505
• /
• 2015

We analyze the performance of multistage cooperation in decode-and-forward relay networks where the transmission between source and destination takes place in $T{\geq}2$ equal duration and orthogonal time phases with the help of relays. The source transmits only in the first time phase. All relays that can decode the source's transmission forward the source's message to the destination in the second time phase, using a space-time code. During subsequent time phases, the relays that have successfully decoded the source message using information from all previous transmitting relays, transmit the space-time coded symbols for the source's message. The non-decoding relays keep accumulating information and transmit in the later stages when they are able to decode. This process continues for T cooperation phases. We develop and analyze the outage probability of multistage cooperation protocol under orthogonal relaying. Through analytical results, we obtain the near-optimal placement strategy for relays that gives the best performance when compared with most other candidate relay location strategies of interest. For different relay network topologies, we also investigate an interesting tradeoff between an increased SNR and decreased spectral efficiency as the number of cooperation stages is increased. It is also shown that the largest multistage cooperation gain is obtained in the low and moderate SNR regime.