• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.601-608
• /
• 2011

In OFDMA(Orthogonal Frequency Division Multiple Access) based multi-hop networks, the subcarrier-pairing scheme using the SNR(Signal-to-Noise Ratio) has been proposed as the best solution. But, this scheme is not optimal in cognitive radio system, because of the power control due to the interference to the primary user. In this paper, we propose two subcarrier-pairing schemes for OFDMA based 2-hop cognitive radio systems. One is the IT(Interference channel gain) scheme considering only the interference channel gain, and the other is the CI(Channel SNR over interference channel gain) scheme considering the ratio of channel SNR to interference channel gain. The results show that the CI scheme has the best performance in which throughput is improved more than 10% in comparison with other schemes.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.846-858
• /
• 2020

The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.443-450
• /
• 2013

We consider user pairing and resource allocation for the uplink of cellular systems employing virtual multiple input multiple output (MIMO). As a multiple access scheme, discrete Fourier transform spread orthogonal frequency division multiple access (DFTS-OFDMA) is adopted for more flexible resource allocation than single carrier (SC)-OFDMA adopted in the Long Term Evolution (LTE) system. We formulate the optimization problems of user pairing and resource allocation to maximize the throughput of the DFTS-OFDMA system under different constraints. The DFTS-OFDMA allowing non-contiguous subcarrier allocation and redundant user assignment provides a better throughput than the SC-FDMA at lower complexity in finding the optimal solution but at the cost of the increased control information indicating the allocated resources.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.27-33
• /
• 2015

In this paper, we consider a joint frequency-domain scheduling and user-pairing problem for virtual MIMO in the single carrier frequency division multiple access (SC-FDMA) system, e.g., the uplink transmission for third generation partnership project-long term evolution (3GPP-LTE) standard. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling so as to deal with the complexity issue in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2350-2364
• /
• 2014

This paper addresses the problem of resource allocation in amplify-and-forward (AF) relayed OFDM based cognitive radio networks (CRNs). The purpose of resource allocation is to maximize the overall throughput, while satisfying the constraints on the individual power and the interference induced to the primary users (PUs). Additionally, different from the conventional resource allocation problem, the rate-guarantee constraints of the subcarriers are considered. We formulate the problem as a mixed integer programming task and adopt the dual decomposition technique to obtain an asymptotically optimal power allocation, subcarrier pairing and relay selection. Moreover, we further design a suboptimal algorithm that sacrifices little on performance but could significantly reduce computational complexity. Numerical simulation results confirm the optimality of the proposed algorithms and demonstrate the impact of the different constraints.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1357-1372
• /
• 2017

Energy harvesting techniques, particularly radio frequency energy harvesting (RF-EH) techniques, which are known to provide feasible solutions to enhance the performance of energy constrained wireless communication systems, have gained increasing attention. In this paper, we consider a wireless-powered cooperative communication network (WPCCN) for transferring energy in the downlink and forwarding signals in the uplink. The objective is to maximize the average transmission rate of the system, subject to the total network power constraint. We formulate such a problem as a form of wireless energy transmission based on resource allocation that searches for the joint subcarrier pairing and the time and power allocation, and this can be solved by using a dual approach. Simulation results show that the proposed joint optimal scheme can efficiently improve system performance with an increase in the number of subcarriers and relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.152-167
• /
• 2016

This paper investigates the simultaneous wireless information and power transfer (SWIPT) for two-hop orthogonal frequency division multiplexing (OFDM) decode-and-forward (DF) relay network, where a relay harvests energy from radio frequency signals transmitted by a source and then uses the harvested energy to assist information transmission from the source to its destination. The power splitting receiver is considered at the relay. To explore the performance limit of such a SWIPT-enabled system, a resource allocation (RA) optimization problem is formulated to maximize the achievable information rate of the system, where the power allocation, the subcarrier pairing and the power splitting factor are jointly optimized. As the problem is non-convex and there is no known solution method, we first decompose it into two separate subproblems and then design an efficient RA algorithm. Simulation results demonstrate that our proposed algorithm can achieve the maximum achievable rate of the system and also show that to achieve a better system performance, the relay node should be deployed near the source in the SWIPT-enabled two-hop OFDM DF relay system, which is very different from that in conventional non-SWIPT system where the relay should be deployed at the midpoint of the line between the source and the destination.