• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.108-111
• /
• 2013

최근 들어 무선 통신 트래픽이 급증하고 있다. 때문에 주파수, 시간 등과 같은 무선 통신 자원의 효율적 활용이 매우 중요해 지고 있다. 이러한 관점에서 스펙트럼 효율이 낮은 단방향 중계 시스템에 비해 이론적으로 약 2배에 가까운 스펙트럼 효율을 갖는 양방향 중계 기술에 대한 연구가 최근 들어 활발히 이루어지고 있다. 하지만 양방향 중계 시스템이 갖는 높은 스펙트럼 효율을 극대화하기 위해서는 단방향 릴레이 시스템에 비하여 증가하는 오버헤드의 증가량을 최소화하면서 요구 성능을 만족하는 것이 매우 중요하다. 이러한 문제를 해결하기 위한 하나의 대안으로 본 논문에서는 증폭 후 재전송(amplify-and-forward) 양방향 중계시스템에서 결합적 간섭제거 및 채널 등화를 위한 적응형 수신기를 제안한다. 제안하는 수신기는 적은 오버헤드만을 갖기 때문에 양방향 중계기술이 갖는 높은 스펙트럼 효율을 그대로 유지할 수 있으며, 복잡도가 높은 역행렬 연산 없이 채널 추정 기반 최소평균자승에러 (minimum mean-square error) 수신기가 갖는 성능을 제공한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.288-289
• /
• 2019

This paper studies the secrecy capacity for a wireless cooperative network with perfect channel state information at the relays, and receiver. A similar assumption is also made for the instance where there exist a direct link between the transmitter and receiver. Physical Layer security techniques are employed in wireless networks to mitigate against the activity of eavesdroppers. It offers a viable alternative to computationally intensive encryption. In this paper the design of a protocol utilizing jamming (via jamming nodes) for better security and relaying (via relay nodes) for the amplify-and-forward (AF) operation, is investigated. A a signal-to-noise variant of secrecy known as secrecy gap is explored because of its use of lesser computational power - preferable for practical systems. Thus we maximize this signal-to-noise approach instead of the conventional secrecy capacity maximization method. With this, an iterative algorithm using geometric programming (GP) and semi-definite programming (SDP) is presented with appreciable benefits. The results show here highlight the benefits of using fractional components of the powers of the relays to offer better secrecy capacity.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.460-470
• /
• 2015

Orthogonal frequency-division multiplexing (OFDM) is one of the most widely used technologies in current wireless communication systems and standards. Cognitive radio (CR) provides a robust solution to the problem of spectrum congestion as it offers opportunistic usage of frequency bands that are not occupied by primary users. Due to the underlying sensing, spectrum shaping, scaling, and interoperable capabilities of OFDM, it has been adapted as a best transmission technology for CR wireless systems. However, the performance of an OFDM-based CR wireless system is affected by the existence of narrowband interference (NBI) from other users. Further, due to carrier frequency offset in NBI sources, NBI energy may spread over all subcarriers of an OFDM signal. In this paper, a fixed Amplify-and-Forward (AF) relay that operates at a frequency band that is different from that of direct mode is introduced to suppress the effect of NBI. Analytical expressions are derived for outage probability in direct, AF-relay, and incremental relaying modes. The outage performance of the proposed AF relay-based CR network is proven to be better than that of direct mode.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4957-4976
• /
• 2016

This paper investigates the error performance of the amplify-and-forward (AF) relaying systems in the context of full-duplex (FD) communication. In addition to the inherent self-interference (SI) due to simultaneous transmission and reception, coexistent FD terminals may cause crosstalk. In this paper, we utilize the information exchange via the crosstalk channel to construct a particular distributed space-time code (DSTC). The residual SI is also considered. Closed-form pairwise error probability (PEP) is first derived. Then we obtain the upper bound of PEP in high transmit power region to provide more insights of diversity and coding gain. The proposed DSTC scheme can attain full cooperative diversity if the variance of SI is not a function of the transmit power. The coding gain can be improved by lengthening the frame and proper power control. Feasibility and efficiency of the proposed DSTC are verified in numerical simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.338-344
• /
• 2017

In this paper, two-way amplify-and-forward relay methods are investigated where two terminals and one relay node are equipped with multiple antennas. In two-way relay channels, it is assumed that one terminal can eliminate its own self-interference but the other cannot. For this channel, we first maximize the sum-rate performance by employing an iterative gradient descent (GD) algorithm. Then, a simple singular value decomposition (SVD) based block triangularization is developed to null the self-interference. Simulation results show the proposed methods outperform the conventional schemes for various environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2831-2847
• /
• 2017

In this paper, a joint destination-relay selection and antenna mode selection scheme for full-duplex (FD) relay network is investigated, which consists of one source node, N FD amplify-and-forward (AF) relays and M destination nodes. Multiple antennas are configured at the source node, and beamforming technique is adopted. Two antennas are employed at each relay, one for receiving and the other for transmitting. Only one antenna is equipped at each destination node. In the proposed scheme, the best destination node is firstly selected according to the direct links between the source node and destination nodes. Then the transmit and receive mode of two antennas at each relay is adaptively selected based on the relaying link condition. Meanwhile, the best relay with the optimal Tx/Rx antenna configuration is selected to forward the signals. To characterize the performance of the proposed scheme, the closed-form expression of the outage probability is derived; meanwhile, the simple asymptotic expressions are also obtained. Our analysis shows that the proposed scheme obtains the benefits of multi-relay diversity and multi-destination diversity. Moreover, extra space diversity in the medium SNR region can be achieved due to the antenna selection at the relay. Finally, Monte-Carlo simulations are provided to consolidate the analytical results, and show the effectiveness of the proposed scheme.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.266-276
• /
• 2011

In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.215-223
• /
• 2015

Energy harvesting technique is an energy charging technique for communication device in energy-constrained environment. Recently, energy harvesting technique that harvests energy from wireless radio frequency signal is proposed. Representatively, there are time switching technique and power splitting technique. This paper proposes an optimal harvesting time allocation scheme in a wireless cognitive relay network when secondary user relay uses energy harvesting technique to transmit information. Secondary user relay receives information and energy simultaneously from the secondary user source's signal via time switching technique. We aim to maximize the instantaneous throughput by optimizing harvesting time of the secondary user relay. Simulation results show that using optimized harvesting time gets larger instantaneous throughput compared to using constant harvesting time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.12-17
• /
• 2009

We consider an OFDM based multiple AF relaying systems. Since the channel between first hop (source station-relay station) and second hop (relay station -destination station) varies independently, the subcarrier in the first hop can be paired to another subcarrier in the second hop for the increase of the system capacity. The conventional pairing which uses the brute force searching requires large complexity while giving optimal pairing for maximum system capacity. In this paper, we present sub-optimal subcarrier pairing scheme with low complexity. Every RS firstly pairs the subcarrier with the highest channel gain in the first hop to the subcarrier with highest channel gain in the second hop. The pair with the highest SNR among all the pairs is determined as final selected pair and the corresponding subcarriers are not selected at other RSs in the next paring iteration. This process is repeated until all the subcarriers are paired. Simulation results show the proposed pairing scheme achieves near optimal performance with low complexity.