• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.47-53
• /
• 2013

In this paper, we propose an incremental cooperative transmission protocol in two-way underlay cognitive radio networks. In the proposed protocol, two secondary sources attempt to transmit their packet to each other with help of a secondary relay under interference constraint. For performance evaluation, we derive exact closed-form expressions of average outage probability over Rayleigh fading channel. Then, we perform Monte Carlo simulations to verify the derivations. Results present that the simulation and theoretical results are in good agreement and the outage performance of the proposed protocol is better than that of two-way direct transmission protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.890-910
• /
• 2014

This paper investigates the spectrum hole utilization of cooperative schemes for the two-way relaying model in order to improve the utilization efficiency of limited spectrum holes in cognitive radio networks with imperfect spectrum sensing. We propose two specific bidirectional secondary data transmission (BSDT) schemes with two-step and three-step two-way relaying models, i.e., two-BSDT and three-BSDT schemes, where the spectrum sensing and the secondary data transmission are jointly designed. In the proposed cooperative schemes, the best two-way relay channel between two secondary users is selected from a group of secondary users serving as cognitive relays and assists the bi-directional communication between the two secondary users without a direct link. The closed-form asymptotic expressions for outage probabilities of the two schemes are derived with a primary user protection constraint over Rayleigh fading channels. Based on the derived outage probabilities, the spectrum hole utilization is calculated to evaluate the percentage of spectrum holes used by the two secondary users for their successful information exchange without channel outage. Numerical results show that the spectrum hole utilization depends on the spectrum sensing overhead and the channel gain from a primary user to secondary users. Additionally, we compare the spectrum hole utilization of the two schemes as the varying of secondary signal to noise ratio, the number of cognitive relays, and symmetric and asymmetric channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3498-3511
• /
• 2016

We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.645-654
• /
• 2012

In this paper, we consider a two-way relay (TWR) system, where two user nodes exchange their information within two transmission phases, by the help of a relay node adopting physical layer network coding. In the system, two users transmit their binary phase shift keying symbols simultaneously in the first phase, and the relay node decodes the XORed version of two user data and broadcasts it back to two users in the second phase. The performance of the system is analyzed in terms of the average end-to-end symbol error probability in Nakagami-m fading channels, for which a tight upper bound is derived in a closed form to provide an accurate and handy estimate on the performance. The results show that our upper bounds are almost indistinguishable from simulation results for various channel and system configurations. In addition, the optimal relay location and power allocation for various conditions can be obtained quickly with our analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2B
• /
• pp.97-109
• /
• 2012

In this paper, we propose a modulation scheme for a network-coded bi-directional relaying (NBR) system over an asymmetric channel, which means that the qualities of the relay channel (the link between the BS and RS) and access channel (the link between the RS and MS) are not identical. The proposed scheme employs a dual constellation in such a way that the RS broadcasts the network-coded symbols modulated by two different constellations to the MS and BS over two consecutive transmission intervals. We derive an upper bound on the average bit error rate (BER) of the proposed scheme, and compare it with the hybrid constellation-based modulation scheme proposed for the asymmetric bi-directional link. Furthermore, we investigate the channel utilization of the existing bi-directional relaying schemes as well as the NBR system with the proposed dual constellation diversity-based modulation (DCD). From our simulation results, we show that the DCD gives better average BER performance about 3.5~4dB when $E_b/N_0$ is equal to $10^{-2}$, while maintaining the same spectral efficiency as the existing NBR schemes over the asymmetric bi-directional relaying channel.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.102-110
• /
• 2013

This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2131-2139
• /
• 2014

In this paper, a binary-coded physical-layer network coding (PNC) is considered when high-order modulation techniques are used at source nodes in wireless communication environments. In the conventional PNC schemes, tight power control and phase compensation are required at a relay node. However, they may not be feasible in practical wireless communication environments. Thus, we do not assume the pre-equalization in this paper, and we only utilize the channel state information at receiver (CSIR). We propose a signal detection method for the binary-coded PNC with high-order modulation, such as QPSK and 16QAM, at the source nodes, while the conventional scheme only consider the BPSK at source nodes. We also analyze the bit-error performance of the proposed technique in both uncoded and coded cases.